/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 22:59:44,227 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 22:59:44,280 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-13 22:59:44,287 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 22:59:44,287 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 22:59:44,308 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 22:59:44,308 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 22:59:44,309 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 22:59:44,309 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 22:59:44,309 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 22:59:44,309 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 22:59:44,309 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 22:59:44,310 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 22:59:44,310 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 22:59:44,310 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 22:59:44,311 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 22:59:44,311 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 22:59:44,311 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 22:59:44,311 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:59:44,312 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:59:44,312 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 22:59:44,312 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 22:59:44,313 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 22:59:44,313 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 22:59:44,313 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 22:59:44,313 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> FINITE_AUTOMATA Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-13 22:59:44,540 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 22:59:44,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 22:59:44,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 22:59:44,548 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 22:59:44,550 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 22:59:44,551 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2025-04-13 22:59:45,843 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a24df054/0b50ab77eecb45209732b3aae51ae0a5/FLAGa28d4d2dd [2025-04-13 22:59:46,030 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 22:59:46,031 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2025-04-13 22:59:46,037 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a24df054/0b50ab77eecb45209732b3aae51ae0a5/FLAGa28d4d2dd [2025-04-13 22:59:47,044 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2a24df054/0b50ab77eecb45209732b3aae51ae0a5 [2025-04-13 22:59:47,046 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 22:59:47,047 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 22:59:47,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 22:59:47,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 22:59:47,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 22:59:47,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@289a0d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47, skipping insertion in model container [2025-04-13 22:59:47,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,063 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 22:59:47,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2592,2605] [2025-04-13 22:59:47,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:59:47,257 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 22:59:47,290 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c[2592,2605] [2025-04-13 22:59:47,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 22:59:47,308 INFO L204 MainTranslator]: Completed translation [2025-04-13 22:59:47,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47 WrapperNode [2025-04-13 22:59:47,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 22:59:47,310 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 22:59:47,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 22:59:47,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 22:59:47,315 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,341 INFO L138 Inliner]: procedures = 23, calls = 28, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 83 [2025-04-13 22:59:47,342 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 22:59:47,343 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 22:59:47,343 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 22:59:47,343 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 22:59:47,350 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,350 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,352 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,367 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-13 22:59:47,368 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,368 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,376 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,377 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,378 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,378 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,381 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 22:59:47,381 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 22:59:47,381 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 22:59:47,381 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 22:59:47,383 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (1/1) ... [2025-04-13 22:59:47,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 22:59:47,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:47,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-13 22:59:47,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-13 22:59:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-13 22:59:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-13 22:59:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 22:59:47,434 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 22:59:47,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 22:59:47,435 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 22:59:47,435 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 22:59:47,505 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 22:59:47,506 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 22:59:47,711 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 22:59:47,712 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 22:59:47,712 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 22:59:47,963 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:59:47,965 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:59:47,967 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 22:59:47,970 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 22:59:47,971 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:59:47 BoogieIcfgContainer [2025-04-13 22:59:47,971 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 22:59:47,972 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 22:59:47,972 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 22:59:47,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 22:59:47,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 10:59:47" (1/3) ... [2025-04-13 22:59:47,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2197cfaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:59:47, skipping insertion in model container [2025-04-13 22:59:47,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 10:59:47" (2/3) ... [2025-04-13 22:59:47,976 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2197cfaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 10:59:47, skipping insertion in model container [2025-04-13 22:59:47,976 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 10:59:47" (3/3) ... [2025-04-13 22:59:47,977 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2025-04-13 22:59:48,001 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 22:59:48,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-min-array.wvr.c that has 4 procedures, 26 locations, 29 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-13 22:59:48,003 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 22:59:48,045 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-13 22:59:48,068 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 32 transitions, 85 flow [2025-04-13 22:59:48,102 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,122 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 22:59:48,130 INFO L340 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=FINITE_AUTOMATA, 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;@490d4bb4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 22:59:48,130 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-13 22:59:48,133 INFO L278 IsEmpty]: Start isEmpty. Operand has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,141 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 22:59:48,141 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:48,141 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:48,142 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:48,144 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:48,145 INFO L85 PathProgramCache]: Analyzing trace with hash 149242308, now seen corresponding path program 1 times [2025-04-13 22:59:48,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:48,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495543724] [2025-04-13 22:59:48,149 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:48,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:48,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 22:59:48,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 22:59:48,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:48,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:48,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:48,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:48,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495543724] [2025-04-13 22:59:48,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495543724] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:48,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:48,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:59:48,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979404534] [2025-04-13 22:59:48,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:48,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:59:48,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:48,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:59:48,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:59:48,396 INFO L87 Difference]: Start difference. First operand has 193 states, 192 states have (on average 3.8802083333333335) internal successors, (745), 192 states have internal predecessors, (745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:48,457 INFO L93 Difference]: Finished difference Result 257 states and 928 transitions. [2025-04-13 22:59:48,458 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:59:48,459 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-04-13 22:59:48,459 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:48,469 INFO L225 Difference]: With dead ends: 257 [2025-04-13 22:59:48,469 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 22:59:48,471 INFO L436 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-04-13 22:59:48,474 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 19 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:48,475 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 0 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:59:48,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 22:59:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 22:59:48,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 3.6614583333333335) internal successors, (703), 192 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 703 transitions. [2025-04-13 22:59:48,514 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 703 transitions. Word has length 15 [2025-04-13 22:59:48,515 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:48,515 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 703 transitions. [2025-04-13 22:59:48,515 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,515 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 703 transitions. [2025-04-13 22:59:48,516 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-13 22:59:48,516 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:48,516 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:48,517 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 22:59:48,517 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:48,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:48,517 INFO L85 PathProgramCache]: Analyzing trace with hash 28457807, now seen corresponding path program 1 times [2025-04-13 22:59:48,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:48,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740108887] [2025-04-13 22:59:48,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:48,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:48,530 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-13 22:59:48,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-13 22:59:48,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:48,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:48,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:48,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:48,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740108887] [2025-04-13 22:59:48,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740108887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:48,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:48,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 22:59:48,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550636674] [2025-04-13 22:59:48,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:48,602 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:59:48,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:48,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:59:48,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:59:48,603 INFO L87 Difference]: Start difference. First operand 193 states and 703 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:48,652 INFO L93 Difference]: Finished difference Result 232 states and 803 transitions. [2025-04-13 22:59:48,652 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:59:48,652 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-04-13 22:59:48,653 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:48,655 INFO L225 Difference]: With dead ends: 232 [2025-04-13 22:59:48,655 INFO L226 Difference]: Without dead ends: 193 [2025-04-13 22:59:48,656 INFO L436 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-04-13 22:59:48,658 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 14 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:48,658 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 0 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 22:59:48,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2025-04-13 22:59:48,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2025-04-13 22:59:48,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 192 states have (on average 3.46875) internal successors, (666), 192 states have internal predecessors, (666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 666 transitions. [2025-04-13 22:59:48,674 INFO L79 Accepts]: Start accepts. Automaton has 193 states and 666 transitions. Word has length 17 [2025-04-13 22:59:48,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:48,674 INFO L485 AbstractCegarLoop]: Abstraction has 193 states and 666 transitions. [2025-04-13 22:59:48,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,674 INFO L278 IsEmpty]: Start isEmpty. Operand 193 states and 666 transitions. [2025-04-13 22:59:48,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-04-13 22:59:48,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:48,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:48,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-13 22:59:48,675 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:48,676 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:48,676 INFO L85 PathProgramCache]: Analyzing trace with hash 2101271198, now seen corresponding path program 1 times [2025-04-13 22:59:48,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:48,676 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527722223] [2025-04-13 22:59:48,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:48,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:48,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 22:59:48,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 22:59:48,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:48,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:48,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:48,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:48,826 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527722223] [2025-04-13 22:59:48,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527722223] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:48,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:48,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 22:59:48,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619921960] [2025-04-13 22:59:48,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:48,826 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 22:59:48,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:48,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 22:59:48,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:59:48,827 INFO L87 Difference]: Start difference. First operand 193 states and 666 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:48,889 INFO L93 Difference]: Finished difference Result 385 states and 1331 transitions. [2025-04-13 22:59:48,889 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 22:59:48,889 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-04-13 22:59:48,890 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:48,891 INFO L225 Difference]: With dead ends: 385 [2025-04-13 22:59:48,891 INFO L226 Difference]: Without dead ends: 194 [2025-04-13 22:59:48,892 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 22:59:48,892 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:48,892 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:48,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2025-04-13 22:59:48,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2025-04-13 22:59:48,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 3.4559585492227978) internal successors, (667), 193 states have internal predecessors, (667), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 667 transitions. [2025-04-13 22:59:48,900 INFO L79 Accepts]: Start accepts. Automaton has 194 states and 667 transitions. Word has length 19 [2025-04-13 22:59:48,900 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:48,900 INFO L485 AbstractCegarLoop]: Abstraction has 194 states and 667 transitions. [2025-04-13 22:59:48,900 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 2 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:48,900 INFO L278 IsEmpty]: Start isEmpty. Operand 194 states and 667 transitions. [2025-04-13 22:59:48,901 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:48,901 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:48,901 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:48,901 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 22:59:48,901 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:48,901 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:48,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1885729036, now seen corresponding path program 1 times [2025-04-13 22:59:48,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:48,902 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372923266] [2025-04-13 22:59:48,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:48,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:48,908 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:48,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:48,932 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:48,932 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:49,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:49,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:49,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372923266] [2025-04-13 22:59:49,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372923266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:49,814 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747516254] [2025-04-13 22:59:49,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 22:59:49,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:49,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:49,817 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:49,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-13 22:59:49,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:49,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:49,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:49,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:49,898 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:49,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:49,954 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:59:50,302 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 22:59:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:50,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:50,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:51,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:51,029 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:51,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:51,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747516254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:51,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 7] total 24 [2025-04-13 22:59:51,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10194313] [2025-04-13 22:59:51,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:51,038 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-04-13 22:59:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:51,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-04-13 22:59:51,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2025-04-13 22:59:51,039 INFO L87 Difference]: Start difference. First operand 194 states and 667 transitions. Second operand has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:52,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:52,144 INFO L93 Difference]: Finished difference Result 410 states and 1294 transitions. [2025-04-13 22:59:52,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 22:59:52,145 INFO L79 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:52,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:52,147 INFO L225 Difference]: With dead ends: 410 [2025-04-13 22:59:52,147 INFO L226 Difference]: Without dead ends: 404 [2025-04-13 22:59:52,148 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=299, Invalid=1341, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 22:59:52,148 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 167 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1031 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1031 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:52,149 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 0 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1031 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:59:52,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-04-13 22:59:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 228. [2025-04-13 22:59:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 227 states have (on average 3.3127753303964758) internal successors, (752), 227 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 752 transitions. [2025-04-13 22:59:52,163 INFO L79 Accepts]: Start accepts. Automaton has 228 states and 752 transitions. Word has length 20 [2025-04-13 22:59:52,163 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:52,163 INFO L485 AbstractCegarLoop]: Abstraction has 228 states and 752 transitions. [2025-04-13 22:59:52,163 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.32) internal successors, (58), 25 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:52,163 INFO L278 IsEmpty]: Start isEmpty. Operand 228 states and 752 transitions. [2025-04-13 22:59:52,164 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:52,164 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:52,164 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:52,171 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-13 22:59:52,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:52,365 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:52,365 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:52,365 INFO L85 PathProgramCache]: Analyzing trace with hash 380437056, now seen corresponding path program 2 times [2025-04-13 22:59:52,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:52,365 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540230390] [2025-04-13 22:59:52,365 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 22:59:52,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:52,373 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:52,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:52,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 22:59:52,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:52,697 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:52,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:52,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540230390] [2025-04-13 22:59:52,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540230390] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:52,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:52,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:52,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135086507] [2025-04-13 22:59:52,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:52,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:52,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:52,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:52,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:52,698 INFO L87 Difference]: Start difference. First operand 228 states and 752 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:52,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:52,923 INFO L93 Difference]: Finished difference Result 276 states and 887 transitions. [2025-04-13 22:59:52,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:52,923 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:52,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:52,925 INFO L225 Difference]: With dead ends: 276 [2025-04-13 22:59:52,925 INFO L226 Difference]: Without dead ends: 270 [2025-04-13 22:59:52,925 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:52,926 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 356 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:52,926 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 356 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2025-04-13 22:59:52,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 244. [2025-04-13 22:59:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 243 states have (on average 3.288065843621399) internal successors, (799), 243 states have internal predecessors, (799), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 799 transitions. [2025-04-13 22:59:52,936 INFO L79 Accepts]: Start accepts. Automaton has 244 states and 799 transitions. Word has length 20 [2025-04-13 22:59:52,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:52,936 INFO L485 AbstractCegarLoop]: Abstraction has 244 states and 799 transitions. [2025-04-13 22:59:52,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:52,936 INFO L278 IsEmpty]: Start isEmpty. Operand 244 states and 799 transitions. [2025-04-13 22:59:52,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:52,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:52,937 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:52,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-13 22:59:52,937 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:52,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:52,937 INFO L85 PathProgramCache]: Analyzing trace with hash -387996232, now seen corresponding path program 3 times [2025-04-13 22:59:52,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:52,938 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109387587] [2025-04-13 22:59:52,938 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 22:59:52,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:52,946 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:52,956 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:52,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 22:59:52,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:53,245 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:53,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:53,246 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109387587] [2025-04-13 22:59:53,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109387587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:53,246 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:53,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:53,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044436438] [2025-04-13 22:59:53,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:53,246 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:53,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:53,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:53,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:53,247 INFO L87 Difference]: Start difference. First operand 244 states and 799 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:53,440 INFO L93 Difference]: Finished difference Result 282 states and 900 transitions. [2025-04-13 22:59:53,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-13 22:59:53,440 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:53,440 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:53,442 INFO L225 Difference]: With dead ends: 282 [2025-04-13 22:59:53,442 INFO L226 Difference]: Without dead ends: 276 [2025-04-13 22:59:53,442 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 22:59:53,443 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:53,443 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-04-13 22:59:53,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 250. [2025-04-13 22:59:53,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 249 states have (on average 3.2690763052208833) internal successors, (814), 249 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 814 transitions. [2025-04-13 22:59:53,451 INFO L79 Accepts]: Start accepts. Automaton has 250 states and 814 transitions. Word has length 20 [2025-04-13 22:59:53,451 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:53,451 INFO L485 AbstractCegarLoop]: Abstraction has 250 states and 814 transitions. [2025-04-13 22:59:53,452 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,452 INFO L278 IsEmpty]: Start isEmpty. Operand 250 states and 814 transitions. [2025-04-13 22:59:53,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:53,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:53,453 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:53,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-13 22:59:53,453 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:53,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:53,454 INFO L85 PathProgramCache]: Analyzing trace with hash 111654966, now seen corresponding path program 4 times [2025-04-13 22:59:53,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:53,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889181219] [2025-04-13 22:59:53,454 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 22:59:53,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:53,459 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:53,465 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:53,465 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 22:59:53,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:53,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:53,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:53,752 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889181219] [2025-04-13 22:59:53,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889181219] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:53,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:53,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 22:59:53,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697494902] [2025-04-13 22:59:53,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:53,753 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 22:59:53,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:53,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 22:59:53,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-04-13 22:59:53,753 INFO L87 Difference]: Start difference. First operand 250 states and 814 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:53,942 INFO L93 Difference]: Finished difference Result 290 states and 923 transitions. [2025-04-13 22:59:53,943 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 22:59:53,943 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:53,943 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:53,945 INFO L225 Difference]: With dead ends: 290 [2025-04-13 22:59:53,945 INFO L226 Difference]: Without dead ends: 284 [2025-04-13 22:59:53,945 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:53,945 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:53,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 22:59:53,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2025-04-13 22:59:53,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 248. [2025-04-13 22:59:53,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 247 states have (on average 3.2591093117408905) internal successors, (805), 247 states have internal predecessors, (805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 805 transitions. [2025-04-13 22:59:53,952 INFO L79 Accepts]: Start accepts. Automaton has 248 states and 805 transitions. Word has length 20 [2025-04-13 22:59:53,952 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:53,952 INFO L485 AbstractCegarLoop]: Abstraction has 248 states and 805 transitions. [2025-04-13 22:59:53,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:53,952 INFO L278 IsEmpty]: Start isEmpty. Operand 248 states and 805 transitions. [2025-04-13 22:59:53,953 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:53,953 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:53,953 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:53,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-13 22:59:53,953 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:53,954 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:53,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2104556000, now seen corresponding path program 5 times [2025-04-13 22:59:53,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:53,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070870958] [2025-04-13 22:59:53,954 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:53,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:53,962 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:53,972 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:53,972 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:53,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:54,392 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:54,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:54,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070870958] [2025-04-13 22:59:54,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070870958] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:54,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2098175518] [2025-04-13 22:59:54,392 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 22:59:54,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:54,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:54,395 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:54,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-13 22:59:54,433 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:54,451 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:54,451 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 22:59:54,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:54,452 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:54,454 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:54,476 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:59:54,624 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 22:59:54,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:54,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:55,155 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:55,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:55,186 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:55,188 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:55,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:55,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2098175518] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:55,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:55,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 22:59:55,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5417216] [2025-04-13 22:59:55,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:55,194 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:55,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:55,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:55,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=489, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:55,195 INFO L87 Difference]: Start difference. First operand 248 states and 805 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:56,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:56,478 INFO L93 Difference]: Finished difference Result 676 states and 2196 transitions. [2025-04-13 22:59:56,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-13 22:59:56,479 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:56,479 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:56,482 INFO L225 Difference]: With dead ends: 676 [2025-04-13 22:59:56,482 INFO L226 Difference]: Without dead ends: 603 [2025-04-13 22:59:56,483 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=410, Invalid=1660, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 22:59:56,484 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 201 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 892 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 892 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:56,484 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 0 Invalid, 935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 892 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:59:56,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2025-04-13 22:59:56,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 286. [2025-04-13 22:59:56,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 285 states have (on average 3.2771929824561403) internal successors, (934), 285 states have internal predecessors, (934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:56,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 934 transitions. [2025-04-13 22:59:56,494 INFO L79 Accepts]: Start accepts. Automaton has 286 states and 934 transitions. Word has length 20 [2025-04-13 22:59:56,494 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:56,494 INFO L485 AbstractCegarLoop]: Abstraction has 286 states and 934 transitions. [2025-04-13 22:59:56,494 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:56,494 INFO L278 IsEmpty]: Start isEmpty. Operand 286 states and 934 transitions. [2025-04-13 22:59:56,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:56,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:56,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:56,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-13 22:59:56,696 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-13 22:59:56,696 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:56,696 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:56,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2144292548, now seen corresponding path program 6 times [2025-04-13 22:59:56,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:56,696 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866862537] [2025-04-13 22:59:56,696 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 22:59:56,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:56,702 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 22:59:56,706 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 22:59:56,706 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 22:59:56,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:57,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 22:59:57,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:57,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866862537] [2025-04-13 22:59:57,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866862537] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 22:59:57,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 22:59:57,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 22:59:57,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425821005] [2025-04-13 22:59:57,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 22:59:57,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 22:59:57,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:57,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 22:59:57,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 22:59:57,028 INFO L87 Difference]: Start difference. First operand 286 states and 934 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:57,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:57,203 INFO L93 Difference]: Finished difference Result 340 states and 1076 transitions. [2025-04-13 22:59:57,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 22:59:57,203 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:57,203 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:57,205 INFO L225 Difference]: With dead ends: 340 [2025-04-13 22:59:57,205 INFO L226 Difference]: Without dead ends: 334 [2025-04-13 22:59:57,205 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 22:59:57,205 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 34 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:57,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 0 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 22:59:57,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-04-13 22:59:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 284. [2025-04-13 22:59:57,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 283 states have (on average 3.275618374558304) internal successors, (927), 283 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 927 transitions. [2025-04-13 22:59:57,213 INFO L79 Accepts]: Start accepts. Automaton has 284 states and 927 transitions. Word has length 20 [2025-04-13 22:59:57,213 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:57,213 INFO L485 AbstractCegarLoop]: Abstraction has 284 states and 927 transitions. [2025-04-13 22:59:57,213 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:57,213 INFO L278 IsEmpty]: Start isEmpty. Operand 284 states and 927 transitions. [2025-04-13 22:59:57,214 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:57,214 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:57,214 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:57,214 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-13 22:59:57,214 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 22:59:57,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 22:59:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2067687948, now seen corresponding path program 7 times [2025-04-13 22:59:57,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 22:59:57,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145657163] [2025-04-13 22:59:57,215 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:57,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 22:59:57,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:57,227 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:57,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:57,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:57,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 22:59:57,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145657163] [2025-04-13 22:59:57,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145657163] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 22:59:57,554 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1782821162] [2025-04-13 22:59:57,554 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 22:59:57,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 22:59:57,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 22:59:57,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 22:59:57,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-13 22:59:57,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 22:59:57,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 22:59:57,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 22:59:57,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 22:59:57,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 22:59:57,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 22:59:57,627 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 22:59:57,751 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 22:59:57,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:57,791 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 22:59:58,257 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 22:59:58,259 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 22:59:58,298 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 22:59:58,306 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 22:59:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 22:59:58,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1782821162] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 22:59:58,317 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 22:59:58,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 22:59:58,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876001607] [2025-04-13 22:59:58,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 22:59:58,318 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 22:59:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 22:59:58,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 22:59:58,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=485, Unknown=0, NotChecked=0, Total=600 [2025-04-13 22:59:58,318 INFO L87 Difference]: Start difference. First operand 284 states and 927 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:59,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 22:59:59,868 INFO L93 Difference]: Finished difference Result 646 states and 2095 transitions. [2025-04-13 22:59:59,869 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 22:59:59,869 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 22:59:59,869 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 22:59:59,872 INFO L225 Difference]: With dead ends: 646 [2025-04-13 22:59:59,872 INFO L226 Difference]: Without dead ends: 640 [2025-04-13 22:59:59,873 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=490, Invalid=2060, Unknown=0, NotChecked=0, Total=2550 [2025-04-13 22:59:59,873 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 211 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-13 22:59:59,873 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 0 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-13 22:59:59,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2025-04-13 22:59:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 289. [2025-04-13 22:59:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 288 states have (on average 3.295138888888889) internal successors, (949), 288 states have internal predecessors, (949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 949 transitions. [2025-04-13 22:59:59,885 INFO L79 Accepts]: Start accepts. Automaton has 289 states and 949 transitions. Word has length 20 [2025-04-13 22:59:59,885 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 22:59:59,885 INFO L485 AbstractCegarLoop]: Abstraction has 289 states and 949 transitions. [2025-04-13 22:59:59,885 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 22:59:59,885 INFO L278 IsEmpty]: Start isEmpty. Operand 289 states and 949 transitions. [2025-04-13 22:59:59,886 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 22:59:59,886 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 22:59:59,886 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 22:59:59,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-13 23:00:00,086 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:00,087 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:00,087 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:00,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1690586476, now seen corresponding path program 8 times [2025-04-13 23:00:00,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:00,087 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792341858] [2025-04-13 23:00:00,087 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:00,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:00,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:00,098 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:00,098 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:00:00,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:00,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:00,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:00,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792341858] [2025-04-13 23:00:00,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792341858] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:00,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:00,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:00,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562045897] [2025-04-13 23:00:00,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:00,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:00,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:00,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:00,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:00,319 INFO L87 Difference]: Start difference. First operand 289 states and 949 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:00,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:00,548 INFO L93 Difference]: Finished difference Result 373 states and 1154 transitions. [2025-04-13 23:00:00,548 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:00:00,548 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:00,548 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:00,550 INFO L225 Difference]: With dead ends: 373 [2025-04-13 23:00:00,550 INFO L226 Difference]: Without dead ends: 367 [2025-04-13 23:00:00,550 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:00:00,551 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:00,551 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:00,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2025-04-13 23:00:00,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 281. [2025-04-13 23:00:00,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 280 states have (on average 3.3107142857142855) internal successors, (927), 280 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 927 transitions. [2025-04-13 23:00:00,558 INFO L79 Accepts]: Start accepts. Automaton has 281 states and 927 transitions. Word has length 20 [2025-04-13 23:00:00,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:00,558 INFO L485 AbstractCegarLoop]: Abstraction has 281 states and 927 transitions. [2025-04-13 23:00:00,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:00,558 INFO L278 IsEmpty]: Start isEmpty. Operand 281 states and 927 transitions. [2025-04-13 23:00:00,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:00,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:00,559 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:00,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-13 23:00:00,559 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:00,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:00,560 INFO L85 PathProgramCache]: Analyzing trace with hash 127306350, now seen corresponding path program 9 times [2025-04-13 23:00:00,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:00,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483069112] [2025-04-13 23:00:00,560 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:00,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:00,564 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:00,567 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:00,567 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:00:00,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:00,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:00,824 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483069112] [2025-04-13 23:00:00,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483069112] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:00,824 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:00,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:00,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239505514] [2025-04-13 23:00:00,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:00,825 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:00,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:00,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:00,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:00,825 INFO L87 Difference]: Start difference. First operand 281 states and 927 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:01,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:01,128 INFO L93 Difference]: Finished difference Result 371 states and 1189 transitions. [2025-04-13 23:00:01,129 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:00:01,129 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:01,129 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:01,131 INFO L225 Difference]: With dead ends: 371 [2025-04-13 23:00:01,131 INFO L226 Difference]: Without dead ends: 365 [2025-04-13 23:00:01,131 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:01,132 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:01,132 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:01,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-04-13 23:00:01,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 287. [2025-04-13 23:00:01,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 287 states, 286 states have (on average 3.335664335664336) internal successors, (954), 286 states have internal predecessors, (954), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:01,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 954 transitions. [2025-04-13 23:00:01,138 INFO L79 Accepts]: Start accepts. Automaton has 287 states and 954 transitions. Word has length 20 [2025-04-13 23:00:01,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:01,139 INFO L485 AbstractCegarLoop]: Abstraction has 287 states and 954 transitions. [2025-04-13 23:00:01,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:01,139 INFO L278 IsEmpty]: Start isEmpty. Operand 287 states and 954 transitions. [2025-04-13 23:00:01,140 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:01,140 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:01,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:01,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-13 23:00:01,140 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:01,141 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:01,141 INFO L85 PathProgramCache]: Analyzing trace with hash 83720124, now seen corresponding path program 10 times [2025-04-13 23:00:01,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:01,141 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139161397] [2025-04-13 23:00:01,141 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:01,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:01,148 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:01,152 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:01,153 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:01,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:01,329 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:01,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:01,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139161397] [2025-04-13 23:00:01,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139161397] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:01,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:01,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:00:01,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881505654] [2025-04-13 23:00:01,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:01,330 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:00:01,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:01,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:00:01,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:00:01,330 INFO L87 Difference]: Start difference. First operand 287 states and 954 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:01,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:01,497 INFO L93 Difference]: Finished difference Result 337 states and 1083 transitions. [2025-04-13 23:00:01,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:00:01,498 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:01,498 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:01,500 INFO L225 Difference]: With dead ends: 337 [2025-04-13 23:00:01,500 INFO L226 Difference]: Without dead ends: 331 [2025-04-13 23:00:01,500 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:01,500 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 21 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:01,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 0 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:01,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2025-04-13 23:00:01,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 293. [2025-04-13 23:00:01,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 292 states have (on average 3.3184931506849313) internal successors, (969), 292 states have internal predecessors, (969), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:01,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 969 transitions. [2025-04-13 23:00:01,508 INFO L79 Accepts]: Start accepts. Automaton has 293 states and 969 transitions. Word has length 20 [2025-04-13 23:00:01,508 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:01,508 INFO L485 AbstractCegarLoop]: Abstraction has 293 states and 969 transitions. [2025-04-13 23:00:01,508 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:01,508 INFO L278 IsEmpty]: Start isEmpty. Operand 293 states and 969 transitions. [2025-04-13 23:00:01,508 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:01,509 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:01,509 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:01,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-13 23:00:01,509 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:01,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:01,509 INFO L85 PathProgramCache]: Analyzing trace with hash -966785238, now seen corresponding path program 11 times [2025-04-13 23:00:01,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:01,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353331900] [2025-04-13 23:00:01,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:01,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:01,513 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:01,517 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:01,517 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:01,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:01,809 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:01,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:01,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353331900] [2025-04-13 23:00:01,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353331900] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:01,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908950739] [2025-04-13 23:00:01,810 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:01,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:01,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:01,812 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:01,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-13 23:00:01,849 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:01,863 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:01,863 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:01,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:01,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:00:01,865 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:01,882 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:00:02,074 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 23:00:02,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:02,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:02,493 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 23:00:02,495 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 23:00:02,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 23:00:02,504 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 23:00:02,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:02,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908950739] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:02,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:02,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 23:00:02,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167397492] [2025-04-13 23:00:02,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:02,535 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:00:02,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:02,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:00:02,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:00:02,536 INFO L87 Difference]: Start difference. First operand 293 states and 969 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:04,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:04,457 INFO L93 Difference]: Finished difference Result 903 states and 2795 transitions. [2025-04-13 23:00:04,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:00:04,457 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:04,457 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:04,460 INFO L225 Difference]: With dead ends: 903 [2025-04-13 23:00:04,461 INFO L226 Difference]: Without dead ends: 807 [2025-04-13 23:00:04,462 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1342 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=977, Invalid=3853, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 23:00:04,462 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 405 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1600 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 1600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:04,462 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 0 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 1600 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-04-13 23:00:04,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2025-04-13 23:00:04,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 345. [2025-04-13 23:00:04,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 344 states have (on average 3.2936046511627906) internal successors, (1133), 344 states have internal predecessors, (1133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:04,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 1133 transitions. [2025-04-13 23:00:04,473 INFO L79 Accepts]: Start accepts. Automaton has 345 states and 1133 transitions. Word has length 20 [2025-04-13 23:00:04,473 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:04,473 INFO L485 AbstractCegarLoop]: Abstraction has 345 states and 1133 transitions. [2025-04-13 23:00:04,473 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:04,473 INFO L278 IsEmpty]: Start isEmpty. Operand 345 states and 1133 transitions. [2025-04-13 23:00:04,474 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:04,474 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:04,474 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:04,480 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:04,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:04,679 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:04,679 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:04,679 INFO L85 PathProgramCache]: Analyzing trace with hash 994328856, now seen corresponding path program 12 times [2025-04-13 23:00:04,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:04,679 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779577391] [2025-04-13 23:00:04,679 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:04,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:04,683 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:04,689 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:04,689 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:00:04,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:04,913 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:04,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:04,913 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779577391] [2025-04-13 23:00:04,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779577391] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:04,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:04,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:04,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078563480] [2025-04-13 23:00:04,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:04,914 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:04,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:04,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:04,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:04,914 INFO L87 Difference]: Start difference. First operand 345 states and 1133 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:05,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:05,121 INFO L93 Difference]: Finished difference Result 389 states and 1247 transitions. [2025-04-13 23:00:05,122 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:00:05,122 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:05,122 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:05,124 INFO L225 Difference]: With dead ends: 389 [2025-04-13 23:00:05,124 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 23:00:05,124 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:05,125 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:05,125 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:05,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 23:00:05,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 349. [2025-04-13 23:00:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 3.2902298850574714) internal successors, (1145), 348 states have internal predecessors, (1145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:05,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1145 transitions. [2025-04-13 23:00:05,134 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1145 transitions. Word has length 20 [2025-04-13 23:00:05,134 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:05,134 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1145 transitions. [2025-04-13 23:00:05,134 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:05,134 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1145 transitions. [2025-04-13 23:00:05,134 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:05,135 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:05,135 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:05,135 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-13 23:00:05,135 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:05,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:05,135 INFO L85 PathProgramCache]: Analyzing trace with hash -722230912, now seen corresponding path program 13 times [2025-04-13 23:00:05,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:05,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143415454] [2025-04-13 23:00:05,135 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:05,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:05,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:00:05,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:05,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:05,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:05,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:05,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:05,397 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143415454] [2025-04-13 23:00:05,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143415454] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:05,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:05,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:05,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123240215] [2025-04-13 23:00:05,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:05,398 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:05,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:05,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:05,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:05,398 INFO L87 Difference]: Start difference. First operand 349 states and 1145 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:05,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:05,599 INFO L93 Difference]: Finished difference Result 389 states and 1259 transitions. [2025-04-13 23:00:05,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:00:05,599 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:05,600 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:05,601 INFO L225 Difference]: With dead ends: 389 [2025-04-13 23:00:05,601 INFO L226 Difference]: Without dead ends: 383 [2025-04-13 23:00:05,602 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:05,602 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 29 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:05,602 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 0 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-04-13 23:00:05,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 351. [2025-04-13 23:00:05,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 3.297142857142857) internal successors, (1154), 350 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:05,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1154 transitions. [2025-04-13 23:00:05,610 INFO L79 Accepts]: Start accepts. Automaton has 351 states and 1154 transitions. Word has length 20 [2025-04-13 23:00:05,610 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:05,610 INFO L485 AbstractCegarLoop]: Abstraction has 351 states and 1154 transitions. [2025-04-13 23:00:05,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:05,611 INFO L278 IsEmpty]: Start isEmpty. Operand 351 states and 1154 transitions. [2025-04-13 23:00:05,611 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:05,611 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:05,611 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:05,611 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-13 23:00:05,612 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:05,612 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:05,612 INFO L85 PathProgramCache]: Analyzing trace with hash -991013002, now seen corresponding path program 14 times [2025-04-13 23:00:05,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:05,612 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643948897] [2025-04-13 23:00:05,612 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:05,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:05,616 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:05,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:05,620 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:00:05,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:05,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:05,853 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643948897] [2025-04-13 23:00:05,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643948897] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:05,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:05,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:05,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476696641] [2025-04-13 23:00:05,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:05,854 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:05,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:05,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:05,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:05,854 INFO L87 Difference]: Start difference. First operand 351 states and 1154 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:06,169 INFO L93 Difference]: Finished difference Result 417 states and 1354 transitions. [2025-04-13 23:00:06,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:00:06,169 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:06,169 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:06,171 INFO L225 Difference]: With dead ends: 417 [2025-04-13 23:00:06,171 INFO L226 Difference]: Without dead ends: 411 [2025-04-13 23:00:06,171 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:00:06,172 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 26 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:06,172 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 0 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:00:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-04-13 23:00:06,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 351. [2025-04-13 23:00:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 3.297142857142857) internal successors, (1154), 350 states have internal predecessors, (1154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1154 transitions. [2025-04-13 23:00:06,180 INFO L79 Accepts]: Start accepts. Automaton has 351 states and 1154 transitions. Word has length 20 [2025-04-13 23:00:06,180 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:06,180 INFO L485 AbstractCegarLoop]: Abstraction has 351 states and 1154 transitions. [2025-04-13 23:00:06,180 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,180 INFO L278 IsEmpty]: Start isEmpty. Operand 351 states and 1154 transitions. [2025-04-13 23:00:06,181 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:06,181 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:06,181 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:06,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-13 23:00:06,181 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:06,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:06,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1337508386, now seen corresponding path program 15 times [2025-04-13 23:00:06,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:06,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449102799] [2025-04-13 23:00:06,182 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:06,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:06,186 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:06,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:06,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:00:06,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:06,371 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:06,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:06,372 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449102799] [2025-04-13 23:00:06,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449102799] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:06,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:06,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 23:00:06,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014317948] [2025-04-13 23:00:06,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:06,372 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:00:06,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:06,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:00:06,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:00:06,373 INFO L87 Difference]: Start difference. First operand 351 states and 1154 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:06,534 INFO L93 Difference]: Finished difference Result 405 states and 1298 transitions. [2025-04-13 23:00:06,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:00:06,534 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:06,534 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:06,536 INFO L225 Difference]: With dead ends: 405 [2025-04-13 23:00:06,536 INFO L226 Difference]: Without dead ends: 399 [2025-04-13 23:00:06,536 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:00:06,537 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 33 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:06,537 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 0 Invalid, 304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:06,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-04-13 23:00:06,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 347. [2025-04-13 23:00:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 346 states have (on average 3.2890173410404624) internal successors, (1138), 346 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 1138 transitions. [2025-04-13 23:00:06,544 INFO L79 Accepts]: Start accepts. Automaton has 347 states and 1138 transitions. Word has length 20 [2025-04-13 23:00:06,544 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:06,544 INFO L485 AbstractCegarLoop]: Abstraction has 347 states and 1138 transitions. [2025-04-13 23:00:06,545 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,545 INFO L278 IsEmpty]: Start isEmpty. Operand 347 states and 1138 transitions. [2025-04-13 23:00:06,545 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:06,545 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:06,545 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:06,545 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-13 23:00:06,546 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:06,546 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:06,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1031858244, now seen corresponding path program 16 times [2025-04-13 23:00:06,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:06,546 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292665613] [2025-04-13 23:00:06,546 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:06,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:06,551 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:06,556 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:06,556 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:06,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:06,761 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:06,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:06,761 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292665613] [2025-04-13 23:00:06,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292665613] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:06,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:06,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 23:00:06,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057920660] [2025-04-13 23:00:06,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:06,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:00:06,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:06,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:00:06,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:00:06,762 INFO L87 Difference]: Start difference. First operand 347 states and 1138 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:06,878 INFO L93 Difference]: Finished difference Result 391 states and 1263 transitions. [2025-04-13 23:00:06,878 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-13 23:00:06,879 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:06,879 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:06,880 INFO L225 Difference]: With dead ends: 391 [2025-04-13 23:00:06,880 INFO L226 Difference]: Without dead ends: 385 [2025-04-13 23:00:06,881 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:00:06,881 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:06,881 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-04-13 23:00:06,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 351. [2025-04-13 23:00:06,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 350 states have (on average 3.2857142857142856) internal successors, (1150), 350 states have internal predecessors, (1150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 1150 transitions. [2025-04-13 23:00:06,887 INFO L79 Accepts]: Start accepts. Automaton has 351 states and 1150 transitions. Word has length 20 [2025-04-13 23:00:06,887 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:06,888 INFO L485 AbstractCegarLoop]: Abstraction has 351 states and 1150 transitions. [2025-04-13 23:00:06,888 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:06,888 INFO L278 IsEmpty]: Start isEmpty. Operand 351 states and 1150 transitions. [2025-04-13 23:00:06,888 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:06,888 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:06,888 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:06,888 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-13 23:00:06,889 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:06,889 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:06,889 INFO L85 PathProgramCache]: Analyzing trace with hash 731997248, now seen corresponding path program 17 times [2025-04-13 23:00:06,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:06,889 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973893829] [2025-04-13 23:00:06,889 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:06,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:06,896 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:06,899 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:06,899 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:06,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:07,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:07,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:07,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973893829] [2025-04-13 23:00:07,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973893829] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:07,182 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373760827] [2025-04-13 23:00:07,182 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:07,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:07,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:07,184 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:07,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-13 23:00:07,221 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:07,234 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:07,234 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:07,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:07,235 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:00:07,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:07,250 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:00:07,368 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 23:00:07,389 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:07,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:07,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 23:00:07,781 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 23:00:07,798 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 23:00:07,800 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 23:00:07,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:07,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373760827] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:07,804 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:07,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 23:00:07,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950965370] [2025-04-13 23:00:07,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:07,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:00:07,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:07,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:00:07,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:00:07,805 INFO L87 Difference]: Start difference. First operand 351 states and 1150 transitions. Second operand has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:08,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:08,811 INFO L93 Difference]: Finished difference Result 776 states and 2544 transitions. [2025-04-13 23:00:08,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 23:00:08,811 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:08,811 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:08,814 INFO L225 Difference]: With dead ends: 776 [2025-04-13 23:00:08,814 INFO L226 Difference]: Without dead ends: 601 [2025-04-13 23:00:08,815 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=338, Invalid=1468, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:00:08,816 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 156 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1025 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:08,816 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 0 Invalid, 1058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1025 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:00:08,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-04-13 23:00:08,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 323. [2025-04-13 23:00:08,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 322 states have (on average 3.2763975155279503) internal successors, (1055), 322 states have internal predecessors, (1055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:08,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 1055 transitions. [2025-04-13 23:00:08,824 INFO L79 Accepts]: Start accepts. Automaton has 323 states and 1055 transitions. Word has length 20 [2025-04-13 23:00:08,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:08,824 INFO L485 AbstractCegarLoop]: Abstraction has 323 states and 1055 transitions. [2025-04-13 23:00:08,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.4166666666666665) internal successors, (58), 24 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:08,824 INFO L278 IsEmpty]: Start isEmpty. Operand 323 states and 1055 transitions. [2025-04-13 23:00:08,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:08,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:08,825 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:08,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:09,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:09,026 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:09,026 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:09,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1837299106, now seen corresponding path program 18 times [2025-04-13 23:00:09,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:09,026 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482190169] [2025-04-13 23:00:09,026 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:09,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:09,030 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:09,033 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:09,033 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:00:09,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:09,247 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482190169] [2025-04-13 23:00:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482190169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:09,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:09,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:09,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193344369] [2025-04-13 23:00:09,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:09,247 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:09,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:09,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:09,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:09,248 INFO L87 Difference]: Start difference. First operand 323 states and 1055 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:09,483 INFO L93 Difference]: Finished difference Result 369 states and 1174 transitions. [2025-04-13 23:00:09,484 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:00:09,484 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:09,484 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:09,486 INFO L225 Difference]: With dead ends: 369 [2025-04-13 23:00:09,486 INFO L226 Difference]: Without dead ends: 363 [2025-04-13 23:00:09,486 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:00:09,487 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:09,487 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:09,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-04-13 23:00:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 329. [2025-04-13 23:00:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 3.2804878048780486) internal successors, (1076), 328 states have internal predecessors, (1076), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:09,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1076 transitions. [2025-04-13 23:00:09,493 INFO L79 Accepts]: Start accepts. Automaton has 329 states and 1076 transitions. Word has length 20 [2025-04-13 23:00:09,493 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:09,493 INFO L485 AbstractCegarLoop]: Abstraction has 329 states and 1076 transitions. [2025-04-13 23:00:09,493 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:09,493 INFO L278 IsEmpty]: Start isEmpty. Operand 329 states and 1076 transitions. [2025-04-13 23:00:09,495 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:09,495 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:09,495 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:09,495 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-13 23:00:09,495 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:09,496 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash -926690374, now seen corresponding path program 19 times [2025-04-13 23:00:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:09,496 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332343367] [2025-04-13 23:00:09,496 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:09,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:00:09,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:09,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:09,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:09,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:09,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:09,750 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332343367] [2025-04-13 23:00:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332343367] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:09,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:09,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:09,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283877017] [2025-04-13 23:00:09,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:09,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:09,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:09,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:09,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:09,751 INFO L87 Difference]: Start difference. First operand 329 states and 1076 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:09,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:09,941 INFO L93 Difference]: Finished difference Result 367 states and 1171 transitions. [2025-04-13 23:00:09,941 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:00:09,941 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:09,941 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:09,943 INFO L225 Difference]: With dead ends: 367 [2025-04-13 23:00:09,943 INFO L226 Difference]: Without dead ends: 361 [2025-04-13 23:00:09,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:00:09,944 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:09,945 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:09,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-13 23:00:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 335. [2025-04-13 23:00:09,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.284431137724551) internal successors, (1097), 334 states have internal predecessors, (1097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1097 transitions. [2025-04-13 23:00:09,951 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 1097 transitions. Word has length 20 [2025-04-13 23:00:09,951 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:09,951 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 1097 transitions. [2025-04-13 23:00:09,951 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:09,952 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 1097 transitions. [2025-04-13 23:00:09,952 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:09,952 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:09,952 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:09,952 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-13 23:00:09,952 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:09,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:09,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1651717154, now seen corresponding path program 20 times [2025-04-13 23:00:09,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:09,953 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546823098] [2025-04-13 23:00:09,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:09,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:09,956 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:09,960 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:09,960 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:00:09,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:10,174 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:10,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:10,175 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546823098] [2025-04-13 23:00:10,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546823098] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:10,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:10,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:10,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276826981] [2025-04-13 23:00:10,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:10,175 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:10,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:10,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:10,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:10,176 INFO L87 Difference]: Start difference. First operand 335 states and 1097 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:10,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:10,413 INFO L93 Difference]: Finished difference Result 367 states and 1183 transitions. [2025-04-13 23:00:10,413 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:00:10,413 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:10,413 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:10,415 INFO L225 Difference]: With dead ends: 367 [2025-04-13 23:00:10,415 INFO L226 Difference]: Without dead ends: 361 [2025-04-13 23:00:10,415 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:00:10,415 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:10,416 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:10,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-04-13 23:00:10,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 337. [2025-04-13 23:00:10,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 336 states have (on average 3.2916666666666665) internal successors, (1106), 336 states have internal predecessors, (1106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 1106 transitions. [2025-04-13 23:00:10,421 INFO L79 Accepts]: Start accepts. Automaton has 337 states and 1106 transitions. Word has length 20 [2025-04-13 23:00:10,421 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:10,421 INFO L485 AbstractCegarLoop]: Abstraction has 337 states and 1106 transitions. [2025-04-13 23:00:10,422 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:10,422 INFO L278 IsEmpty]: Start isEmpty. Operand 337 states and 1106 transitions. [2025-04-13 23:00:10,422 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:10,422 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:10,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:10,422 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-13 23:00:10,423 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:10,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:10,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1382935064, now seen corresponding path program 21 times [2025-04-13 23:00:10,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:10,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818877011] [2025-04-13 23:00:10,423 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:10,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:10,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:10,429 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:10,429 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:00:10,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:10,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:10,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:10,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818877011] [2025-04-13 23:00:10,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818877011] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:10,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:10,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-13 23:00:10,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8219079] [2025-04-13 23:00:10,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:10,601 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-13 23:00:10,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:10,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-13 23:00:10,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-13 23:00:10,602 INFO L87 Difference]: Start difference. First operand 337 states and 1106 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:10,787 INFO L93 Difference]: Finished difference Result 383 states and 1222 transitions. [2025-04-13 23:00:10,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:00:10,788 INFO L79 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:10,788 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:10,789 INFO L225 Difference]: With dead ends: 383 [2025-04-13 23:00:10,789 INFO L226 Difference]: Without dead ends: 377 [2025-04-13 23:00:10,790 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:10,790 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 27 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:10,790 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 0 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:10,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-13 23:00:10,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 325. [2025-04-13 23:00:10,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 324 states have (on average 3.2962962962962963) internal successors, (1068), 324 states have internal predecessors, (1068), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:10,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 1068 transitions. [2025-04-13 23:00:10,796 INFO L79 Accepts]: Start accepts. Automaton has 325 states and 1068 transitions. Word has length 20 [2025-04-13 23:00:10,796 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:10,796 INFO L485 AbstractCegarLoop]: Abstraction has 325 states and 1068 transitions. [2025-04-13 23:00:10,796 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:10,796 INFO L278 IsEmpty]: Start isEmpty. Operand 325 states and 1068 transitions. [2025-04-13 23:00:10,797 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:10,797 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:10,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:10,797 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-13 23:00:10,797 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:10,797 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:10,797 INFO L85 PathProgramCache]: Analyzing trace with hash -499438852, now seen corresponding path program 22 times [2025-04-13 23:00:10,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:10,797 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79486235] [2025-04-13 23:00:10,797 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:10,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:10,803 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:10,808 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:10,809 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:10,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:10,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:10,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:10,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79486235] [2025-04-13 23:00:10,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79486235] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:10,966 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:10,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-13 23:00:10,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511431311] [2025-04-13 23:00:10,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:10,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-13 23:00:10,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:10,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-13 23:00:10,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:00:10,966 INFO L87 Difference]: Start difference. First operand 325 states and 1068 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:11,130 INFO L93 Difference]: Finished difference Result 369 states and 1194 transitions. [2025-04-13 23:00:11,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:00:11,130 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:11,131 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:11,132 INFO L225 Difference]: With dead ends: 369 [2025-04-13 23:00:11,132 INFO L226 Difference]: Without dead ends: 363 [2025-04-13 23:00:11,133 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:11,133 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 28 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:11,133 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 0 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:11,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-04-13 23:00:11,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 329. [2025-04-13 23:00:11,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 328 states have (on average 3.3109756097560976) internal successors, (1086), 328 states have internal predecessors, (1086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:11,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 1086 transitions. [2025-04-13 23:00:11,139 INFO L79 Accepts]: Start accepts. Automaton has 329 states and 1086 transitions. Word has length 20 [2025-04-13 23:00:11,139 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:11,139 INFO L485 AbstractCegarLoop]: Abstraction has 329 states and 1086 transitions. [2025-04-13 23:00:11,139 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:11,139 INFO L278 IsEmpty]: Start isEmpty. Operand 329 states and 1086 transitions. [2025-04-13 23:00:11,139 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:11,139 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:11,140 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:11,140 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-13 23:00:11,140 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:11,140 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash 411169880, now seen corresponding path program 23 times [2025-04-13 23:00:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:11,140 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671311534] [2025-04-13 23:00:11,140 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:11,143 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:11,147 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:11,147 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:11,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:11,384 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:11,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:11,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671311534] [2025-04-13 23:00:11,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671311534] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:11,385 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [517166188] [2025-04-13 23:00:11,385 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:11,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:11,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:11,386 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:11,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-13 23:00:11,423 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:11,436 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:11,436 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:11,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:11,437 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:00:11,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:11,456 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:00:11,604 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 23:00:11,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:11,633 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:11,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 23:00:11,973 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 23:00:11,980 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 23:00:11,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 23:00:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [517166188] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:12,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:12,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 22 [2025-04-13 23:00:12,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905458477] [2025-04-13 23:00:12,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:12,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-13 23:00:12,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:12,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-13 23:00:12,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=456, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:00:12,015 INFO L87 Difference]: Start difference. First operand 329 states and 1086 transitions. Second operand has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:12,998 INFO L93 Difference]: Finished difference Result 624 states and 2043 transitions. [2025-04-13 23:00:12,999 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 23:00:12,999 INFO L79 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:12,999 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:13,001 INFO L225 Difference]: With dead ends: 624 [2025-04-13 23:00:13,001 INFO L226 Difference]: Without dead ends: 618 [2025-04-13 23:00:13,002 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=306, Invalid=1416, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:00:13,002 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:13,002 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 1007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 988 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:00:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2025-04-13 23:00:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 333. [2025-04-13 23:00:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.325301204819277) internal successors, (1104), 332 states have internal predecessors, (1104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:13,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1104 transitions. [2025-04-13 23:00:13,009 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 1104 transitions. Word has length 20 [2025-04-13 23:00:13,009 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:13,009 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 1104 transitions. [2025-04-13 23:00:13,009 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.391304347826087) internal successors, (55), 23 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:13,009 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 1104 transitions. [2025-04-13 23:00:13,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:13,010 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:13,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:13,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:13,212 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-04-13 23:00:13,212 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:13,212 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:13,213 INFO L85 PathProgramCache]: Analyzing trace with hash -1913500124, now seen corresponding path program 24 times [2025-04-13 23:00:13,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:13,213 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938759920] [2025-04-13 23:00:13,213 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:13,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:13,216 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 20 statements into 2 equivalence classes. [2025-04-13 23:00:13,220 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 19 of 20 statements. [2025-04-13 23:00:13,220 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:00:13,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:13,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:13,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:13,441 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938759920] [2025-04-13 23:00:13,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938759920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:13,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:13,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:13,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773130563] [2025-04-13 23:00:13,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:13,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:13,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:13,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:13,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:13,442 INFO L87 Difference]: Start difference. First operand 333 states and 1104 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:13,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:13,648 INFO L93 Difference]: Finished difference Result 397 states and 1285 transitions. [2025-04-13 23:00:13,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:00:13,648 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:13,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:13,650 INFO L225 Difference]: With dead ends: 397 [2025-04-13 23:00:13,650 INFO L226 Difference]: Without dead ends: 391 [2025-04-13 23:00:13,650 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-13 23:00:13,651 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:13,651 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-04-13 23:00:13,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 335. [2025-04-13 23:00:13,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.338323353293413) internal successors, (1115), 334 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:13,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1115 transitions. [2025-04-13 23:00:13,656 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 1115 transitions. Word has length 20 [2025-04-13 23:00:13,656 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:13,656 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 1115 transitions. [2025-04-13 23:00:13,656 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:13,656 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 1115 transitions. [2025-04-13 23:00:13,657 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-04-13 23:00:13,657 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:13,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:13,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-13 23:00:13,657 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:13,657 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:13,657 INFO L85 PathProgramCache]: Analyzing trace with hash 633985812, now seen corresponding path program 25 times [2025-04-13 23:00:13,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:13,657 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247618126] [2025-04-13 23:00:13,657 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:13,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:13,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:00:13,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:13,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:13,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:13,885 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:13,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:13,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247618126] [2025-04-13 23:00:13,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247618126] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:13,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265739336] [2025-04-13 23:00:13,885 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:13,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:13,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:13,887 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:13,888 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-13 23:00:13,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-04-13 23:00:13,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-04-13 23:00:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:13,935 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:00:13,936 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:13,950 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-13 23:00:14,075 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 35 [2025-04-13 23:00:14,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:14,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:14,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-04-13 23:00:14,491 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 50 [2025-04-13 23:00:14,498 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2025-04-13 23:00:14,500 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 71 [2025-04-13 23:00:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:14,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [265739336] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:14,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:14,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2025-04-13 23:00:14,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812377752] [2025-04-13 23:00:14,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:14,536 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-13 23:00:14,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:14,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-13 23:00:14,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=495, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:00:14,537 INFO L87 Difference]: Start difference. First operand 335 states and 1115 transitions. Second operand has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:16,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:16,045 INFO L93 Difference]: Finished difference Result 812 states and 2705 transitions. [2025-04-13 23:00:16,046 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:00:16,046 INFO L79 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-04-13 23:00:16,046 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:16,049 INFO L225 Difference]: With dead ends: 812 [2025-04-13 23:00:16,049 INFO L226 Difference]: Without dead ends: 806 [2025-04-13 23:00:16,050 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 711 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=562, Invalid=2630, Unknown=0, NotChecked=0, Total=3192 [2025-04-13 23:00:16,050 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1218 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 1218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:16,050 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 1218 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:00:16,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2025-04-13 23:00:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 335. [2025-04-13 23:00:16,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 334 states have (on average 3.338323353293413) internal successors, (1115), 334 states have internal predecessors, (1115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:16,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 1115 transitions. [2025-04-13 23:00:16,061 INFO L79 Accepts]: Start accepts. Automaton has 335 states and 1115 transitions. Word has length 20 [2025-04-13 23:00:16,061 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:16,061 INFO L485 AbstractCegarLoop]: Abstraction has 335 states and 1115 transitions. [2025-04-13 23:00:16,062 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 2.3333333333333335) internal successors, (56), 24 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:16,062 INFO L278 IsEmpty]: Start isEmpty. Operand 335 states and 1115 transitions. [2025-04-13 23:00:16,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:00:16,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:16,062 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:16,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-13 23:00:16,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:16,263 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:16,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:16,263 INFO L85 PathProgramCache]: Analyzing trace with hash -114586588, now seen corresponding path program 26 times [2025-04-13 23:00:16,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:16,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650481768] [2025-04-13 23:00:16,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:16,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:16,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:16,269 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:00:16,269 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:00:16,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:16,457 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:16,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:16,457 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650481768] [2025-04-13 23:00:16,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650481768] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:16,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:16,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:16,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331011540] [2025-04-13 23:00:16,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:16,458 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:16,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:16,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:16,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:16,458 INFO L87 Difference]: Start difference. First operand 335 states and 1115 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:16,611 INFO L93 Difference]: Finished difference Result 371 states and 1213 transitions. [2025-04-13 23:00:16,612 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:00:16,612 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:00:16,612 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:16,613 INFO L225 Difference]: With dead ends: 371 [2025-04-13 23:00:16,613 INFO L226 Difference]: Without dead ends: 365 [2025-04-13 23:00:16,614 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:16,614 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 24 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:16,614 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 0 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:16,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2025-04-13 23:00:16,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 341. [2025-04-13 23:00:16,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 340 states have (on average 3.3411764705882354) internal successors, (1136), 340 states have internal predecessors, (1136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:16,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 1136 transitions. [2025-04-13 23:00:16,619 INFO L79 Accepts]: Start accepts. Automaton has 341 states and 1136 transitions. Word has length 21 [2025-04-13 23:00:16,619 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:16,619 INFO L485 AbstractCegarLoop]: Abstraction has 341 states and 1136 transitions. [2025-04-13 23:00:16,619 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:16,619 INFO L278 IsEmpty]: Start isEmpty. Operand 341 states and 1136 transitions. [2025-04-13 23:00:16,620 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:00:16,620 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:16,620 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:16,620 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-13 23:00:16,620 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:16,620 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:16,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1284110836, now seen corresponding path program 27 times [2025-04-13 23:00:16,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:16,620 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334915516] [2025-04-13 23:00:16,620 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:16,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:16,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:16,626 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 19 of 21 statements. [2025-04-13 23:00:16,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:00:16,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:16,842 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:16,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:16,842 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334915516] [2025-04-13 23:00:16,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334915516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:16,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:16,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-13 23:00:16,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712931208] [2025-04-13 23:00:16,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:16,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:00:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:16,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:00:16,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:16,843 INFO L87 Difference]: Start difference. First operand 341 states and 1136 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:17,081 INFO L93 Difference]: Finished difference Result 467 states and 1515 transitions. [2025-04-13 23:00:17,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:00:17,082 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:00:17,082 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:17,084 INFO L225 Difference]: With dead ends: 467 [2025-04-13 23:00:17,084 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 23:00:17,084 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:00:17,084 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 58 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:17,085 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 0 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:17,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 23:00:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 346. [2025-04-13 23:00:17,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 345 states have (on average 3.356521739130435) internal successors, (1158), 345 states have internal predecessors, (1158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 1158 transitions. [2025-04-13 23:00:17,091 INFO L79 Accepts]: Start accepts. Automaton has 346 states and 1158 transitions. Word has length 21 [2025-04-13 23:00:17,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:17,091 INFO L485 AbstractCegarLoop]: Abstraction has 346 states and 1158 transitions. [2025-04-13 23:00:17,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,091 INFO L278 IsEmpty]: Start isEmpty. Operand 346 states and 1158 transitions. [2025-04-13 23:00:17,092 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 23:00:17,092 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:17,092 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:17,092 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-13 23:00:17,092 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:17,093 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:17,093 INFO L85 PathProgramCache]: Analyzing trace with hash -383368678, now seen corresponding path program 28 times [2025-04-13 23:00:17,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:17,093 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396560469] [2025-04-13 23:00:17,093 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:17,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:17,096 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:17,099 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:17,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:17,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:17,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:17,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:17,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396560469] [2025-04-13 23:00:17,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396560469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:17,121 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455387545] [2025-04-13 23:00:17,121 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:17,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:17,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:17,123 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:17,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-13 23:00:17,158 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:00:17,170 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:00:17,170 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:17,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:17,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-13 23:00:17,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:17,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:17,230 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:17,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455387545] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:17,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:17,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-04-13 23:00:17,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124559935] [2025-04-13 23:00:17,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:17,231 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:00:17,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:17,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:00:17,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:00:17,231 INFO L87 Difference]: Start difference. First operand 346 states and 1158 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:17,289 INFO L93 Difference]: Finished difference Result 687 states and 2299 transitions. [2025-04-13 23:00:17,292 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:00:17,293 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-04-13 23:00:17,293 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:17,295 INFO L225 Difference]: With dead ends: 687 [2025-04-13 23:00:17,295 INFO L226 Difference]: Without dead ends: 606 [2025-04-13 23:00:17,296 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:00:17,296 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 70 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:17,296 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 0 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:17,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2025-04-13 23:00:17,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 394. [2025-04-13 23:00:17,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 3.427480916030534) internal successors, (1347), 393 states have internal predecessors, (1347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 1347 transitions. [2025-04-13 23:00:17,303 INFO L79 Accepts]: Start accepts. Automaton has 394 states and 1347 transitions. Word has length 21 [2025-04-13 23:00:17,303 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:17,303 INFO L485 AbstractCegarLoop]: Abstraction has 394 states and 1347 transitions. [2025-04-13 23:00:17,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,303 INFO L278 IsEmpty]: Start isEmpty. Operand 394 states and 1347 transitions. [2025-04-13 23:00:17,303 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:00:17,303 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:17,304 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:17,309 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-13 23:00:17,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2025-04-13 23:00:17,504 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:17,504 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2132784205, now seen corresponding path program 1 times [2025-04-13 23:00:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:17,504 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990388563] [2025-04-13 23:00:17,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:17,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:17,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:17,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:17,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:17,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:17,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990388563] [2025-04-13 23:00:17,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990388563] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:17,535 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179497309] [2025-04-13 23:00:17,535 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:17,538 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:17,538 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-13 23:00:17,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:17,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:17,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:17,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:17,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:00:17,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:17,617 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:17,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:17,642 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:17,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179497309] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:17,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:17,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 23:00:17,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652708866] [2025-04-13 23:00:17,642 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:17,642 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:00:17,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:17,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:00:17,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:00:17,643 INFO L87 Difference]: Start difference. First operand 394 states and 1347 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:17,735 INFO L93 Difference]: Finished difference Result 665 states and 2274 transitions. [2025-04-13 23:00:17,735 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:00:17,735 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:00:17,735 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:17,738 INFO L225 Difference]: With dead ends: 665 [2025-04-13 23:00:17,738 INFO L226 Difference]: Without dead ends: 511 [2025-04-13 23:00:17,738 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:00:17,738 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:17,738 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:17,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2025-04-13 23:00:17,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 454. [2025-04-13 23:00:17,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 453 states have (on average 3.3863134657836644) internal successors, (1534), 453 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 1534 transitions. [2025-04-13 23:00:17,746 INFO L79 Accepts]: Start accepts. Automaton has 454 states and 1534 transitions. Word has length 22 [2025-04-13 23:00:17,747 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:17,747 INFO L485 AbstractCegarLoop]: Abstraction has 454 states and 1534 transitions. [2025-04-13 23:00:17,747 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:17,747 INFO L278 IsEmpty]: Start isEmpty. Operand 454 states and 1534 transitions. [2025-04-13 23:00:17,747 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-04-13 23:00:17,747 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:17,747 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:17,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:00:17,948 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:17,948 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:17,948 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:17,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1315858815, now seen corresponding path program 1 times [2025-04-13 23:00:17,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:17,949 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81837472] [2025-04-13 23:00:17,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:17,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:17,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:17,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:17,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:17,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:17,987 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:17,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:17,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81837472] [2025-04-13 23:00:17,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81837472] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:17,987 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [906326656] [2025-04-13 23:00:17,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:17,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:17,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:17,989 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:17,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-13 23:00:18,032 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-13 23:00:18,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-13 23:00:18,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:18,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:18,044 INFO L256 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-04-13 23:00:18,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:18,092 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:18,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:18,120 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:18,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [906326656] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:18,120 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:18,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-04-13 23:00:18,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639788622] [2025-04-13 23:00:18,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:18,120 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:00:18,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:18,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:00:18,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:00:18,121 INFO L87 Difference]: Start difference. First operand 454 states and 1534 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:18,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:18,190 INFO L93 Difference]: Finished difference Result 511 states and 1685 transitions. [2025-04-13 23:00:18,190 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:00:18,190 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-04-13 23:00:18,190 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:18,192 INFO L225 Difference]: With dead ends: 511 [2025-04-13 23:00:18,192 INFO L226 Difference]: Without dead ends: 279 [2025-04-13 23:00:18,192 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:18,192 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 25 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:18,192 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 0 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:18,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2025-04-13 23:00:18,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2025-04-13 23:00:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 278 states have (on average 3.4820143884892087) internal successors, (968), 278 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 968 transitions. [2025-04-13 23:00:18,197 INFO L79 Accepts]: Start accepts. Automaton has 279 states and 968 transitions. Word has length 22 [2025-04-13 23:00:18,197 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:18,197 INFO L485 AbstractCegarLoop]: Abstraction has 279 states and 968 transitions. [2025-04-13 23:00:18,197 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 11 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:18,197 INFO L278 IsEmpty]: Start isEmpty. Operand 279 states and 968 transitions. [2025-04-13 23:00:18,198 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:18,198 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:18,198 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:18,203 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:18,398 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2025-04-13 23:00:18,398 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:18,398 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:18,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1521903825, now seen corresponding path program 2 times [2025-04-13 23:00:18,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:18,399 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085922171] [2025-04-13 23:00:18,399 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:18,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:18,407 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:18,410 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:18,410 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:18,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:18,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:18,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:18,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085922171] [2025-04-13 23:00:18,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085922171] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:18,437 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1872713879] [2025-04-13 23:00:18,437 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:18,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:18,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:18,438 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:18,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-13 23:00:18,480 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:18,497 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:18,497 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:18,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:18,498 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:00:18,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:18,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:18,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:18,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:18,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1872713879] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:18,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:18,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 23:00:18,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244054881] [2025-04-13 23:00:18,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:18,592 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:00:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:18,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:00:18,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:18,592 INFO L87 Difference]: Start difference. First operand 279 states and 968 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:18,662 INFO L93 Difference]: Finished difference Result 393 states and 1234 transitions. [2025-04-13 23:00:18,663 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:00:18,663 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:00:18,663 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:18,664 INFO L225 Difference]: With dead ends: 393 [2025-04-13 23:00:18,665 INFO L226 Difference]: Without dead ends: 377 [2025-04-13 23:00:18,665 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:18,665 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:18,665 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-04-13 23:00:18,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 333. [2025-04-13 23:00:18,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 3.2951807228915664) internal successors, (1094), 332 states have internal predecessors, (1094), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:18,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 1094 transitions. [2025-04-13 23:00:18,671 INFO L79 Accepts]: Start accepts. Automaton has 333 states and 1094 transitions. Word has length 23 [2025-04-13 23:00:18,671 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:18,671 INFO L485 AbstractCegarLoop]: Abstraction has 333 states and 1094 transitions. [2025-04-13 23:00:18,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:18,671 INFO L278 IsEmpty]: Start isEmpty. Operand 333 states and 1094 transitions. [2025-04-13 23:00:18,671 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:18,671 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:18,671 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:18,678 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-13 23:00:18,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2025-04-13 23:00:18,872 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:18,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:18,872 INFO L85 PathProgramCache]: Analyzing trace with hash 600685981, now seen corresponding path program 3 times [2025-04-13 23:00:18,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:18,872 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107393121] [2025-04-13 23:00:18,872 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:18,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:18,877 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:18,880 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:18,880 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:18,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:18,902 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:18,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:18,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107393121] [2025-04-13 23:00:18,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107393121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:18,903 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701726433] [2025-04-13 23:00:18,903 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:18,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:18,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:18,904 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:18,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-13 23:00:18,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:18,955 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:18,956 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:18,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:18,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:00:18,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:18,994 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:18,995 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:19,030 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-13 23:00:19,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701726433] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:19,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:19,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 13 [2025-04-13 23:00:19,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44590226] [2025-04-13 23:00:19,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:19,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:00:19,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:19,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:00:19,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:19,031 INFO L87 Difference]: Start difference. First operand 333 states and 1094 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:19,090 INFO L93 Difference]: Finished difference Result 594 states and 1944 transitions. [2025-04-13 23:00:19,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:00:19,090 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:00:19,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:19,092 INFO L225 Difference]: With dead ends: 594 [2025-04-13 23:00:19,092 INFO L226 Difference]: Without dead ends: 578 [2025-04-13 23:00:19,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:19,093 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 97 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:19,094 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 0 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:00:19,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-04-13 23:00:19,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 359. [2025-04-13 23:00:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 358 states have (on average 3.416201117318436) internal successors, (1223), 358 states have internal predecessors, (1223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 1223 transitions. [2025-04-13 23:00:19,100 INFO L79 Accepts]: Start accepts. Automaton has 359 states and 1223 transitions. Word has length 23 [2025-04-13 23:00:19,100 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:19,100 INFO L485 AbstractCegarLoop]: Abstraction has 359 states and 1223 transitions. [2025-04-13 23:00:19,100 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,100 INFO L278 IsEmpty]: Start isEmpty. Operand 359 states and 1223 transitions. [2025-04-13 23:00:19,101 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:19,101 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:19,101 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:19,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:19,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2025-04-13 23:00:19,301 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:19,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:19,302 INFO L85 PathProgramCache]: Analyzing trace with hash 101740397, now seen corresponding path program 4 times [2025-04-13 23:00:19,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:19,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831512063] [2025-04-13 23:00:19,302 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:19,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:19,306 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:19,307 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 23:00:19,307 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 23:00:19,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:19,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:19,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:19,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831512063] [2025-04-13 23:00:19,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831512063] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:19,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1544128909] [2025-04-13 23:00:19,325 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:19,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:19,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:19,326 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:19,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-13 23:00:19,364 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:19,372 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 20 of 23 statements. [2025-04-13 23:00:19,372 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-13 23:00:19,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:19,373 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 23:00:19,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:19,396 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:19,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1544128909] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:19,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:19,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 8 [2025-04-13 23:00:19,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176735987] [2025-04-13 23:00:19,420 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:19,420 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:00:19,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:19,421 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:00:19,421 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:00:19,421 INFO L87 Difference]: Start difference. First operand 359 states and 1223 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:19,641 INFO L93 Difference]: Finished difference Result 664 states and 2288 transitions. [2025-04-13 23:00:19,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:00:19,641 INFO L79 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:00:19,641 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:19,644 INFO L225 Difference]: With dead ends: 664 [2025-04-13 23:00:19,644 INFO L226 Difference]: Without dead ends: 654 [2025-04-13 23:00:19,644 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:00:19,645 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 100 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:19,645 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 0 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:00:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2025-04-13 23:00:19,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 380. [2025-04-13 23:00:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 379 states have (on average 3.453825857519789) internal successors, (1309), 379 states have internal predecessors, (1309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 1309 transitions. [2025-04-13 23:00:19,652 INFO L79 Accepts]: Start accepts. Automaton has 380 states and 1309 transitions. Word has length 23 [2025-04-13 23:00:19,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:19,652 INFO L485 AbstractCegarLoop]: Abstraction has 380 states and 1309 transitions. [2025-04-13 23:00:19,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,652 INFO L278 IsEmpty]: Start isEmpty. Operand 380 states and 1309 transitions. [2025-04-13 23:00:19,653 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:19,653 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:19,653 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:19,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-13 23:00:19,857 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2025-04-13 23:00:19,858 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:19,858 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:19,858 INFO L85 PathProgramCache]: Analyzing trace with hash -296644789, now seen corresponding path program 5 times [2025-04-13 23:00:19,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:19,858 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676734406] [2025-04-13 23:00:19,858 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:19,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:19,862 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:19,864 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:19,864 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:19,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:19,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:19,885 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676734406] [2025-04-13 23:00:19,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676734406] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:19,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:19,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:00:19,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506931689] [2025-04-13 23:00:19,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:19,885 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:00:19,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:19,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:00:19,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:00:19,886 INFO L87 Difference]: Start difference. First operand 380 states and 1309 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:19,984 INFO L93 Difference]: Finished difference Result 510 states and 1764 transitions. [2025-04-13 23:00:19,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 23:00:19,984 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:00:19,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:19,986 INFO L225 Difference]: With dead ends: 510 [2025-04-13 23:00:19,987 INFO L226 Difference]: Without dead ends: 496 [2025-04-13 23:00:19,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:00:19,987 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:19,987 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 0 Invalid, 251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:19,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2025-04-13 23:00:19,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 408. [2025-04-13 23:00:19,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 3.501228501228501) internal successors, (1425), 407 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1425 transitions. [2025-04-13 23:00:19,994 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1425 transitions. Word has length 23 [2025-04-13 23:00:19,994 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:19,994 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1425 transitions. [2025-04-13 23:00:19,994 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:19,994 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1425 transitions. [2025-04-13 23:00:19,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:19,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:19,995 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:19,995 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-13 23:00:19,995 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:19,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:19,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1727948239, now seen corresponding path program 6 times [2025-04-13 23:00:19,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:19,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804035624] [2025-04-13 23:00:19,995 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:19,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:19,999 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 23 statements into 2 equivalence classes. [2025-04-13 23:00:20,000 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 21 of 23 statements. [2025-04-13 23:00:20,000 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:00:20,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:20,030 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:20,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:20,031 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804035624] [2025-04-13 23:00:20,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804035624] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:00:20,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:00:20,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-13 23:00:20,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275932045] [2025-04-13 23:00:20,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:20,031 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-13 23:00:20,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:20,031 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-13 23:00:20,031 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:00:20,034 INFO L87 Difference]: Start difference. First operand 408 states and 1425 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:20,141 INFO L93 Difference]: Finished difference Result 513 states and 1710 transitions. [2025-04-13 23:00:20,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:00:20,141 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:00:20,141 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:20,143 INFO L225 Difference]: With dead ends: 513 [2025-04-13 23:00:20,143 INFO L226 Difference]: Without dead ends: 503 [2025-04-13 23:00:20,143 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-04-13 23:00:20,143 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:20,143 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 23:00:20,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503 states. [2025-04-13 23:00:20,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503 to 408. [2025-04-13 23:00:20,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 407 states have (on average 3.501228501228501) internal successors, (1425), 407 states have internal predecessors, (1425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 1425 transitions. [2025-04-13 23:00:20,150 INFO L79 Accepts]: Start accepts. Automaton has 408 states and 1425 transitions. Word has length 23 [2025-04-13 23:00:20,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:20,150 INFO L485 AbstractCegarLoop]: Abstraction has 408 states and 1425 transitions. [2025-04-13 23:00:20,150 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:20,150 INFO L278 IsEmpty]: Start isEmpty. Operand 408 states and 1425 transitions. [2025-04-13 23:00:20,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-04-13 23:00:20,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:20,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:20,151 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-13 23:00:20,151 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:20,151 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1830609659, now seen corresponding path program 7 times [2025-04-13 23:00:20,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:20,152 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448160708] [2025-04-13 23:00:20,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:20,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:20,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:00:20,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:20,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:20,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:20,193 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:20,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:20,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448160708] [2025-04-13 23:00:20,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448160708] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:20,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727416092] [2025-04-13 23:00:20,193 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:20,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:20,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:20,195 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:20,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-13 23:00:20,237 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-13 23:00:20,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-13 23:00:20,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:20,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:20,249 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-13 23:00:20,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:20,283 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:20,283 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:20,323 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:20,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727416092] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:20,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:00:20,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2025-04-13 23:00:20,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055970131] [2025-04-13 23:00:20,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:00:20,324 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 23:00:20,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:20,324 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 23:00:20,324 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:00:20,324 INFO L87 Difference]: Start difference. First operand 408 states and 1425 transitions. Second operand has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:20,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:20,373 INFO L93 Difference]: Finished difference Result 481 states and 1596 transitions. [2025-04-13 23:00:20,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-13 23:00:20,373 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-04-13 23:00:20,373 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:20,375 INFO L225 Difference]: With dead ends: 481 [2025-04-13 23:00:20,375 INFO L226 Difference]: Without dead ends: 461 [2025-04-13 23:00:20,375 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:00:20,375 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 56 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:20,376 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 0 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 23:00:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2025-04-13 23:00:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 372. [2025-04-13 23:00:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 372 states, 371 states have (on average 3.3827493261455523) internal successors, (1255), 371 states have internal predecessors, (1255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:20,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 1255 transitions. [2025-04-13 23:00:20,381 INFO L79 Accepts]: Start accepts. Automaton has 372 states and 1255 transitions. Word has length 23 [2025-04-13 23:00:20,381 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:20,381 INFO L485 AbstractCegarLoop]: Abstraction has 372 states and 1255 transitions. [2025-04-13 23:00:20,381 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:20,381 INFO L278 IsEmpty]: Start isEmpty. Operand 372 states and 1255 transitions. [2025-04-13 23:00:20,382 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:20,382 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:20,382 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:20,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:20,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:20,583 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:20,583 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:20,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1694713710, now seen corresponding path program 1 times [2025-04-13 23:00:20,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:20,583 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105375753] [2025-04-13 23:00:20,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:20,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:20,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:20,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:20,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:20,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:21,066 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:21,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:21,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105375753] [2025-04-13 23:00:21,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105375753] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:21,066 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380571781] [2025-04-13 23:00:21,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:00:21,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:21,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:21,068 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:21,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-13 23:00:21,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:21,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:21,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:21,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:21,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:00:21,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:21,568 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:21,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:00:21,619 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:21,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:22,145 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:22,145 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:00:22,996 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:22,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380571781] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:22,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:22,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:00:22,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195250536] [2025-04-13 23:00:22,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:22,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:00:22,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:22,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:00:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=991, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:00:22,997 INFO L87 Difference]: Start difference. First operand 372 states and 1255 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:25,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:25,770 INFO L93 Difference]: Finished difference Result 639 states and 2018 transitions. [2025-04-13 23:00:25,770 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:00:25,770 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:25,770 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:25,772 INFO L225 Difference]: With dead ends: 639 [2025-04-13 23:00:25,772 INFO L226 Difference]: Without dead ends: 628 [2025-04-13 23:00:25,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=528, Invalid=4584, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:00:25,774 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 277 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2847 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 2847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:25,774 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 0 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 2847 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:00:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2025-04-13 23:00:25,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 460. [2025-04-13 23:00:25,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 459 states have (on average 3.320261437908497) internal successors, (1524), 459 states have internal predecessors, (1524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:25,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 1524 transitions. [2025-04-13 23:00:25,781 INFO L79 Accepts]: Start accepts. Automaton has 460 states and 1524 transitions. Word has length 25 [2025-04-13 23:00:25,781 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:25,781 INFO L485 AbstractCegarLoop]: Abstraction has 460 states and 1524 transitions. [2025-04-13 23:00:25,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:25,781 INFO L278 IsEmpty]: Start isEmpty. Operand 460 states and 1524 transitions. [2025-04-13 23:00:25,782 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:25,782 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:25,782 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:25,788 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-13 23:00:25,982 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2025-04-13 23:00:25,983 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:25,983 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:25,983 INFO L85 PathProgramCache]: Analyzing trace with hash -297338948, now seen corresponding path program 2 times [2025-04-13 23:00:25,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:25,983 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434243633] [2025-04-13 23:00:25,983 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:25,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:25,988 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:26,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:26,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:26,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:26,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:26,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:26,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434243633] [2025-04-13 23:00:26,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434243633] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:26,424 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87492442] [2025-04-13 23:00:26,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:00:26,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:26,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:26,426 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:26,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-13 23:00:26,467 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:26,480 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:26,480 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:26,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:26,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:00:26,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:26,926 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:26,926 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 101 [2025-04-13 23:00:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:27,176 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:27,827 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:27,828 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:00:28,178 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:28,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87492442] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:28,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:28,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2025-04-13 23:00:28,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987239689] [2025-04-13 23:00:28,179 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:28,179 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:00:28,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:28,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:00:28,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=1136, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:00:28,180 INFO L87 Difference]: Start difference. First operand 460 states and 1524 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:33,305 INFO L93 Difference]: Finished difference Result 953 states and 2986 transitions. [2025-04-13 23:00:33,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 23:00:33,305 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:33,305 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:33,308 INFO L225 Difference]: With dead ends: 953 [2025-04-13 23:00:33,308 INFO L226 Difference]: Without dead ends: 942 [2025-04-13 23:00:33,309 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2847 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1351, Invalid=7961, Unknown=0, NotChecked=0, Total=9312 [2025-04-13 23:00:33,310 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 521 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2938 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 2938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:33,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 0 Invalid, 3079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 2938 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:00:33,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-04-13 23:00:33,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 536. [2025-04-13 23:00:33,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 535 states have (on average 3.3327102803738318) internal successors, (1783), 535 states have internal predecessors, (1783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:33,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 1783 transitions. [2025-04-13 23:00:33,319 INFO L79 Accepts]: Start accepts. Automaton has 536 states and 1783 transitions. Word has length 25 [2025-04-13 23:00:33,319 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:33,319 INFO L485 AbstractCegarLoop]: Abstraction has 536 states and 1783 transitions. [2025-04-13 23:00:33,319 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:33,319 INFO L278 IsEmpty]: Start isEmpty. Operand 536 states and 1783 transitions. [2025-04-13 23:00:33,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:33,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:33,320 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:33,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-04-13 23:00:33,520 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:33,521 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:33,521 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:33,521 INFO L85 PathProgramCache]: Analyzing trace with hash -196980906, now seen corresponding path program 3 times [2025-04-13 23:00:33,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:33,521 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800913436] [2025-04-13 23:00:33,521 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:33,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:33,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:33,531 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:33,532 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:33,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:33,864 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:33,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:33,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800913436] [2025-04-13 23:00:33,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800913436] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:33,865 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584687125] [2025-04-13 23:00:33,865 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:00:33,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:33,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:33,866 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:33,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-04-13 23:00:33,905 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:33,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:33,918 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:00:33,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:33,919 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:00:33,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:34,348 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:34,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:00:34,507 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:34,507 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:35,066 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:35,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:00:35,393 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:35,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584687125] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:35,393 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:35,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:00:35,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980572249] [2025-04-13 23:00:35,394 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:35,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:00:35,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:35,394 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:00:35,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:00:35,394 INFO L87 Difference]: Start difference. First operand 536 states and 1783 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:39,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:39,137 INFO L93 Difference]: Finished difference Result 925 states and 3071 transitions. [2025-04-13 23:00:39,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:00:39,137 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:39,138 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:39,140 INFO L225 Difference]: With dead ends: 925 [2025-04-13 23:00:39,140 INFO L226 Difference]: Without dead ends: 914 [2025-04-13 23:00:39,141 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2378 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1181, Invalid=6651, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 23:00:39,142 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 347 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1996 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1996 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:39,142 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 0 Invalid, 2108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1996 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:00:39,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states. [2025-04-13 23:00:39,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 578. [2025-04-13 23:00:39,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 577 states have (on average 3.3223570190641247) internal successors, (1917), 577 states have internal predecessors, (1917), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 1917 transitions. [2025-04-13 23:00:39,150 INFO L79 Accepts]: Start accepts. Automaton has 578 states and 1917 transitions. Word has length 25 [2025-04-13 23:00:39,150 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:39,150 INFO L485 AbstractCegarLoop]: Abstraction has 578 states and 1917 transitions. [2025-04-13 23:00:39,151 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:39,151 INFO L278 IsEmpty]: Start isEmpty. Operand 578 states and 1917 transitions. [2025-04-13 23:00:39,151 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:39,151 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:39,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:39,157 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2025-04-13 23:00:39,352 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:39,352 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:39,352 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:39,352 INFO L85 PathProgramCache]: Analyzing trace with hash -566121038, now seen corresponding path program 4 times [2025-04-13 23:00:39,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:39,352 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230038123] [2025-04-13 23:00:39,352 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:39,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:39,356 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:39,360 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:39,360 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:39,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:39,620 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:39,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:39,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230038123] [2025-04-13 23:00:39,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230038123] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:39,620 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141490620] [2025-04-13 23:00:39,620 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:00:39,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:39,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:39,622 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:39,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-04-13 23:00:39,665 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:39,678 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:39,678 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:00:39,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:39,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:00:39,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:40,101 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:40,103 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:00:40,166 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:40,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:40,777 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:40,777 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:00:41,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:41,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141490620] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:41,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:41,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:00:41,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785641793] [2025-04-13 23:00:41,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:41,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:00:41,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:41,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:00:41,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=921, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:00:41,560 INFO L87 Difference]: Start difference. First operand 578 states and 1917 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:45,276 INFO L93 Difference]: Finished difference Result 936 states and 2957 transitions. [2025-04-13 23:00:45,277 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2025-04-13 23:00:45,277 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:45,277 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:45,279 INFO L225 Difference]: With dead ends: 936 [2025-04-13 23:00:45,279 INFO L226 Difference]: Without dead ends: 920 [2025-04-13 23:00:45,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2107 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1008, Invalid=6824, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 23:00:45,284 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 417 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3366 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:45,284 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 0 Invalid, 3455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3366 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:00:45,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-04-13 23:00:45,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 616. [2025-04-13 23:00:45,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 3.330081300813008) internal successors, (2048), 615 states have internal predecessors, (2048), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 2048 transitions. [2025-04-13 23:00:45,294 INFO L79 Accepts]: Start accepts. Automaton has 616 states and 2048 transitions. Word has length 25 [2025-04-13 23:00:45,294 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:45,295 INFO L485 AbstractCegarLoop]: Abstraction has 616 states and 2048 transitions. [2025-04-13 23:00:45,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:45,295 INFO L278 IsEmpty]: Start isEmpty. Operand 616 states and 2048 transitions. [2025-04-13 23:00:45,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:45,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:45,296 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:45,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-04-13 23:00:45,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:45,496 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:45,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:45,497 INFO L85 PathProgramCache]: Analyzing trace with hash 2112644532, now seen corresponding path program 5 times [2025-04-13 23:00:45,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:45,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273490363] [2025-04-13 23:00:45,497 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:45,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:45,503 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:45,507 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:45,507 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:45,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:46,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:00:46,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:46,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273490363] [2025-04-13 23:00:46,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273490363] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:46,002 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813041011] [2025-04-13 23:00:46,002 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:00:46,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:46,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:46,004 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:46,004 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-04-13 23:00:46,046 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:46,060 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:46,060 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:00:46,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:46,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:00:46,061 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:46,409 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:46,410 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:00:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:46,476 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:47,027 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:47,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:00:48,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:48,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813041011] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:48,043 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:48,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:00:48,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664358559] [2025-04-13 23:00:48,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:48,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:00:48,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:48,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:00:48,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:00:48,044 INFO L87 Difference]: Start difference. First operand 616 states and 2048 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:49,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:49,861 INFO L93 Difference]: Finished difference Result 920 states and 3012 transitions. [2025-04-13 23:00:49,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 23:00:49,861 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:49,861 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:49,863 INFO L225 Difference]: With dead ends: 920 [2025-04-13 23:00:49,863 INFO L226 Difference]: Without dead ends: 909 [2025-04-13 23:00:49,864 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 993 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=527, Invalid=3505, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:00:49,864 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1935 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 1935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:49,864 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 1985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 1935 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:00:49,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-04-13 23:00:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 626. [2025-04-13 23:00:49,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 625 states have (on average 3.336) internal successors, (2085), 625 states have internal predecessors, (2085), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 2085 transitions. [2025-04-13 23:00:49,874 INFO L79 Accepts]: Start accepts. Automaton has 626 states and 2085 transitions. Word has length 25 [2025-04-13 23:00:49,874 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:49,874 INFO L485 AbstractCegarLoop]: Abstraction has 626 states and 2085 transitions. [2025-04-13 23:00:49,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:49,874 INFO L278 IsEmpty]: Start isEmpty. Operand 626 states and 2085 transitions. [2025-04-13 23:00:49,875 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:49,875 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:49,875 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:49,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2025-04-13 23:00:50,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:50,075 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:50,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:50,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1601387322, now seen corresponding path program 6 times [2025-04-13 23:00:50,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:50,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114223976] [2025-04-13 23:00:50,076 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:50,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:50,080 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:50,085 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:50,085 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:50,431 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:50,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:50,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114223976] [2025-04-13 23:00:50,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114223976] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:50,432 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [892412714] [2025-04-13 23:00:50,432 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:00:50,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:50,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:50,434 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:50,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2025-04-13 23:00:50,475 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:00:50,488 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:50,488 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:00:50,488 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:50,489 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:00:50,490 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:50,938 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:50,938 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:00:51,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:51,142 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:51,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:51,756 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 127 [2025-04-13 23:00:52,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:52,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [892412714] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:52,023 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:52,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:00:52,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730587710] [2025-04-13 23:00:52,023 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:52,023 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:00:52,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:52,023 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:00:52,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=1083, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:00:52,024 INFO L87 Difference]: Start difference. First operand 626 states and 2085 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:00:56,753 INFO L93 Difference]: Finished difference Result 1070 states and 3482 transitions. [2025-04-13 23:00:56,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 23:00:56,753 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:00:56,754 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:00:56,756 INFO L225 Difference]: With dead ends: 1070 [2025-04-13 23:00:56,757 INFO L226 Difference]: Without dead ends: 1049 [2025-04-13 23:00:56,757 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2820 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1330, Invalid=7790, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 23:00:56,758 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 405 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:00:56,758 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 0 Invalid, 2684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:00:56,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2025-04-13 23:00:56,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 616. [2025-04-13 23:00:56,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 616 states, 615 states have (on average 3.351219512195122) internal successors, (2061), 615 states have internal predecessors, (2061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 616 states to 616 states and 2061 transitions. [2025-04-13 23:00:56,767 INFO L79 Accepts]: Start accepts. Automaton has 616 states and 2061 transitions. Word has length 25 [2025-04-13 23:00:56,767 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:00:56,767 INFO L485 AbstractCegarLoop]: Abstraction has 616 states and 2061 transitions. [2025-04-13 23:00:56,767 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:00:56,767 INFO L278 IsEmpty]: Start isEmpty. Operand 616 states and 2061 transitions. [2025-04-13 23:00:56,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:00:56,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:00:56,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:00:56,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2025-04-13 23:00:56,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2025-04-13 23:00:56,969 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:00:56,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:00:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash -2145454712, now seen corresponding path program 7 times [2025-04-13 23:00:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:00:56,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944378925] [2025-04-13 23:00:56,969 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:56,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:00:56,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:56,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:56,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:56,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:57,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:00:57,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:00:57,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944378925] [2025-04-13 23:00:57,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944378925] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:00:57,411 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98194420] [2025-04-13 23:00:57,411 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:00:57,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:00:57,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:00:57,413 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:00:57,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2025-04-13 23:00:57,454 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:00:57,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:00:57,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:00:57,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:00:57,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:00:57,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:00:57,788 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:57,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:00:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:57,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:00:58,398 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:00:58,399 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:00:59,258 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:00:59,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98194420] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:00:59,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:00:59,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:00:59,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259647907] [2025-04-13 23:00:59,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:00:59,259 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:00:59,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:00:59,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:00:59,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=971, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:00:59,259 INFO L87 Difference]: Start difference. First operand 616 states and 2061 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:02,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:02,295 INFO L93 Difference]: Finished difference Result 877 states and 2855 transitions. [2025-04-13 23:01:02,295 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 23:01:02,295 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:02,295 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:02,297 INFO L225 Difference]: With dead ends: 877 [2025-04-13 23:01:02,298 INFO L226 Difference]: Without dead ends: 866 [2025-04-13 23:01:02,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1332 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=700, Invalid=4850, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:01:02,298 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:02,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 2868 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:01:02,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 866 states. [2025-04-13 23:01:02,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 866 to 628. [2025-04-13 23:01:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 627 states have (on average 3.3700159489633172) internal successors, (2113), 627 states have internal predecessors, (2113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 2113 transitions. [2025-04-13 23:01:02,307 INFO L79 Accepts]: Start accepts. Automaton has 628 states and 2113 transitions. Word has length 25 [2025-04-13 23:01:02,307 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:02,307 INFO L485 AbstractCegarLoop]: Abstraction has 628 states and 2113 transitions. [2025-04-13 23:01:02,307 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:02,308 INFO L278 IsEmpty]: Start isEmpty. Operand 628 states and 2113 transitions. [2025-04-13 23:01:02,308 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:02,308 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:02,308 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:02,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2025-04-13 23:01:02,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2025-04-13 23:01:02,509 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:02,509 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:02,509 INFO L85 PathProgramCache]: Analyzing trace with hash 708238116, now seen corresponding path program 8 times [2025-04-13 23:01:02,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:02,509 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067655121] [2025-04-13 23:01:02,509 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:02,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:02,514 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:02,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:02,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:02,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:02,912 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:02,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:02,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067655121] [2025-04-13 23:01:02,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067655121] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:02,912 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042031231] [2025-04-13 23:01:02,912 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:02,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:02,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:02,914 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:02,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2025-04-13 23:01:02,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:02,970 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:02,970 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:02,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:02,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:01:02,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:03,348 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:03,348 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:01:03,644 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:03,644 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:04,316 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:04,317 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 127 [2025-04-13 23:01:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1042031231] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:04,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 35 [2025-04-13 23:01:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813839393] [2025-04-13 23:01:04,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:04,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:01:04,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:04,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:01:04,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=1124, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:01:04,589 INFO L87 Difference]: Start difference. First operand 628 states and 2113 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:10,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:10,574 INFO L93 Difference]: Finished difference Result 1080 states and 3592 transitions. [2025-04-13 23:01:10,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2025-04-13 23:01:10,574 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:10,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:10,577 INFO L225 Difference]: With dead ends: 1080 [2025-04-13 23:01:10,577 INFO L226 Difference]: Without dead ends: 1064 [2025-04-13 23:01:10,578 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3807 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1737, Invalid=10253, Unknown=0, NotChecked=0, Total=11990 [2025-04-13 23:01:10,578 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 483 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2758 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 2758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:10,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 0 Invalid, 2882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 2758 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:01:10,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1064 states. [2025-04-13 23:01:10,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1064 to 634. [2025-04-13 23:01:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 633 states have (on average 3.3712480252764614) internal successors, (2134), 633 states have internal predecessors, (2134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:10,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 2134 transitions. [2025-04-13 23:01:10,588 INFO L79 Accepts]: Start accepts. Automaton has 634 states and 2134 transitions. Word has length 25 [2025-04-13 23:01:10,588 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:10,588 INFO L485 AbstractCegarLoop]: Abstraction has 634 states and 2134 transitions. [2025-04-13 23:01:10,589 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:10,589 INFO L278 IsEmpty]: Start isEmpty. Operand 634 states and 2134 transitions. [2025-04-13 23:01:10,589 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:10,589 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:10,590 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:10,598 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2025-04-13 23:01:10,790 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:10,790 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:10,790 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:10,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2088654172, now seen corresponding path program 9 times [2025-04-13 23:01:10,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:10,791 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686656927] [2025-04-13 23:01:10,791 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:01:10,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:10,794 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:10,799 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:10,799 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:01:10,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:11,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:11,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686656927] [2025-04-13 23:01:11,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686656927] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:11,104 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1112044357] [2025-04-13 23:01:11,104 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:01:11,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:11,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:11,106 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:11,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2025-04-13 23:01:11,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:11,163 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:11,163 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:01:11,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:11,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:01:11,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:11,501 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:11,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 101 [2025-04-13 23:01:11,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:11,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:12,264 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:12,265 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:01:12,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1112044357] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:12,577 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:01:12,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147808653] [2025-04-13 23:01:12,577 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:12,577 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:01:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:12,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:01:12,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=930, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:01:12,578 INFO L87 Difference]: Start difference. First operand 634 states and 2134 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:16,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:16,159 INFO L93 Difference]: Finished difference Result 1073 states and 3534 transitions. [2025-04-13 23:01:16,159 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 23:01:16,159 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:16,159 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:16,162 INFO L225 Difference]: With dead ends: 1073 [2025-04-13 23:01:16,162 INFO L226 Difference]: Without dead ends: 1062 [2025-04-13 23:01:16,163 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2744 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1190, Invalid=7366, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 23:01:16,163 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2287 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 2287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:16,163 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 2287 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:01:16,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2025-04-13 23:01:16,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 664. [2025-04-13 23:01:16,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 663 states have (on average 3.368024132730015) internal successors, (2233), 663 states have internal predecessors, (2233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:16,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 2233 transitions. [2025-04-13 23:01:16,173 INFO L79 Accepts]: Start accepts. Automaton has 664 states and 2233 transitions. Word has length 25 [2025-04-13 23:01:16,173 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:16,173 INFO L485 AbstractCegarLoop]: Abstraction has 664 states and 2233 transitions. [2025-04-13 23:01:16,173 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:16,173 INFO L278 IsEmpty]: Start isEmpty. Operand 664 states and 2233 transitions. [2025-04-13 23:01:16,174 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:16,174 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:16,174 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:16,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2025-04-13 23:01:16,375 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:16,375 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:16,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash 745106168, now seen corresponding path program 10 times [2025-04-13 23:01:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:16,375 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052460244] [2025-04-13 23:01:16,375 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:16,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:16,379 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:16,388 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:16,388 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:16,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:16,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:16,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:16,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052460244] [2025-04-13 23:01:16,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052460244] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:16,647 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049227587] [2025-04-13 23:01:16,647 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:16,647 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:16,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:16,649 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:16,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2025-04-13 23:01:16,692 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:16,704 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:16,704 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:16,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:16,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:01:16,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:17,071 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:17,071 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:01:17,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:17,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:17,772 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:17,772 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:01:18,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:18,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049227587] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:18,509 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:18,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:01:18,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285017341] [2025-04-13 23:01:18,509 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:18,509 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:01:18,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:18,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:01:18,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:01:18,509 INFO L87 Difference]: Start difference. First operand 664 states and 2233 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:23,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:23,236 INFO L93 Difference]: Finished difference Result 1033 states and 3288 transitions. [2025-04-13 23:01:23,236 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-13 23:01:23,236 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:23,236 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:23,239 INFO L225 Difference]: With dead ends: 1033 [2025-04-13 23:01:23,239 INFO L226 Difference]: Without dead ends: 1012 [2025-04-13 23:01:23,240 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3009 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1279, Invalid=8821, Unknown=0, NotChecked=0, Total=10100 [2025-04-13 23:01:23,240 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 393 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3140 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 3140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:23,241 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 0 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 3140 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:01:23,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1012 states. [2025-04-13 23:01:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1012 to 660. [2025-04-13 23:01:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 660 states, 659 states have (on average 3.3717754172989376) internal successors, (2222), 659 states have internal predecessors, (2222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:23,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 2222 transitions. [2025-04-13 23:01:23,250 INFO L79 Accepts]: Start accepts. Automaton has 660 states and 2222 transitions. Word has length 25 [2025-04-13 23:01:23,251 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:23,251 INFO L485 AbstractCegarLoop]: Abstraction has 660 states and 2222 transitions. [2025-04-13 23:01:23,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:23,251 INFO L278 IsEmpty]: Start isEmpty. Operand 660 states and 2222 transitions. [2025-04-13 23:01:23,252 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:23,252 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:23,252 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:23,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2025-04-13 23:01:23,452 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2025-04-13 23:01:23,452 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:23,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash -56016590, now seen corresponding path program 11 times [2025-04-13 23:01:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:23,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185361559] [2025-04-13 23:01:23,453 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:23,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:23,456 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:23,462 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:23,463 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:23,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:23,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:23,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:23,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185361559] [2025-04-13 23:01:23,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185361559] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:23,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1088564825] [2025-04-13 23:01:23,852 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:23,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:23,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:23,854 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:23,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2025-04-13 23:01:23,898 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:23,911 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:23,911 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:23,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:23,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:01:23,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:24,294 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:24,294 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:01:24,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:24,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:24,865 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:24,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:01:25,642 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:25,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1088564825] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:25,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:25,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 9] total 29 [2025-04-13 23:01:25,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499829765] [2025-04-13 23:01:25,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:25,643 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 23:01:25,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:25,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 23:01:25,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=811, Unknown=0, NotChecked=0, Total=930 [2025-04-13 23:01:25,643 INFO L87 Difference]: Start difference. First operand 660 states and 2222 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:28,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:28,061 INFO L93 Difference]: Finished difference Result 951 states and 3127 transitions. [2025-04-13 23:01:28,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 23:01:28,062 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:28,062 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:28,065 INFO L225 Difference]: With dead ends: 951 [2025-04-13 23:01:28,065 INFO L226 Difference]: Without dead ends: 940 [2025-04-13 23:01:28,065 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=591, Invalid=3965, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 23:01:28,066 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:28,066 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 2112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:01:28,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2025-04-13 23:01:28,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 688. [2025-04-13 23:01:28,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 687 states have (on average 3.388646288209607) internal successors, (2328), 687 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:28,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 2328 transitions. [2025-04-13 23:01:28,077 INFO L79 Accepts]: Start accepts. Automaton has 688 states and 2328 transitions. Word has length 25 [2025-04-13 23:01:28,078 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:28,078 INFO L485 AbstractCegarLoop]: Abstraction has 688 states and 2328 transitions. [2025-04-13 23:01:28,078 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:28,079 INFO L278 IsEmpty]: Start isEmpty. Operand 688 states and 2328 transitions. [2025-04-13 23:01:28,079 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:28,080 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:28,080 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:28,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2025-04-13 23:01:28,280 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-04-13 23:01:28,280 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:28,280 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:28,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1460423006, now seen corresponding path program 12 times [2025-04-13 23:01:28,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:28,281 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195528093] [2025-04-13 23:01:28,281 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:01:28,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:28,284 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:28,288 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:28,289 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:01:28,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:28,576 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:28,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:28,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195528093] [2025-04-13 23:01:28,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195528093] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:28,576 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [538486176] [2025-04-13 23:01:28,576 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:01:28,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:28,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:28,578 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:28,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2025-04-13 23:01:28,622 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:28,635 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:28,635 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:01:28,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:28,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:01:28,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:29,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:01:29,121 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:29,121 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:01:29,260 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:29,260 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:29,857 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:29,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:01:30,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:30,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [538486176] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:30,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:30,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:01:30,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718896489] [2025-04-13 23:01:30,130 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:30,130 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:01:30,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:30,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:01:30,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:01:30,131 INFO L87 Difference]: Start difference. First operand 688 states and 2328 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:34,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:34,195 INFO L93 Difference]: Finished difference Result 1084 states and 3610 transitions. [2025-04-13 23:01:34,195 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2025-04-13 23:01:34,195 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:34,196 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:34,198 INFO L225 Difference]: With dead ends: 1084 [2025-04-13 23:01:34,198 INFO L226 Difference]: Without dead ends: 1073 [2025-04-13 23:01:34,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2806 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1087, Invalid=8033, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 23:01:34,199 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 390 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 390 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:34,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [390 Valid, 0 Invalid, 2762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:01:34,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2025-04-13 23:01:34,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 710. [2025-04-13 23:01:34,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 709 states have (on average 3.383638928067701) internal successors, (2399), 709 states have internal predecessors, (2399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:34,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 2399 transitions. [2025-04-13 23:01:34,212 INFO L79 Accepts]: Start accepts. Automaton has 710 states and 2399 transitions. Word has length 25 [2025-04-13 23:01:34,212 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:34,212 INFO L485 AbstractCegarLoop]: Abstraction has 710 states and 2399 transitions. [2025-04-13 23:01:34,212 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:34,212 INFO L278 IsEmpty]: Start isEmpty. Operand 710 states and 2399 transitions. [2025-04-13 23:01:34,213 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:34,213 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:34,214 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:34,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2025-04-13 23:01:34,414 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable50 [2025-04-13 23:01:34,414 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:34,414 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:34,414 INFO L85 PathProgramCache]: Analyzing trace with hash -269390856, now seen corresponding path program 13 times [2025-04-13 23:01:34,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:34,415 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480972400] [2025-04-13 23:01:34,415 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:34,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:34,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:01:34,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:34,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:34,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:35,015 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:35,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:35,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480972400] [2025-04-13 23:01:35,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480972400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:35,015 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1357928463] [2025-04-13 23:01:35,015 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:01:35,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:35,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:35,017 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:35,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2025-04-13 23:01:35,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:01:35,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:35,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:01:35,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:35,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:01:35,075 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:35,451 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:35,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:01:35,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:35,509 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:36,255 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:36,256 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:01:37,085 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:37,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1357928463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:37,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:37,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 9] total 33 [2025-04-13 23:01:37,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519257460] [2025-04-13 23:01:37,085 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:37,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:01:37,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:37,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:01:37,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=1059, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:01:37,086 INFO L87 Difference]: Start difference. First operand 710 states and 2399 transitions. Second operand has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:39,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:39,528 INFO L93 Difference]: Finished difference Result 923 states and 3005 transitions. [2025-04-13 23:01:39,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:01:39,528 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:39,528 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:39,530 INFO L225 Difference]: With dead ends: 923 [2025-04-13 23:01:39,530 INFO L226 Difference]: Without dead ends: 912 [2025-04-13 23:01:39,531 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 883 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=464, Invalid=3826, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:01:39,531 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 217 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2846 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2887 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2846 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:39,531 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 0 Invalid, 2887 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2846 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:01:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2025-04-13 23:01:39,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 726. [2025-04-13 23:01:39,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 726 states, 725 states have (on average 3.386206896551724) internal successors, (2455), 725 states have internal predecessors, (2455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:39,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 726 states to 726 states and 2455 transitions. [2025-04-13 23:01:39,541 INFO L79 Accepts]: Start accepts. Automaton has 726 states and 2455 transitions. Word has length 25 [2025-04-13 23:01:39,541 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:39,541 INFO L485 AbstractCegarLoop]: Abstraction has 726 states and 2455 transitions. [2025-04-13 23:01:39,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 34 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:39,542 INFO L278 IsEmpty]: Start isEmpty. Operand 726 states and 2455 transitions. [2025-04-13 23:01:39,543 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:39,543 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:39,543 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:39,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2025-04-13 23:01:39,743 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:39,743 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:39,743 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:39,743 INFO L85 PathProgramCache]: Analyzing trace with hash -1673797272, now seen corresponding path program 14 times [2025-04-13 23:01:39,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:39,744 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177594047] [2025-04-13 23:01:39,744 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:39,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:39,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:39,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:39,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:39,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:40,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:40,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177594047] [2025-04-13 23:01:40,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177594047] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:40,193 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709246118] [2025-04-13 23:01:40,193 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:01:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:40,195 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:40,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2025-04-13 23:01:40,239 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:40,252 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:40,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:40,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:40,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:01:40,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:40,704 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:40,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:01:40,861 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:40,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:41,559 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:41,559 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:01:41,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:41,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709246118] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:41,816 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 35 [2025-04-13 23:01:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740512257] [2025-04-13 23:01:41,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:41,816 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:01:41,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:41,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:01:41,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1162, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:01:41,817 INFO L87 Difference]: Start difference. First operand 726 states and 2455 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:44,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:44,658 INFO L93 Difference]: Finished difference Result 953 states and 3123 transitions. [2025-04-13 23:01:44,658 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 23:01:44,658 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:44,658 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:44,660 INFO L225 Difference]: With dead ends: 953 [2025-04-13 23:01:44,660 INFO L226 Difference]: Without dead ends: 942 [2025-04-13 23:01:44,661 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=539, Invalid=3751, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:01:44,661 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 255 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:44,661 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 0 Invalid, 2390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:01:44,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2025-04-13 23:01:44,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 742. [2025-04-13 23:01:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.3724696356275303) internal successors, (2499), 741 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2499 transitions. [2025-04-13 23:01:44,670 INFO L79 Accepts]: Start accepts. Automaton has 742 states and 2499 transitions. Word has length 25 [2025-04-13 23:01:44,670 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:44,670 INFO L485 AbstractCegarLoop]: Abstraction has 742 states and 2499 transitions. [2025-04-13 23:01:44,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:44,671 INFO L278 IsEmpty]: Start isEmpty. Operand 742 states and 2499 transitions. [2025-04-13 23:01:44,672 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:44,672 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:44,672 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:44,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2025-04-13 23:01:44,872 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:44,872 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:44,872 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 543645228, now seen corresponding path program 15 times [2025-04-13 23:01:44,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:44,873 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839909411] [2025-04-13 23:01:44,873 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:01:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:44,876 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:44,879 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:01:44,879 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:01:44,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:45,184 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:45,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:45,184 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839909411] [2025-04-13 23:01:45,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839909411] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:01:45,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:01:45,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:01:45,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671978026] [2025-04-13 23:01:45,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:01:45,185 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:01:45,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:45,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:01:45,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:01:45,185 INFO L87 Difference]: Start difference. First operand 742 states and 2499 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:45,594 INFO L93 Difference]: Finished difference Result 862 states and 2886 transitions. [2025-04-13 23:01:45,594 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:01:45,594 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:45,594 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:45,596 INFO L225 Difference]: With dead ends: 862 [2025-04-13 23:01:45,596 INFO L226 Difference]: Without dead ends: 856 [2025-04-13 23:01:45,597 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=474, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:01:45,597 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 93 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:45,597 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 0 Invalid, 764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:01:45,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2025-04-13 23:01:45,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 742. [2025-04-13 23:01:45,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 741 states have (on average 3.3724696356275303) internal successors, (2499), 741 states have internal predecessors, (2499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:45,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 2499 transitions. [2025-04-13 23:01:45,606 INFO L79 Accepts]: Start accepts. Automaton has 742 states and 2499 transitions. Word has length 25 [2025-04-13 23:01:45,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:45,607 INFO L485 AbstractCegarLoop]: Abstraction has 742 states and 2499 transitions. [2025-04-13 23:01:45,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:45,607 INFO L278 IsEmpty]: Start isEmpty. Operand 742 states and 2499 transitions. [2025-04-13 23:01:45,608 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:45,608 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:45,608 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:45,608 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-04-13 23:01:45,608 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:45,608 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:45,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2020292656, now seen corresponding path program 16 times [2025-04-13 23:01:45,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:45,608 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966325554] [2025-04-13 23:01:45,608 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:45,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:45,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:45,615 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:45,615 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:45,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:45,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:45,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:45,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966325554] [2025-04-13 23:01:45,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966325554] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:45,884 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355976240] [2025-04-13 23:01:45,884 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:01:45,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:45,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:45,886 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:45,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2025-04-13 23:01:45,931 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:45,944 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:45,944 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:01:45,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:45,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:01:45,945 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:46,362 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:46,362 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:01:46,422 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:46,422 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:47,151 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:47,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 305 treesize of output 161 [2025-04-13 23:01:47,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355976240] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:47,882 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 30 [2025-04-13 23:01:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84454292] [2025-04-13 23:01:47,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:47,882 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:01:47,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:47,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:01:47,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=883, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:01:47,883 INFO L87 Difference]: Start difference. First operand 742 states and 2499 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:52,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:52,384 INFO L93 Difference]: Finished difference Result 1092 states and 3480 transitions. [2025-04-13 23:01:52,384 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 23:01:52,385 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:52,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:52,387 INFO L225 Difference]: With dead ends: 1092 [2025-04-13 23:01:52,387 INFO L226 Difference]: Without dead ends: 1076 [2025-04-13 23:01:52,387 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2116 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=836, Invalid=6646, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 23:01:52,388 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 363 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3365 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 3365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:52,388 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 0 Invalid, 3424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 3365 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:01:52,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1076 states. [2025-04-13 23:01:52,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1076 to 806. [2025-04-13 23:01:52,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 3.3677018633540374) internal successors, (2711), 805 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:52,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2711 transitions. [2025-04-13 23:01:52,399 INFO L79 Accepts]: Start accepts. Automaton has 806 states and 2711 transitions. Word has length 25 [2025-04-13 23:01:52,399 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:52,399 INFO L485 AbstractCegarLoop]: Abstraction has 806 states and 2711 transitions. [2025-04-13 23:01:52,399 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:52,399 INFO L278 IsEmpty]: Start isEmpty. Operand 806 states and 2711 transitions. [2025-04-13 23:01:52,400 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:52,400 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:52,400 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:52,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2025-04-13 23:01:52,601 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:52,601 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:52,601 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:52,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1441696630, now seen corresponding path program 17 times [2025-04-13 23:01:52,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:52,601 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116116816] [2025-04-13 23:01:52,601 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:52,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:52,605 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:52,609 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:52,609 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:52,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:53,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:01:53,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:53,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116116816] [2025-04-13 23:01:53,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116116816] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:53,095 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804191659] [2025-04-13 23:01:53,095 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:01:53,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:53,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:53,096 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:53,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2025-04-13 23:01:53,142 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:53,155 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:53,155 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:01:53,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:53,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:01:53,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:53,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:53,526 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:01:53,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:53,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:54,092 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:54,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:01:54,943 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:54,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804191659] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:54,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:01:54,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 33 [2025-04-13 23:01:54,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682081521] [2025-04-13 23:01:54,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:01:54,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:01:54,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:54,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:01:54,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:01:54,944 INFO L87 Difference]: Start difference. First operand 806 states and 2711 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:01:55,579 INFO L93 Difference]: Finished difference Result 882 states and 2927 transitions. [2025-04-13 23:01:55,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:01:55,579 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:01:55,579 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:01:55,581 INFO L225 Difference]: With dead ends: 882 [2025-04-13 23:01:55,581 INFO L226 Difference]: Without dead ends: 876 [2025-04-13 23:01:55,581 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 479 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=240, Invalid=1482, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:01:55,581 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 45 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 740 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:01:55,582 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 0 Invalid, 740 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:01:55,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 876 states. [2025-04-13 23:01:55,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 876 to 806. [2025-04-13 23:01:55,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 805 states have (on average 3.3677018633540374) internal successors, (2711), 805 states have internal predecessors, (2711), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 2711 transitions. [2025-04-13 23:01:55,592 INFO L79 Accepts]: Start accepts. Automaton has 806 states and 2711 transitions. Word has length 25 [2025-04-13 23:01:55,592 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:01:55,592 INFO L485 AbstractCegarLoop]: Abstraction has 806 states and 2711 transitions. [2025-04-13 23:01:55,592 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:01:55,592 INFO L278 IsEmpty]: Start isEmpty. Operand 806 states and 2711 transitions. [2025-04-13 23:01:55,593 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:01:55,593 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:01:55,593 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:01:55,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2025-04-13 23:01:55,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable55 [2025-04-13 23:01:55,794 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:01:55,794 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:01:55,794 INFO L85 PathProgramCache]: Analyzing trace with hash 4076890, now seen corresponding path program 18 times [2025-04-13 23:01:55,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:01:55,794 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747714769] [2025-04-13 23:01:55,794 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:01:55,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:01:55,798 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:55,803 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:55,803 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:01:55,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:56,324 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:56,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:01:56,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747714769] [2025-04-13 23:01:56,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747714769] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:01:56,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135535037] [2025-04-13 23:01:56,324 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:01:56,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:01:56,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:01:56,326 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:01:56,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2025-04-13 23:01:56,378 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:01:56,393 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:01:56,394 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:01:56,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:01:56,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:01:56,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:01:56,871 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:56,872 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:01:57,089 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:01:57,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:01:57,756 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:01:57,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:01:57,999 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:01:57,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135535037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:01:57,999 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:01:57,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:01:57,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508393970] [2025-04-13 23:01:57,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:01:58,000 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:01:58,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:01:58,000 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:01:58,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1108, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:01:58,000 INFO L87 Difference]: Start difference. First operand 806 states and 2711 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:00,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:00,275 INFO L93 Difference]: Finished difference Result 981 states and 3204 transitions. [2025-04-13 23:02:00,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:02:00,275 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:00,275 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:00,277 INFO L225 Difference]: With dead ends: 981 [2025-04-13 23:02:00,277 INFO L226 Difference]: Without dead ends: 970 [2025-04-13 23:02:00,278 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1138 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=490, Invalid=3670, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:02:00,278 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 174 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:00,278 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 0 Invalid, 2236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:02:00,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2025-04-13 23:02:00,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 824. [2025-04-13 23:02:00,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 823 states have (on average 3.3633049817739975) internal successors, (2768), 823 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:00,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 2768 transitions. [2025-04-13 23:02:00,292 INFO L79 Accepts]: Start accepts. Automaton has 824 states and 2768 transitions. Word has length 25 [2025-04-13 23:02:00,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:00,292 INFO L485 AbstractCegarLoop]: Abstraction has 824 states and 2768 transitions. [2025-04-13 23:02:00,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:00,292 INFO L278 IsEmpty]: Start isEmpty. Operand 824 states and 2768 transitions. [2025-04-13 23:02:00,293 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:00,293 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:00,293 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:00,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2025-04-13 23:02:00,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:00,494 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:00,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:00,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1794695614, now seen corresponding path program 19 times [2025-04-13 23:02:00,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:00,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100979498] [2025-04-13 23:02:00,494 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:02:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:00,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:02:00,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:00,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:02:00,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:00,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:00,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:00,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100979498] [2025-04-13 23:02:00,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100979498] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:00,931 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1611295567] [2025-04-13 23:02:00,931 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:02:00,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:00,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:00,932 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:00,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2025-04-13 23:02:00,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:02:00,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:00,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:02:00,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:00,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:02:00,994 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:01,452 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:01,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:02:01,502 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:01,502 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:01,975 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:01,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:02:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:02,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1611295567] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:02,854 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:02,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:02:02,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934024277] [2025-04-13 23:02:02,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:02,855 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:02:02,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:02,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:02:02,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=984, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:02:02,855 INFO L87 Difference]: Start difference. First operand 824 states and 2768 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:06,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:06,374 INFO L93 Difference]: Finished difference Result 1262 states and 4110 transitions. [2025-04-13 23:02:06,374 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 23:02:06,374 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:06,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:06,377 INFO L225 Difference]: With dead ends: 1262 [2025-04-13 23:02:06,377 INFO L226 Difference]: Without dead ends: 1246 [2025-04-13 23:02:06,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1840 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=735, Invalid=6405, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 23:02:06,378 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 312 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3058 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 3058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:06,378 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 0 Invalid, 3127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 3058 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:02:06,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2025-04-13 23:02:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 860. [2025-04-13 23:02:06,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 860 states, 859 states have (on average 3.3853317811408616) internal successors, (2908), 859 states have internal predecessors, (2908), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:06,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 2908 transitions. [2025-04-13 23:02:06,390 INFO L79 Accepts]: Start accepts. Automaton has 860 states and 2908 transitions. Word has length 25 [2025-04-13 23:02:06,390 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:06,390 INFO L485 AbstractCegarLoop]: Abstraction has 860 states and 2908 transitions. [2025-04-13 23:02:06,390 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:06,391 INFO L278 IsEmpty]: Start isEmpty. Operand 860 states and 2908 transitions. [2025-04-13 23:02:06,392 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:06,392 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:06,392 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:06,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2025-04-13 23:02:06,592 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:06,592 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:06,593 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:06,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1074260042, now seen corresponding path program 20 times [2025-04-13 23:02:06,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:06,593 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753048953] [2025-04-13 23:02:06,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:06,596 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:06,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:06,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:06,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:07,042 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:07,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:07,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753048953] [2025-04-13 23:02:07,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753048953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:07,043 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114674928] [2025-04-13 23:02:07,043 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:07,045 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:07,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2025-04-13 23:02:07,095 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:07,108 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:07,108 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:07,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:07,108 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:02:07,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:07,595 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:07,595 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:02:07,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:07,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:08,487 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:08,487 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:02:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:08,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114674928] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:08,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:08,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:02:08,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403644839] [2025-04-13 23:02:08,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:08,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:02:08,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:08,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:02:08,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1105, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:02:08,760 INFO L87 Difference]: Start difference. First operand 860 states and 2908 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:11,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:11,545 INFO L93 Difference]: Finished difference Result 1071 states and 3515 transitions. [2025-04-13 23:02:11,545 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 23:02:11,546 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:11,546 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:11,548 INFO L225 Difference]: With dead ends: 1071 [2025-04-13 23:02:11,548 INFO L226 Difference]: Without dead ends: 1060 [2025-04-13 23:02:11,548 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=574, Invalid=4396, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 23:02:11,549 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 205 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2178 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 2178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:11,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 0 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 2178 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:02:11,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2025-04-13 23:02:11,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 862. [2025-04-13 23:02:11,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 861 states have (on average 3.3855981416957026) internal successors, (2915), 861 states have internal predecessors, (2915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:11,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 2915 transitions. [2025-04-13 23:02:11,559 INFO L79 Accepts]: Start accepts. Automaton has 862 states and 2915 transitions. Word has length 25 [2025-04-13 23:02:11,560 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:11,560 INFO L485 AbstractCegarLoop]: Abstraction has 862 states and 2915 transitions. [2025-04-13 23:02:11,560 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:11,560 INFO L278 IsEmpty]: Start isEmpty. Operand 862 states and 2915 transitions. [2025-04-13 23:02:11,561 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:11,561 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:11,561 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:11,567 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2025-04-13 23:02:11,761 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2025-04-13 23:02:11,762 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:11,762 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:11,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1342067328, now seen corresponding path program 21 times [2025-04-13 23:02:11,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:11,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526690328] [2025-04-13 23:02:11,762 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:11,767 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:11,777 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:11,777 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:02:11,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:12,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:12,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526690328] [2025-04-13 23:02:12,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526690328] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:12,140 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54257195] [2025-04-13 23:02:12,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:12,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:12,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:12,142 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:12,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2025-04-13 23:02:12,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:12,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:12,203 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:02:12,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:12,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:02:12,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:12,577 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:12,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:02:12,793 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:12,793 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:13,300 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:13,301 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:02:13,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:13,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54257195] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:13,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:13,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:02:13,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968926502] [2025-04-13 23:02:13,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:13,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:02:13,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:13,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:02:13,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=971, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:02:13,614 INFO L87 Difference]: Start difference. First operand 862 states and 2915 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:17,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:17,767 INFO L93 Difference]: Finished difference Result 1447 states and 4899 transitions. [2025-04-13 23:02:17,767 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:02:17,767 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:17,767 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:17,770 INFO L225 Difference]: With dead ends: 1447 [2025-04-13 23:02:17,770 INFO L226 Difference]: Without dead ends: 1436 [2025-04-13 23:02:17,771 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2565 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1455, Invalid=6917, Unknown=0, NotChecked=0, Total=8372 [2025-04-13 23:02:17,771 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 289 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2452 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2570 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 2452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:17,771 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 0 Invalid, 2570 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 2452 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:02:17,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2025-04-13 23:02:17,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 896. [2025-04-13 23:02:17,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 3.3966480446927374) internal successors, (3040), 895 states have internal predecessors, (3040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:17,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3040 transitions. [2025-04-13 23:02:17,784 INFO L79 Accepts]: Start accepts. Automaton has 896 states and 3040 transitions. Word has length 25 [2025-04-13 23:02:17,784 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:17,784 INFO L485 AbstractCegarLoop]: Abstraction has 896 states and 3040 transitions. [2025-04-13 23:02:17,784 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:17,784 INFO L278 IsEmpty]: Start isEmpty. Operand 896 states and 3040 transitions. [2025-04-13 23:02:17,785 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:17,785 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:17,785 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:17,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Ended with exit code 0 [2025-04-13 23:02:17,985 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2025-04-13 23:02:17,986 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:17,986 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:17,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1420755426, now seen corresponding path program 22 times [2025-04-13 23:02:17,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:17,986 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340029294] [2025-04-13 23:02:17,986 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:17,990 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:17,993 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:17,993 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:17,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:18,392 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:18,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:18,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340029294] [2025-04-13 23:02:18,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340029294] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:18,392 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727996274] [2025-04-13 23:02:18,392 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:18,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:18,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:18,395 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:18,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2025-04-13 23:02:18,448 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:18,464 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:18,464 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:18,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:18,465 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:02:18,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:18,912 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:18,912 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:02:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:18,977 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:19,669 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:19,670 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:02:20,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:20,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727996274] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:20,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:20,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:02:20,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469771714] [2025-04-13 23:02:20,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:20,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:02:20,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:20,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:02:20,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:02:20,488 INFO L87 Difference]: Start difference. First operand 896 states and 3040 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:24,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:24,174 INFO L93 Difference]: Finished difference Result 1227 states and 4046 transitions. [2025-04-13 23:02:24,175 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 23:02:24,175 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:24,175 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:24,177 INFO L225 Difference]: With dead ends: 1227 [2025-04-13 23:02:24,177 INFO L226 Difference]: Without dead ends: 1216 [2025-04-13 23:02:24,178 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1855 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=777, Invalid=6029, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 23:02:24,178 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 314 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 314 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:24,178 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [314 Valid, 0 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:02:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2025-04-13 23:02:24,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 896. [2025-04-13 23:02:24,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 3.3966480446927374) internal successors, (3040), 895 states have internal predecessors, (3040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3040 transitions. [2025-04-13 23:02:24,189 INFO L79 Accepts]: Start accepts. Automaton has 896 states and 3040 transitions. Word has length 25 [2025-04-13 23:02:24,189 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:24,189 INFO L485 AbstractCegarLoop]: Abstraction has 896 states and 3040 transitions. [2025-04-13 23:02:24,189 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:24,189 INFO L278 IsEmpty]: Start isEmpty. Operand 896 states and 3040 transitions. [2025-04-13 23:02:24,191 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:24,191 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:24,191 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:24,197 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2025-04-13 23:02:24,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:24,395 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:24,395 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:24,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1189044476, now seen corresponding path program 23 times [2025-04-13 23:02:24,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:24,395 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206442858] [2025-04-13 23:02:24,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:24,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:24,399 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:24,403 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:24,403 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:24,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:25,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:02:25,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:25,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206442858] [2025-04-13 23:02:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206442858] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:25,020 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759083108] [2025-04-13 23:02:25,020 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:25,020 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:25,020 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:25,021 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:25,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2025-04-13 23:02:25,071 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:25,083 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:25,083 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:25,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:25,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:02:25,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:25,513 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:25,513 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:02:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:25,569 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:26,076 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:26,076 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:02:26,940 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:26,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [759083108] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:26,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:26,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 30 [2025-04-13 23:02:26,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548006117] [2025-04-13 23:02:26,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:26,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:02:26,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:26,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:02:26,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:02:26,941 INFO L87 Difference]: Start difference. First operand 896 states and 3040 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:30,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:30,228 INFO L93 Difference]: Finished difference Result 1312 states and 4348 transitions. [2025-04-13 23:02:30,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 23:02:30,229 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:30,229 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:30,231 INFO L225 Difference]: With dead ends: 1312 [2025-04-13 23:02:30,231 INFO L226 Difference]: Without dead ends: 1301 [2025-04-13 23:02:30,232 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1411 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=595, Invalid=4955, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:02:30,232 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 219 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2957 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:30,232 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 0 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2957 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:02:30,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1301 states. [2025-04-13 23:02:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1301 to 896. [2025-04-13 23:02:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 896 states, 895 states have (on average 3.3966480446927374) internal successors, (3040), 895 states have internal predecessors, (3040), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:30,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 896 states to 896 states and 3040 transitions. [2025-04-13 23:02:30,244 INFO L79 Accepts]: Start accepts. Automaton has 896 states and 3040 transitions. Word has length 25 [2025-04-13 23:02:30,244 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:30,244 INFO L485 AbstractCegarLoop]: Abstraction has 896 states and 3040 transitions. [2025-04-13 23:02:30,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 31 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:30,244 INFO L278 IsEmpty]: Start isEmpty. Operand 896 states and 3040 transitions. [2025-04-13 23:02:30,246 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:30,246 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:30,246 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:30,252 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Ended with exit code 0 [2025-04-13 23:02:30,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:30,446 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:30,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:30,446 INFO L85 PathProgramCache]: Analyzing trace with hash 951125022, now seen corresponding path program 24 times [2025-04-13 23:02:30,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:30,447 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509983574] [2025-04-13 23:02:30,447 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:02:30,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:30,450 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:30,455 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:30,455 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:02:30,455 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:30,821 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:30,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:30,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509983574] [2025-04-13 23:02:30,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509983574] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:30,821 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [439226101] [2025-04-13 23:02:30,822 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:02:30,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:30,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:30,823 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:30,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2025-04-13 23:02:30,877 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:30,890 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:30,891 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:02:30,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:30,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:02:30,892 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:31,347 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:31,347 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:02:31,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:31,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:32,275 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:32,275 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:02:32,505 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:32,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [439226101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:32,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:32,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:02:32,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401187504] [2025-04-13 23:02:32,505 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:32,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:02:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:32,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:02:32,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:02:32,506 INFO L87 Difference]: Start difference. First operand 896 states and 3040 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:35,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:35,659 INFO L93 Difference]: Finished difference Result 1101 states and 3678 transitions. [2025-04-13 23:02:35,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2025-04-13 23:02:35,660 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:35,660 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:35,662 INFO L225 Difference]: With dead ends: 1101 [2025-04-13 23:02:35,662 INFO L226 Difference]: Without dead ends: 1090 [2025-04-13 23:02:35,663 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1456 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=616, Invalid=4496, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:02:35,663 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2283 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 2283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:35,663 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 2337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 2283 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:02:35,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2025-04-13 23:02:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 904. [2025-04-13 23:02:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.395348837209302) internal successors, (3066), 903 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3066 transitions. [2025-04-13 23:02:35,674 INFO L79 Accepts]: Start accepts. Automaton has 904 states and 3066 transitions. Word has length 25 [2025-04-13 23:02:35,674 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:35,674 INFO L485 AbstractCegarLoop]: Abstraction has 904 states and 3066 transitions. [2025-04-13 23:02:35,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:35,674 INFO L278 IsEmpty]: Start isEmpty. Operand 904 states and 3066 transitions. [2025-04-13 23:02:35,675 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:35,675 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:35,675 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:35,681 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2025-04-13 23:02:35,875 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:35,876 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:35,876 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:35,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1048130108, now seen corresponding path program 25 times [2025-04-13 23:02:35,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:35,876 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900174142] [2025-04-13 23:02:35,876 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:02:35,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:35,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:02:35,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:35,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:02:35,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:36,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:36,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900174142] [2025-04-13 23:02:36,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900174142] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:36,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987964044] [2025-04-13 23:02:36,398 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:02:36,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:36,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:36,400 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:36,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2025-04-13 23:02:36,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:02:36,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:36,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:02:36,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:36,462 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:02:36,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:36,850 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:36,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:02:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:36,929 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:37,423 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:37,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:02:38,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:38,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987964044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:38,514 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:38,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:02:38,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383061409] [2025-04-13 23:02:38,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:38,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:02:38,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:38,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:02:38,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:02:38,514 INFO L87 Difference]: Start difference. First operand 904 states and 3066 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:41,583 INFO L93 Difference]: Finished difference Result 1085 states and 3593 transitions. [2025-04-13 23:02:41,583 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:02:41,583 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:41,583 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:41,585 INFO L225 Difference]: With dead ends: 1085 [2025-04-13 23:02:41,585 INFO L226 Difference]: Without dead ends: 1074 [2025-04-13 23:02:41,586 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=633, Invalid=4337, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 23:02:41,586 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1984 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1984 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:41,586 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 2021 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1984 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:02:41,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1074 states. [2025-04-13 23:02:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1074 to 904. [2025-04-13 23:02:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 903 states have (on average 3.395348837209302) internal successors, (3066), 903 states have internal predecessors, (3066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:41,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 3066 transitions. [2025-04-13 23:02:41,597 INFO L79 Accepts]: Start accepts. Automaton has 904 states and 3066 transitions. Word has length 25 [2025-04-13 23:02:41,597 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:41,597 INFO L485 AbstractCegarLoop]: Abstraction has 904 states and 3066 transitions. [2025-04-13 23:02:41,597 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:41,597 INFO L278 IsEmpty]: Start isEmpty. Operand 904 states and 3066 transitions. [2025-04-13 23:02:41,599 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:41,599 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:41,599 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:41,604 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2025-04-13 23:02:41,799 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable63 [2025-04-13 23:02:41,799 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:41,799 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:41,799 INFO L85 PathProgramCache]: Analyzing trace with hash 604629638, now seen corresponding path program 26 times [2025-04-13 23:02:41,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:41,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220847705] [2025-04-13 23:02:41,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:41,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:41,803 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:41,807 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:41,807 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:41,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:42,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:42,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220847705] [2025-04-13 23:02:42,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220847705] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:42,159 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [924063753] [2025-04-13 23:02:42,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:02:42,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:42,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:42,162 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:42,162 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2025-04-13 23:02:42,211 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:42,224 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:42,224 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:42,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:42,225 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:02:42,225 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:42,675 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:42,675 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:02:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:42,854 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:43,581 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:43,582 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:02:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:43,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [924063753] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:43,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:43,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:02:43,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540800404] [2025-04-13 23:02:43,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:43,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:02:43,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:43,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:02:43,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:02:43,863 INFO L87 Difference]: Start difference. First operand 904 states and 3066 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:47,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:47,917 INFO L93 Difference]: Finished difference Result 1161 states and 3839 transitions. [2025-04-13 23:02:47,918 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:02:47,918 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:47,918 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:47,920 INFO L225 Difference]: With dead ends: 1161 [2025-04-13 23:02:47,920 INFO L226 Difference]: Without dead ends: 1140 [2025-04-13 23:02:47,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1790 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=717, Invalid=5603, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 23:02:47,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3087 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 3087 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:47,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 3136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 3087 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:02:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2025-04-13 23:02:47,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 910. [2025-04-13 23:02:47,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 910 states, 909 states have (on average 3.398239823982398) internal successors, (3089), 909 states have internal predecessors, (3089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 910 states to 910 states and 3089 transitions. [2025-04-13 23:02:47,932 INFO L79 Accepts]: Start accepts. Automaton has 910 states and 3089 transitions. Word has length 25 [2025-04-13 23:02:47,932 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:47,932 INFO L485 AbstractCegarLoop]: Abstraction has 910 states and 3089 transitions. [2025-04-13 23:02:47,932 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:47,933 INFO L278 IsEmpty]: Start isEmpty. Operand 910 states and 3089 transitions. [2025-04-13 23:02:47,934 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:47,934 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:47,934 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:47,940 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Ended with exit code 0 [2025-04-13 23:02:48,134 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2025-04-13 23:02:48,134 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:48,135 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:48,135 INFO L85 PathProgramCache]: Analyzing trace with hash 131961758, now seen corresponding path program 27 times [2025-04-13 23:02:48,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:48,135 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190437945] [2025-04-13 23:02:48,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:02:48,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:48,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:48,142 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:02:48,142 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:02:48,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:48,479 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:48,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:48,480 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190437945] [2025-04-13 23:02:48,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190437945] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:02:48,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:02:48,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:02:48,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353775149] [2025-04-13 23:02:48,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:02:48,480 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:02:48,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:48,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:02:48,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:02:48,480 INFO L87 Difference]: Start difference. First operand 910 states and 3089 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:48,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:48,743 INFO L93 Difference]: Finished difference Result 990 states and 3349 transitions. [2025-04-13 23:02:48,743 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:02:48,743 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:48,743 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:48,745 INFO L225 Difference]: With dead ends: 990 [2025-04-13 23:02:48,745 INFO L226 Difference]: Without dead ends: 984 [2025-04-13 23:02:48,745 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:02:48,746 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 102 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:48,746 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 0 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:02:48,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 984 states. [2025-04-13 23:02:48,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 984 to 906. [2025-04-13 23:02:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 905 states have (on average 3.402209944751381) internal successors, (3079), 905 states have internal predecessors, (3079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:48,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 3079 transitions. [2025-04-13 23:02:48,756 INFO L79 Accepts]: Start accepts. Automaton has 906 states and 3079 transitions. Word has length 25 [2025-04-13 23:02:48,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:48,756 INFO L485 AbstractCegarLoop]: Abstraction has 906 states and 3079 transitions. [2025-04-13 23:02:48,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:48,756 INFO L278 IsEmpty]: Start isEmpty. Operand 906 states and 3079 transitions. [2025-04-13 23:02:48,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:48,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:48,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:48,758 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2025-04-13 23:02:48,758 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:48,758 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:48,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1675089242, now seen corresponding path program 28 times [2025-04-13 23:02:48,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:48,758 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533192308] [2025-04-13 23:02:48,758 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:48,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:48,762 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:48,765 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:48,765 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:48,765 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:48,978 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:48,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:48,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533192308] [2025-04-13 23:02:48,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533192308] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:48,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207653219] [2025-04-13 23:02:48,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:02:48,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:48,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:48,980 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:48,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2025-04-13 23:02:49,031 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:49,045 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:49,045 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:02:49,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:49,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:02:49,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:49,441 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:49,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:02:49,500 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:49,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:50,246 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:50,246 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:02:51,121 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207653219] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:02:51,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:02:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:02:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962759690] [2025-04-13 23:02:51,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:02:51,121 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:02:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:51,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:02:51,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:02:51,122 INFO L87 Difference]: Start difference. First operand 906 states and 3079 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:55,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:55,892 INFO L93 Difference]: Finished difference Result 1244 states and 4028 transitions. [2025-04-13 23:02:55,892 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 23:02:55,892 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:55,892 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:55,895 INFO L225 Difference]: With dead ends: 1244 [2025-04-13 23:02:55,895 INFO L226 Difference]: Without dead ends: 1233 [2025-04-13 23:02:55,896 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2297 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=903, Invalid=7107, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 23:02:55,896 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3305 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 3305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:55,896 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 3380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 3305 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:02:55,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2025-04-13 23:02:55,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 928. [2025-04-13 23:02:55,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 928 states, 927 states have (on average 3.4002157497303127) internal successors, (3152), 927 states have internal predecessors, (3152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:55,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 928 states to 928 states and 3152 transitions. [2025-04-13 23:02:55,910 INFO L79 Accepts]: Start accepts. Automaton has 928 states and 3152 transitions. Word has length 25 [2025-04-13 23:02:55,910 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:55,910 INFO L485 AbstractCegarLoop]: Abstraction has 928 states and 3152 transitions. [2025-04-13 23:02:55,910 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:55,910 INFO L278 IsEmpty]: Start isEmpty. Operand 928 states and 3152 transitions. [2025-04-13 23:02:55,912 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:55,912 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:55,912 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:55,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2025-04-13 23:02:56,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2025-04-13 23:02:56,112 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:56,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:56,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1536042448, now seen corresponding path program 29 times [2025-04-13 23:02:56,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:56,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097112479] [2025-04-13 23:02:56,113 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:56,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:56,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:56,120 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:56,120 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:56,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:56,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:02:56,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:02:56,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097112479] [2025-04-13 23:02:56,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097112479] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:56,810 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786706207] [2025-04-13 23:02:56,810 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:02:56,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:02:56,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:02:56,812 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:02:56,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2025-04-13 23:02:56,863 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:56,876 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:56,876 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:02:56,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:02:56,877 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:02:56,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:02:57,354 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:57,354 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:02:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:02:57,419 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:02:57,910 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:02:57,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:02:58,843 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:02:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786706207] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:02:58,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:02:58,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 33 [2025-04-13 23:02:58,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139449181] [2025-04-13 23:02:58,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:02:58,844 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:02:58,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:02:58,844 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:02:58,844 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:02:58,844 INFO L87 Difference]: Start difference. First operand 928 states and 3152 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:59,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:02:59,741 INFO L93 Difference]: Finished difference Result 1004 states and 3362 transitions. [2025-04-13 23:02:59,741 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:02:59,741 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:02:59,741 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:02:59,744 INFO L225 Difference]: With dead ends: 1004 [2025-04-13 23:02:59,744 INFO L226 Difference]: Without dead ends: 998 [2025-04-13 23:02:59,744 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=254, Invalid=1816, Unknown=0, NotChecked=0, Total=2070 [2025-04-13 23:02:59,744 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:02:59,744 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:02:59,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-04-13 23:02:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 930. [2025-04-13 23:02:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 930 states, 929 states have (on average 3.404736275565124) internal successors, (3163), 929 states have internal predecessors, (3163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 930 states to 930 states and 3163 transitions. [2025-04-13 23:02:59,755 INFO L79 Accepts]: Start accepts. Automaton has 930 states and 3163 transitions. Word has length 25 [2025-04-13 23:02:59,755 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:02:59,755 INFO L485 AbstractCegarLoop]: Abstraction has 930 states and 3163 transitions. [2025-04-13 23:02:59,755 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:02:59,755 INFO L278 IsEmpty]: Start isEmpty. Operand 930 states and 3163 transitions. [2025-04-13 23:02:59,756 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:02:59,757 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:02:59,757 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:02:59,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2025-04-13 23:02:59,957 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2025-04-13 23:02:59,957 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:02:59,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:02:59,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1550704546, now seen corresponding path program 30 times [2025-04-13 23:02:59,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:02:59,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607266189] [2025-04-13 23:02:59,958 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:02:59,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:02:59,961 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:02:59,965 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:02:59,965 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:02:59,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:00,324 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:00,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:00,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607266189] [2025-04-13 23:03:00,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607266189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:00,324 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652318720] [2025-04-13 23:03:00,324 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:00,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:00,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:00,326 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:00,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2025-04-13 23:03:00,379 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:00,392 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:00,392 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:03:00,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:00,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:03:00,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:00,843 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:00,844 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:03:01,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:01,024 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:01,812 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:01,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 127 [2025-04-13 23:03:02,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:02,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652318720] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:02,132 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:02,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:03:02,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670012992] [2025-04-13 23:03:02,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:02,132 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:03:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:02,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:03:02,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1086, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:03:02,133 INFO L87 Difference]: Start difference. First operand 930 states and 3163 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:08,266 INFO L93 Difference]: Finished difference Result 1281 states and 4384 transitions. [2025-04-13 23:03:08,266 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2025-04-13 23:03:08,266 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:08,266 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:08,269 INFO L225 Difference]: With dead ends: 1281 [2025-04-13 23:03:08,269 INFO L226 Difference]: Without dead ends: 1270 [2025-04-13 23:03:08,270 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2879 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1158, Invalid=7962, Unknown=0, NotChecked=0, Total=9120 [2025-04-13 23:03:08,270 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 222 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4139 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 4139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:08,270 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 0 Invalid, 4231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 4139 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 23:03:08,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-04-13 23:03:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 946. [2025-04-13 23:03:08,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 946 states, 945 states have (on average 3.4084656084656086) internal successors, (3221), 945 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:08,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 3221 transitions. [2025-04-13 23:03:08,292 INFO L79 Accepts]: Start accepts. Automaton has 946 states and 3221 transitions. Word has length 25 [2025-04-13 23:03:08,292 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:08,292 INFO L485 AbstractCegarLoop]: Abstraction has 946 states and 3221 transitions. [2025-04-13 23:03:08,292 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:08,292 INFO L278 IsEmpty]: Start isEmpty. Operand 946 states and 3221 transitions. [2025-04-13 23:03:08,294 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:08,294 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:08,294 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:08,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2025-04-13 23:03:08,494 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:08,494 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:08,495 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1362794756, now seen corresponding path program 31 times [2025-04-13 23:03:08,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:08,495 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364994739] [2025-04-13 23:03:08,495 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:08,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:08,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:08,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:08,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:08,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:09,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:09,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:09,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364994739] [2025-04-13 23:03:09,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364994739] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:09,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489977676] [2025-04-13 23:03:09,009 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:09,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:09,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:09,011 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:09,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2025-04-13 23:03:09,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:09,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:09,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:09,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:09,077 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:03:09,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:09,522 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:09,523 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:03:09,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:09,585 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:03:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489977676] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:09,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:03:09,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:03:09,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579956187] [2025-04-13 23:03:09,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:09,586 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:03:09,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:09,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:03:09,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:03:09,586 INFO L87 Difference]: Start difference. First operand 946 states and 3221 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:09,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:09,840 INFO L93 Difference]: Finished difference Result 1032 states and 3475 transitions. [2025-04-13 23:03:09,840 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:03:09,840 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:09,840 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:09,842 INFO L225 Difference]: With dead ends: 1032 [2025-04-13 23:03:09,842 INFO L226 Difference]: Without dead ends: 1026 [2025-04-13 23:03:09,843 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:03:09,843 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:09,843 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:03:09,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026 states. [2025-04-13 23:03:09,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026 to 950. [2025-04-13 23:03:09,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.4130663856691252) internal successors, (3239), 949 states have internal predecessors, (3239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:09,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3239 transitions. [2025-04-13 23:03:09,854 INFO L79 Accepts]: Start accepts. Automaton has 950 states and 3239 transitions. Word has length 25 [2025-04-13 23:03:09,854 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:09,854 INFO L485 AbstractCegarLoop]: Abstraction has 950 states and 3239 transitions. [2025-04-13 23:03:09,854 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:09,854 INFO L278 IsEmpty]: Start isEmpty. Operand 950 states and 3239 transitions. [2025-04-13 23:03:09,855 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:09,855 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:09,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:09,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2025-04-13 23:03:10,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable69 [2025-04-13 23:03:10,056 INFO L403 AbstractCegarLoop]: === Iteration 71 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:10,056 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:10,056 INFO L85 PathProgramCache]: Analyzing trace with hash 758920892, now seen corresponding path program 32 times [2025-04-13 23:03:10,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:10,056 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418606096] [2025-04-13 23:03:10,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:10,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:10,061 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:10,065 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:10,065 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:10,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:10,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:10,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:10,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418606096] [2025-04-13 23:03:10,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418606096] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:10,377 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433381898] [2025-04-13 23:03:10,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:10,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:10,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:10,379 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:10,379 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2025-04-13 23:03:10,431 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:10,444 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:10,444 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:10,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:10,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:03:10,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:10,800 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:10,800 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:03:11,103 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:11,103 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:11,877 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:11,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 127 [2025-04-13 23:03:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:12,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433381898] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:12,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:12,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:03:12,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977542327] [2025-04-13 23:03:12,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:12,129 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:03:12,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:12,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:03:12,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:03:12,129 INFO L87 Difference]: Start difference. First operand 950 states and 3239 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:17,864 INFO L93 Difference]: Finished difference Result 1294 states and 4455 transitions. [2025-04-13 23:03:17,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 23:03:17,864 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:17,864 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:17,867 INFO L225 Difference]: With dead ends: 1294 [2025-04-13 23:03:17,867 INFO L226 Difference]: Without dead ends: 1283 [2025-04-13 23:03:17,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2575 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1101, Invalid=7089, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:03:17,867 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3061 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:17,868 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 3155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3061 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:03:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2025-04-13 23:03:17,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 950. [2025-04-13 23:03:17,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.4151738672286616) internal successors, (3241), 949 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3241 transitions. [2025-04-13 23:03:17,880 INFO L79 Accepts]: Start accepts. Automaton has 950 states and 3241 transitions. Word has length 25 [2025-04-13 23:03:17,880 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:17,880 INFO L485 AbstractCegarLoop]: Abstraction has 950 states and 3241 transitions. [2025-04-13 23:03:17,880 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:17,880 INFO L278 IsEmpty]: Start isEmpty. Operand 950 states and 3241 transitions. [2025-04-13 23:03:17,881 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:17,881 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:17,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:17,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2025-04-13 23:03:18,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable70,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:18,082 INFO L403 AbstractCegarLoop]: === Iteration 72 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:18,082 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:18,082 INFO L85 PathProgramCache]: Analyzing trace with hash -372793684, now seen corresponding path program 33 times [2025-04-13 23:03:18,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:18,082 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077312698] [2025-04-13 23:03:18,082 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:18,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:18,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:18,089 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:03:18,089 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:03:18,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:18,489 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:18,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:18,490 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077312698] [2025-04-13 23:03:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077312698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:03:18,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:03:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:03:18,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61870017] [2025-04-13 23:03:18,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:03:18,490 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:03:18,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:18,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:03:18,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:03:18,490 INFO L87 Difference]: Start difference. First operand 950 states and 3241 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:18,835 INFO L93 Difference]: Finished difference Result 1038 states and 3526 transitions. [2025-04-13 23:03:18,835 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:03:18,835 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:18,835 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:18,837 INFO L225 Difference]: With dead ends: 1038 [2025-04-13 23:03:18,838 INFO L226 Difference]: Without dead ends: 1032 [2025-04-13 23:03:18,838 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=353, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:03:18,838 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:18,838 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 663 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:03:18,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2025-04-13 23:03:18,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 954. [2025-04-13 23:03:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 953 states have (on average 3.4239244491080796) internal successors, (3263), 953 states have internal predecessors, (3263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 3263 transitions. [2025-04-13 23:03:18,849 INFO L79 Accepts]: Start accepts. Automaton has 954 states and 3263 transitions. Word has length 25 [2025-04-13 23:03:18,849 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:18,849 INFO L485 AbstractCegarLoop]: Abstraction has 954 states and 3263 transitions. [2025-04-13 23:03:18,849 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:18,849 INFO L278 IsEmpty]: Start isEmpty. Operand 954 states and 3263 transitions. [2025-04-13 23:03:18,851 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:18,851 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:18,851 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:18,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable71 [2025-04-13 23:03:18,851 INFO L403 AbstractCegarLoop]: === Iteration 73 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:18,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:18,851 INFO L85 PathProgramCache]: Analyzing trace with hash 1064571034, now seen corresponding path program 34 times [2025-04-13 23:03:18,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:18,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085795339] [2025-04-13 23:03:18,851 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:18,855 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:18,858 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:18,858 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:18,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:19,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:19,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:19,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085795339] [2025-04-13 23:03:19,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085795339] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:19,098 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1933155765] [2025-04-13 23:03:19,098 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:03:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:19,100 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:19,100 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2025-04-13 23:03:19,153 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:19,166 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:19,166 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:03:19,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:19,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:03:19,167 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:19,510 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:19,511 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:03:19,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:19,585 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:20,344 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:20,345 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:03:21,072 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:21,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1933155765] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:21,072 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:21,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:03:21,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780746117] [2025-04-13 23:03:21,072 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:21,072 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:03:21,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:21,073 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:03:21,073 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=926, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:03:21,073 INFO L87 Difference]: Start difference. First operand 954 states and 3263 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:25,050 INFO L93 Difference]: Finished difference Result 1109 states and 3704 transitions. [2025-04-13 23:03:25,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 23:03:25,050 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:25,050 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:25,053 INFO L225 Difference]: With dead ends: 1109 [2025-04-13 23:03:25,053 INFO L226 Difference]: Without dead ends: 1098 [2025-04-13 23:03:25,053 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=634, Invalid=4478, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:03:25,053 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 223 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2473 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2555 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:25,054 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 0 Invalid, 2555 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2473 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:03:25,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1098 states. [2025-04-13 23:03:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1098 to 966. [2025-04-13 23:03:25,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 965 states have (on average 3.4290155440414507) internal successors, (3309), 965 states have internal predecessors, (3309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 3309 transitions. [2025-04-13 23:03:25,065 INFO L79 Accepts]: Start accepts. Automaton has 966 states and 3309 transitions. Word has length 25 [2025-04-13 23:03:25,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:25,065 INFO L485 AbstractCegarLoop]: Abstraction has 966 states and 3309 transitions. [2025-04-13 23:03:25,065 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:25,065 INFO L278 IsEmpty]: Start isEmpty. Operand 966 states and 3309 transitions. [2025-04-13 23:03:25,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:25,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:25,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:25,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2025-04-13 23:03:25,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable72 [2025-04-13 23:03:25,267 INFO L403 AbstractCegarLoop]: === Iteration 74 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:25,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:25,268 INFO L85 PathProgramCache]: Analyzing trace with hash -2045944294, now seen corresponding path program 35 times [2025-04-13 23:03:25,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:25,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20036540] [2025-04-13 23:03:25,268 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:25,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:25,271 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:25,276 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:25,276 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:25,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:25,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:25,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:25,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20036540] [2025-04-13 23:03:25,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20036540] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:25,727 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725795326] [2025-04-13 23:03:25,727 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:03:25,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:25,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:25,729 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:25,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2025-04-13 23:03:25,782 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:25,796 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:25,796 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:25,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:25,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:03:25,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:26,137 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 23:03:26,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 91 [2025-04-13 23:03:26,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:26,320 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:26,801 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:26,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:03:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:27,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725795326] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:27,759 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:27,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:03:27,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705195004] [2025-04-13 23:03:27,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:27,759 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:03:27,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:27,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:03:27,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=867, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:03:27,760 INFO L87 Difference]: Start difference. First operand 966 states and 3309 transitions. Second operand has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:31,049 INFO L93 Difference]: Finished difference Result 1411 states and 4726 transitions. [2025-04-13 23:03:31,049 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:03:31,049 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:31,049 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:31,052 INFO L225 Difference]: With dead ends: 1411 [2025-04-13 23:03:31,052 INFO L226 Difference]: Without dead ends: 1400 [2025-04-13 23:03:31,052 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1878 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=877, Invalid=5443, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 23:03:31,053 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:31,053 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 2303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:03:31,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2025-04-13 23:03:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 976. [2025-04-13 23:03:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 975 states have (on average 3.4461538461538463) internal successors, (3360), 975 states have internal predecessors, (3360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 3360 transitions. [2025-04-13 23:03:31,065 INFO L79 Accepts]: Start accepts. Automaton has 976 states and 3360 transitions. Word has length 25 [2025-04-13 23:03:31,065 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:31,065 INFO L485 AbstractCegarLoop]: Abstraction has 976 states and 3360 transitions. [2025-04-13 23:03:31,066 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.125) internal successors, (68), 32 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:31,066 INFO L278 IsEmpty]: Start isEmpty. Operand 976 states and 3360 transitions. [2025-04-13 23:03:31,067 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:31,067 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:31,067 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:31,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Ended with exit code 0 [2025-04-13 23:03:31,267 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable73,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:31,267 INFO L403 AbstractCegarLoop]: === Iteration 75 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:31,268 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:31,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1448739400, now seen corresponding path program 36 times [2025-04-13 23:03:31,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:31,268 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682178908] [2025-04-13 23:03:31,268 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:31,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:31,271 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:31,275 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:31,275 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:03:31,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:31,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:31,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:31,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682178908] [2025-04-13 23:03:31,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682178908] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:31,630 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270538959] [2025-04-13 23:03:31,630 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:03:31,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:31,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:31,631 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:31,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2025-04-13 23:03:31,686 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:31,699 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:31,699 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:03:31,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:31,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:03:31,700 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:32,184 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:32,184 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:03:32,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:32,371 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:33,079 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:33,079 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:03:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:33,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270538959] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:33,345 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:33,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:03:33,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108160121] [2025-04-13 23:03:33,345 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:33,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:03:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:33,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:03:33,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:03:33,346 INFO L87 Difference]: Start difference. First operand 976 states and 3360 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:38,620 INFO L93 Difference]: Finished difference Result 1338 states and 4460 transitions. [2025-04-13 23:03:38,620 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:03:38,621 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:38,621 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:38,623 INFO L225 Difference]: With dead ends: 1338 [2025-04-13 23:03:38,623 INFO L226 Difference]: Without dead ends: 1322 [2025-04-13 23:03:38,624 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2385 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=974, Invalid=6682, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 23:03:38,624 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 383 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:38,624 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 0 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:03:38,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2025-04-13 23:03:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 994. [2025-04-13 23:03:38,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.4612286002014097) internal successors, (3437), 993 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:38,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3437 transitions. [2025-04-13 23:03:38,637 INFO L79 Accepts]: Start accepts. Automaton has 994 states and 3437 transitions. Word has length 25 [2025-04-13 23:03:38,637 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:38,637 INFO L485 AbstractCegarLoop]: Abstraction has 994 states and 3437 transitions. [2025-04-13 23:03:38,637 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:38,637 INFO L278 IsEmpty]: Start isEmpty. Operand 994 states and 3437 transitions. [2025-04-13 23:03:38,638 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:38,638 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:38,638 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:38,644 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2025-04-13 23:03:38,838 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable74,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:38,839 INFO L403 AbstractCegarLoop]: === Iteration 76 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:38,839 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:38,839 INFO L85 PathProgramCache]: Analyzing trace with hash 121619800, now seen corresponding path program 37 times [2025-04-13 23:03:38,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:38,839 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205304508] [2025-04-13 23:03:38,839 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:38,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:38,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:38,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:38,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:38,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:39,364 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:39,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:39,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205304508] [2025-04-13 23:03:39,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205304508] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:39,364 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1358158972] [2025-04-13 23:03:39,364 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:03:39,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:39,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:39,366 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:39,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2025-04-13 23:03:39,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:03:39,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:39,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:03:39,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:39,434 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:03:39,434 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:39,821 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:39,821 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:03:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:39,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:40,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:40,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:03:41,555 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:41,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1358158972] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:41,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:41,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:03:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22893599] [2025-04-13 23:03:41,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:41,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:03:41,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:41,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:03:41,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:03:41,556 INFO L87 Difference]: Start difference. First operand 994 states and 3437 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:45,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:45,790 INFO L93 Difference]: Finished difference Result 1263 states and 4195 transitions. [2025-04-13 23:03:45,790 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:03:45,790 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:45,790 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:45,793 INFO L225 Difference]: With dead ends: 1263 [2025-04-13 23:03:45,793 INFO L226 Difference]: Without dead ends: 1252 [2025-04-13 23:03:45,794 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1473 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=672, Invalid=5334, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 23:03:45,794 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2644 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 2644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:45,794 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 2700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 2644 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:03:45,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-04-13 23:03:45,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 996. [2025-04-13 23:03:45,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 996 states, 995 states have (on average 3.4552763819095476) internal successors, (3438), 995 states have internal predecessors, (3438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 996 states to 996 states and 3438 transitions. [2025-04-13 23:03:45,807 INFO L79 Accepts]: Start accepts. Automaton has 996 states and 3438 transitions. Word has length 25 [2025-04-13 23:03:45,807 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:45,807 INFO L485 AbstractCegarLoop]: Abstraction has 996 states and 3438 transitions. [2025-04-13 23:03:45,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:45,807 INFO L278 IsEmpty]: Start isEmpty. Operand 996 states and 3438 transitions. [2025-04-13 23:03:45,809 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:45,809 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:45,809 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:45,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Ended with exit code 0 [2025-04-13 23:03:46,009 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable75,49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:46,010 INFO L403 AbstractCegarLoop]: === Iteration 77 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:46,010 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:46,010 INFO L85 PathProgramCache]: Analyzing trace with hash 802639236, now seen corresponding path program 38 times [2025-04-13 23:03:46,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:46,010 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071086301] [2025-04-13 23:03:46,010 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:46,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:46,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:46,018 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:46,018 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:46,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:46,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:46,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071086301] [2025-04-13 23:03:46,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071086301] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:46,320 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200111682] [2025-04-13 23:03:46,320 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:03:46,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:46,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:46,322 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:46,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2025-04-13 23:03:46,377 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:46,391 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:46,392 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:03:46,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:46,392 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:03:46,393 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:46,773 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:46,774 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:03:47,036 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:47,037 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:47,776 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:47,776 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 127 [2025-04-13 23:03:48,045 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:48,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200111682] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:48,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:48,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:03:48,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767628539] [2025-04-13 23:03:48,046 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:48,046 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:03:48,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:48,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:03:48,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:03:48,046 INFO L87 Difference]: Start difference. First operand 996 states and 3438 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:54,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:03:54,027 INFO L93 Difference]: Finished difference Result 1454 states and 4814 transitions. [2025-04-13 23:03:54,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2025-04-13 23:03:54,027 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:03:54,027 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:03:54,030 INFO L225 Difference]: With dead ends: 1454 [2025-04-13 23:03:54,030 INFO L226 Difference]: Without dead ends: 1443 [2025-04-13 23:03:54,031 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1199, Invalid=8503, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 23:03:54,031 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 433 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2475 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 433 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 2475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:03:54,031 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [433 Valid, 0 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 2475 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:03:54,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2025-04-13 23:03:54,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 1016. [2025-04-13 23:03:54,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1016 states, 1015 states have (on average 3.4679802955665027) internal successors, (3520), 1015 states have internal predecessors, (3520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:54,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1016 states to 1016 states and 3520 transitions. [2025-04-13 23:03:54,045 INFO L79 Accepts]: Start accepts. Automaton has 1016 states and 3520 transitions. Word has length 25 [2025-04-13 23:03:54,045 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:03:54,045 INFO L485 AbstractCegarLoop]: Abstraction has 1016 states and 3520 transitions. [2025-04-13 23:03:54,045 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:03:54,045 INFO L278 IsEmpty]: Start isEmpty. Operand 1016 states and 3520 transitions. [2025-04-13 23:03:54,046 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:03:54,046 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:03:54,046 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:03:54,052 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Ended with exit code 0 [2025-04-13 23:03:54,246 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable76 [2025-04-13 23:03:54,247 INFO L403 AbstractCegarLoop]: === Iteration 78 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:03:54,247 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:03:54,247 INFO L85 PathProgramCache]: Analyzing trace with hash 275911054, now seen corresponding path program 39 times [2025-04-13 23:03:54,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:03:54,247 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721694230] [2025-04-13 23:03:54,247 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:54,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:03:54,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:54,258 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:54,258 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:54,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:54,664 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:03:54,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:03:54,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721694230] [2025-04-13 23:03:54,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721694230] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:03:54,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902926461] [2025-04-13 23:03:54,665 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:03:54,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:03:54,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:03:54,666 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:03:54,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2025-04-13 23:03:54,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:03:54,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:03:54,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:03:54,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:03:54,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:03:54,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:03:55,090 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:55,091 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:03:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:03:55,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:03:56,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:03:56,096 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:03:56,401 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:03:56,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [902926461] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:03:56,401 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:03:56,401 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 11] total 34 [2025-04-13 23:03:56,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938230793] [2025-04-13 23:03:56,401 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:03:56,401 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:03:56,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:03:56,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:03:56,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1051, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:03:56,402 INFO L87 Difference]: Start difference. First operand 1016 states and 3520 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:02,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:02,182 INFO L93 Difference]: Finished difference Result 1460 states and 5093 transitions. [2025-04-13 23:04:02,182 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 23:04:02,182 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:02,182 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:02,185 INFO L225 Difference]: With dead ends: 1460 [2025-04-13 23:04:02,185 INFO L226 Difference]: Without dead ends: 1449 [2025-04-13 23:04:02,186 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1512, Invalid=8790, Unknown=0, NotChecked=0, Total=10302 [2025-04-13 23:04:02,186 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 287 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:02,186 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 0 Invalid, 2306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:04:02,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2025-04-13 23:04:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 1038. [2025-04-13 23:04:02,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1038 states, 1037 states have (on average 3.46480231436837) internal successors, (3593), 1037 states have internal predecessors, (3593), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:02,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1038 states to 1038 states and 3593 transitions. [2025-04-13 23:04:02,199 INFO L79 Accepts]: Start accepts. Automaton has 1038 states and 3593 transitions. Word has length 25 [2025-04-13 23:04:02,199 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:02,199 INFO L485 AbstractCegarLoop]: Abstraction has 1038 states and 3593 transitions. [2025-04-13 23:04:02,199 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:02,199 INFO L278 IsEmpty]: Start isEmpty. Operand 1038 states and 3593 transitions. [2025-04-13 23:04:02,201 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:02,201 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:02,201 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:02,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Ended with exit code 0 [2025-04-13 23:04:02,401 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable77 [2025-04-13 23:04:02,401 INFO L403 AbstractCegarLoop]: === Iteration 79 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:02,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:02,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1954606204, now seen corresponding path program 40 times [2025-04-13 23:04:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:02,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341544965] [2025-04-13 23:04:02,402 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:02,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:02,406 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:02,409 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:02,409 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:02,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:02,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:02,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:02,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341544965] [2025-04-13 23:04:02,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341544965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:02,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:02,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-04-13 23:04:02,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501000485] [2025-04-13 23:04:02,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:02,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:04:02,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:02,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:04:02,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:04:02,672 INFO L87 Difference]: Start difference. First operand 1038 states and 3593 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:03,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:03,054 INFO L93 Difference]: Finished difference Result 1193 states and 4078 transitions. [2025-04-13 23:04:03,054 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:04:03,054 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:03,054 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:03,057 INFO L225 Difference]: With dead ends: 1193 [2025-04-13 23:04:03,057 INFO L226 Difference]: Without dead ends: 1187 [2025-04-13 23:04:03,057 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:04:03,057 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:03,058 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:03,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-04-13 23:04:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 1034. [2025-04-13 23:04:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1034 states, 1033 states have (on average 3.456921587608906) internal successors, (3571), 1033 states have internal predecessors, (3571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1034 states to 1034 states and 3571 transitions. [2025-04-13 23:04:03,071 INFO L79 Accepts]: Start accepts. Automaton has 1034 states and 3571 transitions. Word has length 25 [2025-04-13 23:04:03,071 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:03,071 INFO L485 AbstractCegarLoop]: Abstraction has 1034 states and 3571 transitions. [2025-04-13 23:04:03,071 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:03,071 INFO L278 IsEmpty]: Start isEmpty. Operand 1034 states and 3571 transitions. [2025-04-13 23:04:03,072 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:03,072 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:03,072 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:03,072 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable78 [2025-04-13 23:04:03,072 INFO L403 AbstractCegarLoop]: === Iteration 80 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:03,073 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash 581561196, now seen corresponding path program 41 times [2025-04-13 23:04:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:03,073 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336065275] [2025-04-13 23:04:03,073 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:03,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:03,077 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:03,081 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:03,081 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:03,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:03,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:03,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:03,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336065275] [2025-04-13 23:04:03,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336065275] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:03,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2045120751] [2025-04-13 23:04:03,568 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:03,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:03,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:03,569 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:03,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2025-04-13 23:04:03,625 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:03,638 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:03,638 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:03,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:03,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:04:03,639 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:03,935 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:03,936 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:04:03,993 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:03,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:04,704 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:04,704 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 365 treesize of output 169 [2025-04-13 23:04:05,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:05,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2045120751] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:05,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:05,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:04:05,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676518775] [2025-04-13 23:04:05,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:05,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:04:05,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:05,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:04:05,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:04:05,513 INFO L87 Difference]: Start difference. First operand 1034 states and 3571 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:09,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:09,695 INFO L93 Difference]: Finished difference Result 1382 states and 4669 transitions. [2025-04-13 23:04:09,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 23:04:09,695 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:09,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:09,698 INFO L225 Difference]: With dead ends: 1382 [2025-04-13 23:04:09,698 INFO L226 Difference]: Without dead ends: 1371 [2025-04-13 23:04:09,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1386 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=709, Invalid=4841, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:04:09,699 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 196 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2970 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:09,699 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 0 Invalid, 3046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2970 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:04:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-04-13 23:04:09,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1030. [2025-04-13 23:04:09,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1030 states, 1029 states have (on average 3.4606413994169096) internal successors, (3561), 1029 states have internal predecessors, (3561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:09,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 3561 transitions. [2025-04-13 23:04:09,711 INFO L79 Accepts]: Start accepts. Automaton has 1030 states and 3561 transitions. Word has length 25 [2025-04-13 23:04:09,711 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:09,711 INFO L485 AbstractCegarLoop]: Abstraction has 1030 states and 3561 transitions. [2025-04-13 23:04:09,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:09,711 INFO L278 IsEmpty]: Start isEmpty. Operand 1030 states and 3561 transitions. [2025-04-13 23:04:09,713 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:09,713 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:09,713 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:09,719 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2025-04-13 23:04:09,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable79 [2025-04-13 23:04:09,913 INFO L403 AbstractCegarLoop]: === Iteration 81 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:09,913 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash 355019234, now seen corresponding path program 42 times [2025-04-13 23:04:09,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:09,913 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013983129] [2025-04-13 23:04:09,914 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:09,917 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:09,921 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:09,921 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:04:09,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:10,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:10,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:10,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013983129] [2025-04-13 23:04:10,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013983129] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:10,192 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [451085922] [2025-04-13 23:04:10,192 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:10,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:10,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:10,193 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:10,194 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2025-04-13 23:04:10,257 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:10,270 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:10,271 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:04:10,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:10,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:04:10,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:10,664 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:10,664 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:04:10,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:10,959 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:11,490 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:11,490 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 127 [2025-04-13 23:04:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:11,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [451085922] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:11,744 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:11,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:04:11,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293747912] [2025-04-13 23:04:11,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:11,745 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:04:11,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:11,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:04:11,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:11,745 INFO L87 Difference]: Start difference. First operand 1030 states and 3561 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:16,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:16,647 INFO L93 Difference]: Finished difference Result 1596 states and 5221 transitions. [2025-04-13 23:04:16,648 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 23:04:16,648 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:16,648 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:16,651 INFO L225 Difference]: With dead ends: 1596 [2025-04-13 23:04:16,651 INFO L226 Difference]: Without dead ends: 1585 [2025-04-13 23:04:16,651 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2869 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1383, Invalid=8319, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 23:04:16,652 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 321 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2882 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:16,652 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 0 Invalid, 2978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2882 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:04:16,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-04-13 23:04:16,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1050. [2025-04-13 23:04:16,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1050 states, 1049 states have (on average 3.4613918017159198) internal successors, (3631), 1049 states have internal predecessors, (3631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:16,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1050 states to 1050 states and 3631 transitions. [2025-04-13 23:04:16,665 INFO L79 Accepts]: Start accepts. Automaton has 1050 states and 3631 transitions. Word has length 25 [2025-04-13 23:04:16,665 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:16,665 INFO L485 AbstractCegarLoop]: Abstraction has 1050 states and 3631 transitions. [2025-04-13 23:04:16,665 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:16,665 INFO L278 IsEmpty]: Start isEmpty. Operand 1050 states and 3631 transitions. [2025-04-13 23:04:16,666 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:16,667 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:16,667 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:16,673 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Ended with exit code 0 [2025-04-13 23:04:16,867 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable80,53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:16,867 INFO L403 AbstractCegarLoop]: === Iteration 82 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:16,867 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:16,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1145354736, now seen corresponding path program 43 times [2025-04-13 23:04:16,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:16,867 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573449366] [2025-04-13 23:04:16,867 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:16,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:16,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:16,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:16,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:16,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:17,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:17,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:17,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573449366] [2025-04-13 23:04:17,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573449366] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:17,400 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571141747] [2025-04-13 23:04:17,400 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:17,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:17,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:17,401 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:17,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2025-04-13 23:04:17,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:17,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:17,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:17,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:17,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:04:17,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:17,889 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:17,889 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:04:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:17,947 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:18,626 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:18,626 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:04:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:19,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571141747] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:19,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:19,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:04:19,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212205149] [2025-04-13 23:04:19,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:19,525 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:04:19,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:19,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:04:19,525 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:04:19,525 INFO L87 Difference]: Start difference. First operand 1050 states and 3631 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:22,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:22,986 INFO L93 Difference]: Finished difference Result 1255 states and 4242 transitions. [2025-04-13 23:04:22,986 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-04-13 23:04:22,987 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:22,987 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:22,990 INFO L225 Difference]: With dead ends: 1255 [2025-04-13 23:04:22,990 INFO L226 Difference]: Without dead ends: 1244 [2025-04-13 23:04:22,990 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=634, Invalid=4768, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:04:22,990 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:22,990 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 2154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:04:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2025-04-13 23:04:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1052. [2025-04-13 23:04:23,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.4652711703139865) internal successors, (3642), 1051 states have internal predecessors, (3642), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3642 transitions. [2025-04-13 23:04:23,002 INFO L79 Accepts]: Start accepts. Automaton has 1052 states and 3642 transitions. Word has length 25 [2025-04-13 23:04:23,003 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:23,003 INFO L485 AbstractCegarLoop]: Abstraction has 1052 states and 3642 transitions. [2025-04-13 23:04:23,003 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:23,003 INFO L278 IsEmpty]: Start isEmpty. Operand 1052 states and 3642 transitions. [2025-04-13 23:04:23,004 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:23,004 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:23,004 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:23,011 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2025-04-13 23:04:23,205 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable81,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:23,205 INFO L403 AbstractCegarLoop]: === Iteration 83 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:23,205 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:23,205 INFO L85 PathProgramCache]: Analyzing trace with hash -66994094, now seen corresponding path program 44 times [2025-04-13 23:04:23,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:23,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403196372] [2025-04-13 23:04:23,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:23,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:23,209 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:23,212 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:04:23,212 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:04:23,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:23,519 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:23,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:23,519 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403196372] [2025-04-13 23:04:23,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403196372] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:04:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:04:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292364422] [2025-04-13 23:04:23,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:23,520 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:04:23,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:23,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:04:23,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:04:23,520 INFO L87 Difference]: Start difference. First operand 1052 states and 3642 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:24,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:24,061 INFO L93 Difference]: Finished difference Result 1195 states and 4087 transitions. [2025-04-13 23:04:24,061 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:04:24,061 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:24,061 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:24,064 INFO L225 Difference]: With dead ends: 1195 [2025-04-13 23:04:24,064 INFO L226 Difference]: Without dead ends: 1189 [2025-04-13 23:04:24,064 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:04:24,064 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 75 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:24,064 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 0 Invalid, 1208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:04:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2025-04-13 23:04:24,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 1052. [2025-04-13 23:04:24,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1052 states, 1051 states have (on average 3.4614652711703138) internal successors, (3638), 1051 states have internal predecessors, (3638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 3638 transitions. [2025-04-13 23:04:24,076 INFO L79 Accepts]: Start accepts. Automaton has 1052 states and 3638 transitions. Word has length 25 [2025-04-13 23:04:24,076 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:24,076 INFO L485 AbstractCegarLoop]: Abstraction has 1052 states and 3638 transitions. [2025-04-13 23:04:24,076 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:24,076 INFO L278 IsEmpty]: Start isEmpty. Operand 1052 states and 3638 transitions. [2025-04-13 23:04:24,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:24,077 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:24,077 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:24,077 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable82 [2025-04-13 23:04:24,077 INFO L403 AbstractCegarLoop]: === Iteration 84 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:24,078 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:24,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1037110150, now seen corresponding path program 45 times [2025-04-13 23:04:24,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:24,078 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281648843] [2025-04-13 23:04:24,078 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:24,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:24,081 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:24,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:24,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:24,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:24,488 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:24,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:24,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281648843] [2025-04-13 23:04:24,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281648843] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:24,489 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1320812621] [2025-04-13 23:04:24,489 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:24,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:24,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:24,491 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:24,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2025-04-13 23:04:24,555 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:24,568 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:24,568 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:24,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:24,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:04:24,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:25,029 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:25,030 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:04:25,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:25,276 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:25,886 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:25,887 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 119 [2025-04-13 23:04:26,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:26,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1320812621] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:26,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:26,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:04:26,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796984399] [2025-04-13 23:04:26,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:26,190 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:04:26,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:26,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:04:26,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:04:26,191 INFO L87 Difference]: Start difference. First operand 1052 states and 3638 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:32,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:32,540 INFO L93 Difference]: Finished difference Result 1440 states and 4734 transitions. [2025-04-13 23:04:32,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-04-13 23:04:32,541 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:32,541 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:32,543 INFO L225 Difference]: With dead ends: 1440 [2025-04-13 23:04:32,544 INFO L226 Difference]: Without dead ends: 1419 [2025-04-13 23:04:32,544 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3355 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1334, Invalid=9172, Unknown=0, NotChecked=0, Total=10506 [2025-04-13 23:04:32,544 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 302 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2461 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:32,544 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 0 Invalid, 2461 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:04:32,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2025-04-13 23:04:32,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 1064. [2025-04-13 23:04:32,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1064 states, 1063 states have (on average 3.4807149576669802) internal successors, (3700), 1063 states have internal predecessors, (3700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:32,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 3700 transitions. [2025-04-13 23:04:32,558 INFO L79 Accepts]: Start accepts. Automaton has 1064 states and 3700 transitions. Word has length 25 [2025-04-13 23:04:32,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:32,558 INFO L485 AbstractCegarLoop]: Abstraction has 1064 states and 3700 transitions. [2025-04-13 23:04:32,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:32,558 INFO L278 IsEmpty]: Start isEmpty. Operand 1064 states and 3700 transitions. [2025-04-13 23:04:32,560 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:32,560 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:32,560 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:32,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Ended with exit code 0 [2025-04-13 23:04:32,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable83,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:32,760 INFO L403 AbstractCegarLoop]: === Iteration 85 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:32,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:32,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1746685810, now seen corresponding path program 46 times [2025-04-13 23:04:32,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:32,761 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331864929] [2025-04-13 23:04:32,761 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:32,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:32,764 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:32,767 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:32,767 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:32,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:32,979 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:32,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:32,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331864929] [2025-04-13 23:04:32,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331864929] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:32,979 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236863071] [2025-04-13 23:04:32,979 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:04:32,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:32,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:32,981 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:32,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2025-04-13 23:04:33,040 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:33,052 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:33,053 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:04:33,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:33,053 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:04:33,054 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:33,423 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:33,424 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:04:33,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:33,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:34,093 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:34,094 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:04:34,872 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:34,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1236863071] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:34,872 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:34,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:04:34,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115558156] [2025-04-13 23:04:34,873 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:34,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:04:34,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:34,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:04:34,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:04:34,873 INFO L87 Difference]: Start difference. First operand 1064 states and 3700 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:38,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:38,249 INFO L93 Difference]: Finished difference Result 1310 states and 4444 transitions. [2025-04-13 23:04:38,249 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:04:38,249 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:38,249 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:38,252 INFO L225 Difference]: With dead ends: 1310 [2025-04-13 23:04:38,252 INFO L226 Difference]: Without dead ends: 1299 [2025-04-13 23:04:38,252 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1579 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=743, Invalid=4807, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:04:38,252 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 232 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 232 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:38,253 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [232 Valid, 0 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:04:38,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1299 states. [2025-04-13 23:04:38,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1299 to 1082. [2025-04-13 23:04:38,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1082 states, 1081 states have (on average 3.4680851063829787) internal successors, (3749), 1081 states have internal predecessors, (3749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:38,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1082 states to 1082 states and 3749 transitions. [2025-04-13 23:04:38,265 INFO L79 Accepts]: Start accepts. Automaton has 1082 states and 3749 transitions. Word has length 25 [2025-04-13 23:04:38,265 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:38,265 INFO L485 AbstractCegarLoop]: Abstraction has 1082 states and 3749 transitions. [2025-04-13 23:04:38,265 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:38,265 INFO L278 IsEmpty]: Start isEmpty. Operand 1082 states and 3749 transitions. [2025-04-13 23:04:38,267 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:38,267 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:38,267 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:38,273 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Ended with exit code 0 [2025-04-13 23:04:38,467 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable84,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:38,467 INFO L403 AbstractCegarLoop]: === Iteration 86 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:38,468 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:38,468 INFO L85 PathProgramCache]: Analyzing trace with hash 768328060, now seen corresponding path program 47 times [2025-04-13 23:04:38,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:38,468 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226001247] [2025-04-13 23:04:38,468 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:38,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:38,471 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:38,476 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:38,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:38,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:39,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:39,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226001247] [2025-04-13 23:04:39,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226001247] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:39,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763551986] [2025-04-13 23:04:39,077 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:04:39,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:39,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:39,078 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:39,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2025-04-13 23:04:39,137 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:39,149 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:39,150 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:39,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:39,150 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:04:39,151 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:39,610 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:39,611 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:04:39,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:39,678 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:40,334 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:40,334 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:04:41,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:41,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763551986] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:41,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:41,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 33 [2025-04-13 23:04:41,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025121524] [2025-04-13 23:04:41,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:41,151 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:04:41,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:41,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:04:41,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:41,151 INFO L87 Difference]: Start difference. First operand 1082 states and 3749 transitions. Second operand has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:44,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:44,851 INFO L93 Difference]: Finished difference Result 1381 states and 4645 transitions. [2025-04-13 23:04:44,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 23:04:44,852 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:44,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:44,855 INFO L225 Difference]: With dead ends: 1381 [2025-04-13 23:04:44,855 INFO L226 Difference]: Without dead ends: 1370 [2025-04-13 23:04:44,855 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1703 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=697, Invalid=5783, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 23:04:44,855 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 207 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2754 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 2754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:44,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 0 Invalid, 2816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 2754 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:04:44,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2025-04-13 23:04:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1080. [2025-04-13 23:04:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1080 states, 1079 states have (on average 3.4661723818350323) internal successors, (3740), 1079 states have internal predecessors, (3740), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 3740 transitions. [2025-04-13 23:04:44,869 INFO L79 Accepts]: Start accepts. Automaton has 1080 states and 3740 transitions. Word has length 25 [2025-04-13 23:04:44,869 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:44,869 INFO L485 AbstractCegarLoop]: Abstraction has 1080 states and 3740 transitions. [2025-04-13 23:04:44,869 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.0) internal successors, (68), 34 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:44,869 INFO L278 IsEmpty]: Start isEmpty. Operand 1080 states and 3740 transitions. [2025-04-13 23:04:44,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:44,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:44,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:44,877 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Ended with exit code 0 [2025-04-13 23:04:45,071 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable85,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:45,071 INFO L403 AbstractCegarLoop]: === Iteration 87 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:45,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:45,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1184056292, now seen corresponding path program 48 times [2025-04-13 23:04:45,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:45,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953089506] [2025-04-13 23:04:45,071 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:45,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:45,075 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:45,079 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:45,079 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:04:45,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:45,398 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:45,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:45,398 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953089506] [2025-04-13 23:04:45,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953089506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:45,399 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098398999] [2025-04-13 23:04:45,399 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:04:45,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:45,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:45,400 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:45,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2025-04-13 23:04:45,459 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:45,473 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:45,473 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:04:45,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:45,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:04:45,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:46,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:04:46,122 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:46,122 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 93 [2025-04-13 23:04:46,236 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:46,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:46,820 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:46,820 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:04:47,111 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:47,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098398999] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:47,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:47,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:04:47,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211920010] [2025-04-13 23:04:47,111 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:47,111 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:04:47,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:47,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:04:47,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1018, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:04:47,112 INFO L87 Difference]: Start difference. First operand 1080 states and 3740 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:51,360 INFO L93 Difference]: Finished difference Result 1661 states and 5553 transitions. [2025-04-13 23:04:51,360 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 23:04:51,360 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:51,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:51,364 INFO L225 Difference]: With dead ends: 1661 [2025-04-13 23:04:51,364 INFO L226 Difference]: Without dead ends: 1650 [2025-04-13 23:04:51,364 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2021 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1028, Invalid=5944, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:04:51,365 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 352 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2623 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 352 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 2623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:51,365 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [352 Valid, 0 Invalid, 2731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 2623 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:04:51,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2025-04-13 23:04:51,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1088. [2025-04-13 23:04:51,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 3.4581416743330267) internal successors, (3759), 1087 states have internal predecessors, (3759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:51,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 3759 transitions. [2025-04-13 23:04:51,379 INFO L79 Accepts]: Start accepts. Automaton has 1088 states and 3759 transitions. Word has length 25 [2025-04-13 23:04:51,379 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:51,379 INFO L485 AbstractCegarLoop]: Abstraction has 1088 states and 3759 transitions. [2025-04-13 23:04:51,379 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:51,379 INFO L278 IsEmpty]: Start isEmpty. Operand 1088 states and 3759 transitions. [2025-04-13 23:04:51,380 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:51,380 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:51,380 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:51,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2025-04-13 23:04:51,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable86 [2025-04-13 23:04:51,581 INFO L403 AbstractCegarLoop]: === Iteration 88 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:51,581 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:51,581 INFO L85 PathProgramCache]: Analyzing trace with hash 988290442, now seen corresponding path program 49 times [2025-04-13 23:04:51,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:51,581 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372752469] [2025-04-13 23:04:51,581 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:51,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:51,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:51,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:51,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:51,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:04:52,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:52,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372752469] [2025-04-13 23:04:52,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372752469] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:52,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901645245] [2025-04-13 23:04:52,094 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:04:52,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:52,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:52,096 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:52,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2025-04-13 23:04:52,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:04:52,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:52,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:04:52,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:52,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:04:52,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:52,602 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:52,602 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:04:52,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:52,670 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:04:52,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901645245] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:04:52,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:04:52,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:04:52,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894501369] [2025-04-13 23:04:52,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:04:52,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:04:52,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:52,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:04:52,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:04:52,671 INFO L87 Difference]: Start difference. First operand 1088 states and 3759 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:52,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:52,946 INFO L93 Difference]: Finished difference Result 1160 states and 3960 transitions. [2025-04-13 23:04:52,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:04:52,946 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:52,946 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:52,949 INFO L225 Difference]: With dead ends: 1160 [2025-04-13 23:04:52,949 INFO L226 Difference]: Without dead ends: 1154 [2025-04-13 23:04:52,949 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:04:52,949 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 43 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:52,949 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 0 Invalid, 670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:04:52,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2025-04-13 23:04:52,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1092. [2025-04-13 23:04:52,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1092 states, 1091 states have (on average 3.461961503208066) internal successors, (3777), 1091 states have internal predecessors, (3777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:52,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 3777 transitions. [2025-04-13 23:04:52,961 INFO L79 Accepts]: Start accepts. Automaton has 1092 states and 3777 transitions. Word has length 25 [2025-04-13 23:04:52,961 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:52,961 INFO L485 AbstractCegarLoop]: Abstraction has 1092 states and 3777 transitions. [2025-04-13 23:04:52,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:52,962 INFO L278 IsEmpty]: Start isEmpty. Operand 1092 states and 3777 transitions. [2025-04-13 23:04:52,963 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:52,963 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:52,963 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:52,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2025-04-13 23:04:53,163 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable87 [2025-04-13 23:04:53,164 INFO L403 AbstractCegarLoop]: === Iteration 89 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:53,164 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:53,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1644144564, now seen corresponding path program 50 times [2025-04-13 23:04:53,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:53,164 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342890823] [2025-04-13 23:04:53,164 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:53,168 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:53,172 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:53,172 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:53,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:53,537 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:53,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:53,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342890823] [2025-04-13 23:04:53,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342890823] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:53,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992073949] [2025-04-13 23:04:53,537 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:04:53,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:53,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:53,539 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:53,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2025-04-13 23:04:53,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:53,612 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:53,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:04:53,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:53,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:04:53,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:54,180 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:04:54,183 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:54,183 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:04:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:54,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:04:54,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:54,895 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:04:55,163 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:04:55,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992073949] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:04:55,163 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:04:55,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2025-04-13 23:04:55,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242091438] [2025-04-13 23:04:55,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:04:55,163 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:04:55,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:04:55,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:04:55,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1148, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:04:55,164 INFO L87 Difference]: Start difference. First operand 1092 states and 3777 transitions. Second operand has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:58,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:04:58,562 INFO L93 Difference]: Finished difference Result 1548 states and 5124 transitions. [2025-04-13 23:04:58,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 23:04:58,562 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:04:58,563 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:04:58,566 INFO L225 Difference]: With dead ends: 1548 [2025-04-13 23:04:58,566 INFO L226 Difference]: Without dead ends: 1537 [2025-04-13 23:04:58,566 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1407 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=693, Invalid=4709, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:04:58,566 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 316 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3020 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 3020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:04:58,566 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 0 Invalid, 3097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 3020 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:04:58,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1537 states. [2025-04-13 23:04:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1537 to 1088. [2025-04-13 23:04:58,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1088 states, 1087 states have (on average 3.4627414903403864) internal successors, (3764), 1087 states have internal predecessors, (3764), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:58,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1088 states to 1088 states and 3764 transitions. [2025-04-13 23:04:58,580 INFO L79 Accepts]: Start accepts. Automaton has 1088 states and 3764 transitions. Word has length 25 [2025-04-13 23:04:58,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:04:58,580 INFO L485 AbstractCegarLoop]: Abstraction has 1088 states and 3764 transitions. [2025-04-13 23:04:58,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.8333333333333333) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:04:58,581 INFO L278 IsEmpty]: Start isEmpty. Operand 1088 states and 3764 transitions. [2025-04-13 23:04:58,582 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:04:58,582 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:04:58,582 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:04:58,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Ended with exit code 0 [2025-04-13 23:04:58,782 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable88 [2025-04-13 23:04:58,783 INFO L403 AbstractCegarLoop]: === Iteration 90 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:04:58,783 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:04:58,783 INFO L85 PathProgramCache]: Analyzing trace with hash -728863972, now seen corresponding path program 51 times [2025-04-13 23:04:58,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:04:58,783 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520688809] [2025-04-13 23:04:58,783 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:58,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:04:58,787 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:58,791 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:58,791 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:58,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:59,326 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:04:59,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:04:59,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520688809] [2025-04-13 23:04:59,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520688809] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:04:59,326 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627700659] [2025-04-13 23:04:59,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:04:59,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:04:59,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:04:59,328 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:04:59,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2025-04-13 23:04:59,388 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:04:59,401 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:04:59,401 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:04:59,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:04:59,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:04:59,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:04:59,870 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:04:59,876 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:04:59,876 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 171 treesize of output 103 [2025-04-13 23:05:00,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:00,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:00,831 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:00,832 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:05:01,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:01,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [627700659] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:01,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:01,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 34 [2025-04-13 23:05:01,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73796407] [2025-04-13 23:05:01,128 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:01,128 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:05:01,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:01,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:05:01,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1092, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:05:01,129 INFO L87 Difference]: Start difference. First operand 1088 states and 3764 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:08,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:08,574 INFO L93 Difference]: Finished difference Result 1573 states and 5229 transitions. [2025-04-13 23:05:08,574 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2025-04-13 23:05:08,574 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:08,574 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:08,578 INFO L225 Difference]: With dead ends: 1573 [2025-04-13 23:05:08,578 INFO L226 Difference]: Without dead ends: 1557 [2025-04-13 23:05:08,579 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4464 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=1497, Invalid=12783, Unknown=0, NotChecked=0, Total=14280 [2025-04-13 23:05:08,579 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 322 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3172 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 3172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:08,579 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 0 Invalid, 3319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 3172 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:05:08,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1557 states. [2025-04-13 23:05:08,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1557 to 1120. [2025-04-13 23:05:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 3.4959785522788205) internal successors, (3912), 1119 states have internal predecessors, (3912), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:08,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 3912 transitions. [2025-04-13 23:05:08,593 INFO L79 Accepts]: Start accepts. Automaton has 1120 states and 3912 transitions. Word has length 25 [2025-04-13 23:05:08,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:08,593 INFO L485 AbstractCegarLoop]: Abstraction has 1120 states and 3912 transitions. [2025-04-13 23:05:08,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:08,594 INFO L278 IsEmpty]: Start isEmpty. Operand 1120 states and 3912 transitions. [2025-04-13 23:05:08,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:08,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:08,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:08,601 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Ended with exit code 0 [2025-04-13 23:05:08,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable89,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:08,796 INFO L403 AbstractCegarLoop]: === Iteration 91 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:08,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:08,796 INFO L85 PathProgramCache]: Analyzing trace with hash 731428006, now seen corresponding path program 52 times [2025-04-13 23:05:08,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:08,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288240202] [2025-04-13 23:05:08,796 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:08,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:08,800 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:08,803 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:08,803 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:08,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:09,018 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:09,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:09,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288240202] [2025-04-13 23:05:09,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288240202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:09,019 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883190356] [2025-04-13 23:05:09,019 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:09,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:09,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:09,020 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:09,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2025-04-13 23:05:09,080 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:09,093 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:09,093 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:09,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:09,094 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:05:09,094 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:09,473 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:09,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:05:09,529 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:09,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:10,142 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:10,142 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:05:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:10,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883190356] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:10,891 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:10,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:05:10,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572622084] [2025-04-13 23:05:10,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:10,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:05:10,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:10,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:05:10,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=908, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:05:10,891 INFO L87 Difference]: Start difference. First operand 1120 states and 3912 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:15,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:15,306 INFO L93 Difference]: Finished difference Result 1459 states and 4948 transitions. [2025-04-13 23:05:15,306 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:05:15,306 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:15,306 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:15,309 INFO L225 Difference]: With dead ends: 1459 [2025-04-13 23:05:15,309 INFO L226 Difference]: Without dead ends: 1448 [2025-04-13 23:05:15,310 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2258 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=922, Invalid=6560, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 23:05:15,310 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2153 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 2153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:15,310 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 2227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 2153 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:05:15,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2025-04-13 23:05:15,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 1120. [2025-04-13 23:05:15,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1120 states, 1119 states have (on average 3.4977658623771224) internal successors, (3914), 1119 states have internal predecessors, (3914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:15,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1120 states to 1120 states and 3914 transitions. [2025-04-13 23:05:15,324 INFO L79 Accepts]: Start accepts. Automaton has 1120 states and 3914 transitions. Word has length 25 [2025-04-13 23:05:15,324 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:15,324 INFO L485 AbstractCegarLoop]: Abstraction has 1120 states and 3914 transitions. [2025-04-13 23:05:15,324 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:15,324 INFO L278 IsEmpty]: Start isEmpty. Operand 1120 states and 3914 transitions. [2025-04-13 23:05:15,326 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:15,326 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:15,326 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:15,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2025-04-13 23:05:15,526 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable90,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:15,526 INFO L403 AbstractCegarLoop]: === Iteration 92 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:15,527 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash -456672788, now seen corresponding path program 53 times [2025-04-13 23:05:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:15,527 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279441500] [2025-04-13 23:05:15,527 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:15,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:15,530 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:15,534 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:15,534 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:15,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:16,051 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:16,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:16,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279441500] [2025-04-13 23:05:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279441500] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:16,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132656301] [2025-04-13 23:05:16,051 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:16,053 INFO L229 MonitoredProcess]: Starting monitored process 63 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:16,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2025-04-13 23:05:16,116 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:16,129 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:16,129 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:16,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:16,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:05:16,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:16,552 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:05:16,555 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:16,555 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 91 [2025-04-13 23:05:16,726 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:16,726 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:17,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:17,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:05:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:18,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132656301] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:18,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:05:18,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 32 [2025-04-13 23:05:18,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825185540] [2025-04-13 23:05:18,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:18,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:05:18,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:18,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:05:18,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=973, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:05:18,304 INFO L87 Difference]: Start difference. First operand 1120 states and 3914 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:19,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:19,057 INFO L93 Difference]: Finished difference Result 1234 states and 4242 transitions. [2025-04-13 23:05:19,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:05:19,057 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:19,057 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:19,060 INFO L225 Difference]: With dead ends: 1234 [2025-04-13 23:05:19,060 INFO L226 Difference]: Without dead ends: 1228 [2025-04-13 23:05:19,060 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 393 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=198, Invalid=1442, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:05:19,061 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 677 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:19,061 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 677 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:05:19,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2025-04-13 23:05:19,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1112. [2025-04-13 23:05:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1111 states have (on average 3.4869486948694868) internal successors, (3874), 1111 states have internal predecessors, (3874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:19,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 3874 transitions. [2025-04-13 23:05:19,073 INFO L79 Accepts]: Start accepts. Automaton has 1112 states and 3874 transitions. Word has length 25 [2025-04-13 23:05:19,073 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:19,073 INFO L485 AbstractCegarLoop]: Abstraction has 1112 states and 3874 transitions. [2025-04-13 23:05:19,073 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:19,073 INFO L278 IsEmpty]: Start isEmpty. Operand 1112 states and 3874 transitions. [2025-04-13 23:05:19,075 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:19,075 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:19,075 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:19,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Ended with exit code 0 [2025-04-13 23:05:19,275 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable91,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:19,275 INFO L403 AbstractCegarLoop]: === Iteration 93 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:19,276 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:19,276 INFO L85 PathProgramCache]: Analyzing trace with hash 606384022, now seen corresponding path program 54 times [2025-04-13 23:05:19,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:19,276 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115756888] [2025-04-13 23:05:19,276 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:05:19,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:19,280 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:19,284 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:19,284 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:05:19,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:19,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:19,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115756888] [2025-04-13 23:05:19,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115756888] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:19,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196009037] [2025-04-13 23:05:19,656 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:05:19,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:19,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:19,658 INFO L229 MonitoredProcess]: Starting monitored process 64 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:19,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2025-04-13 23:05:19,719 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:19,732 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:19,732 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:05:19,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:19,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:05:19,734 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:20,282 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:05:20,285 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:20,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:05:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:20,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:21,093 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:21,093 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:05:21,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196009037] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:21,391 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:21,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:05:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759710717] [2025-04-13 23:05:21,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:21,392 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:05:21,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:21,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:05:21,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1015, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:05:21,392 INFO L87 Difference]: Start difference. First operand 1112 states and 3874 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:26,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:26,293 INFO L93 Difference]: Finished difference Result 1750 states and 6067 transitions. [2025-04-13 23:05:26,294 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:05:26,294 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:26,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:26,298 INFO L225 Difference]: With dead ends: 1750 [2025-04-13 23:05:26,298 INFO L226 Difference]: Without dead ends: 1739 [2025-04-13 23:05:26,298 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1881 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=999, Invalid=5643, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:05:26,298 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 225 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2973 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3077 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:26,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 0 Invalid, 3077 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2973 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:05:26,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1739 states. [2025-04-13 23:05:26,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1739 to 1118. [2025-04-13 23:05:26,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 1117 states have (on average 3.483437779767234) internal successors, (3891), 1117 states have internal predecessors, (3891), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:26,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 3891 transitions. [2025-04-13 23:05:26,313 INFO L79 Accepts]: Start accepts. Automaton has 1118 states and 3891 transitions. Word has length 25 [2025-04-13 23:05:26,313 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:26,313 INFO L485 AbstractCegarLoop]: Abstraction has 1118 states and 3891 transitions. [2025-04-13 23:05:26,313 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:26,313 INFO L278 IsEmpty]: Start isEmpty. Operand 1118 states and 3891 transitions. [2025-04-13 23:05:26,315 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:26,315 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:26,315 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:26,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2025-04-13 23:05:26,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable92,64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:26,515 INFO L403 AbstractCegarLoop]: === Iteration 94 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:26,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:26,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1297082286, now seen corresponding path program 55 times [2025-04-13 23:05:26,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:26,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035038106] [2025-04-13 23:05:26,516 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:26,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:26,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:05:26,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:26,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:26,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:26,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:26,893 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035038106] [2025-04-13 23:05:26,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035038106] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:26,894 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749314874] [2025-04-13 23:05:26,894 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:26,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:26,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:26,895 INFO L229 MonitoredProcess]: Starting monitored process 65 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:26,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2025-04-13 23:05:26,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:05:26,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:26,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:26,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:26,971 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:05:26,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:27,429 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:27,430 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:05:27,484 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:27,484 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:27,895 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:27,896 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:05:28,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:28,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749314874] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:28,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:28,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:05:28,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773794702] [2025-04-13 23:05:28,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:28,902 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:05:28,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:28,902 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:05:28,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=982, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:05:28,902 INFO L87 Difference]: Start difference. First operand 1118 states and 3891 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:31,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:31,673 INFO L93 Difference]: Finished difference Result 1345 states and 4528 transitions. [2025-04-13 23:05:31,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-04-13 23:05:31,673 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:31,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:31,676 INFO L225 Difference]: With dead ends: 1345 [2025-04-13 23:05:31,676 INFO L226 Difference]: Without dead ends: 1334 [2025-04-13 23:05:31,677 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=490, Invalid=3932, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 23:05:31,677 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 245 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3174 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 3174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:31,677 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 0 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 3174 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:05:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2025-04-13 23:05:31,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1166. [2025-04-13 23:05:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1165 states have (on average 3.48068669527897) internal successors, (4055), 1165 states have internal predecessors, (4055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 4055 transitions. [2025-04-13 23:05:31,691 INFO L79 Accepts]: Start accepts. Automaton has 1166 states and 4055 transitions. Word has length 25 [2025-04-13 23:05:31,691 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:31,691 INFO L485 AbstractCegarLoop]: Abstraction has 1166 states and 4055 transitions. [2025-04-13 23:05:31,691 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:31,691 INFO L278 IsEmpty]: Start isEmpty. Operand 1166 states and 4055 transitions. [2025-04-13 23:05:31,693 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:31,693 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:31,693 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:31,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2025-04-13 23:05:31,893 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable93,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:31,893 INFO L403 AbstractCegarLoop]: === Iteration 95 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:31,893 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:31,893 INFO L85 PathProgramCache]: Analyzing trace with hash -478677564, now seen corresponding path program 56 times [2025-04-13 23:05:31,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:31,893 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296621386] [2025-04-13 23:05:31,894 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:31,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:31,897 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:31,900 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:05:31,900 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:05:31,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:32,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:32,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:32,219 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296621386] [2025-04-13 23:05:32,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296621386] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:32,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:05:32,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:05:32,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820261536] [2025-04-13 23:05:32,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:32,219 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:05:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:32,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:05:32,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:05:32,219 INFO L87 Difference]: Start difference. First operand 1166 states and 4055 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:32,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:32,497 INFO L93 Difference]: Finished difference Result 1242 states and 4301 transitions. [2025-04-13 23:05:32,497 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:05:32,497 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:32,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:32,500 INFO L225 Difference]: With dead ends: 1242 [2025-04-13 23:05:32,500 INFO L226 Difference]: Without dead ends: 1236 [2025-04-13 23:05:32,500 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2025-04-13 23:05:32,501 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 616 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:32,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 616 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:05:32,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2025-04-13 23:05:32,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1162. [2025-04-13 23:05:32,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1162 states, 1161 states have (on average 3.4806201550387597) internal successors, (4041), 1161 states have internal predecessors, (4041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:32,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 4041 transitions. [2025-04-13 23:05:32,513 INFO L79 Accepts]: Start accepts. Automaton has 1162 states and 4041 transitions. Word has length 25 [2025-04-13 23:05:32,514 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:32,514 INFO L485 AbstractCegarLoop]: Abstraction has 1162 states and 4041 transitions. [2025-04-13 23:05:32,514 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:32,514 INFO L278 IsEmpty]: Start isEmpty. Operand 1162 states and 4041 transitions. [2025-04-13 23:05:32,515 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:32,515 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:32,515 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:32,515 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable94 [2025-04-13 23:05:32,515 INFO L403 AbstractCegarLoop]: === Iteration 96 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:32,515 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:32,516 INFO L85 PathProgramCache]: Analyzing trace with hash 200650518, now seen corresponding path program 57 times [2025-04-13 23:05:32,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:32,516 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530292209] [2025-04-13 23:05:32,516 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:05:32,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:32,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:32,522 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:05:32,522 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:05:32,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:32,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:32,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:32,841 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530292209] [2025-04-13 23:05:32,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530292209] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:32,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:05:32,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:05:32,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710316957] [2025-04-13 23:05:32,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:32,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:05:32,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:32,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:05:32,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:05:32,842 INFO L87 Difference]: Start difference. First operand 1162 states and 4041 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:33,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:33,338 INFO L93 Difference]: Finished difference Result 1286 states and 4461 transitions. [2025-04-13 23:05:33,338 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:05:33,338 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:33,338 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:33,341 INFO L225 Difference]: With dead ends: 1286 [2025-04-13 23:05:33,341 INFO L226 Difference]: Without dead ends: 1280 [2025-04-13 23:05:33,342 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=559, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:05:33,342 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 101 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 837 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 837 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:33,342 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 0 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 837 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:05:33,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2025-04-13 23:05:33,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1166. [2025-04-13 23:05:33,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1166 states, 1165 states have (on average 3.48068669527897) internal successors, (4055), 1165 states have internal predecessors, (4055), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:33,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1166 states to 1166 states and 4055 transitions. [2025-04-13 23:05:33,356 INFO L79 Accepts]: Start accepts. Automaton has 1166 states and 4055 transitions. Word has length 25 [2025-04-13 23:05:33,356 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:33,356 INFO L485 AbstractCegarLoop]: Abstraction has 1166 states and 4055 transitions. [2025-04-13 23:05:33,356 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:33,356 INFO L278 IsEmpty]: Start isEmpty. Operand 1166 states and 4055 transitions. [2025-04-13 23:05:33,358 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:33,358 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:33,358 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:33,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable95 [2025-04-13 23:05:33,358 INFO L403 AbstractCegarLoop]: === Iteration 97 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:33,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:33,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1270949404, now seen corresponding path program 58 times [2025-04-13 23:05:33,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:33,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967397243] [2025-04-13 23:05:33,358 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:33,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:33,362 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:33,365 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:33,365 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:33,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:33,634 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:33,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:33,634 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967397243] [2025-04-13 23:05:33,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967397243] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:33,635 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [802154979] [2025-04-13 23:05:33,635 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:05:33,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:33,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:33,636 INFO L229 MonitoredProcess]: Starting monitored process 66 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:33,637 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2025-04-13 23:05:33,700 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:33,712 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:33,713 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:05:33,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:33,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:05:33,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:34,125 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:34,126 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:05:34,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:34,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:35,027 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:35,027 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:05:35,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:35,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [802154979] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:35,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:35,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:05:35,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501853981] [2025-04-13 23:05:35,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:35,809 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:05:35,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:35,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:05:35,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=934, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:05:35,810 INFO L87 Difference]: Start difference. First operand 1166 states and 4055 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:41,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:41,738 INFO L93 Difference]: Finished difference Result 1517 states and 5079 transitions. [2025-04-13 23:05:41,738 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:05:41,738 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:41,738 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:41,741 INFO L225 Difference]: With dead ends: 1517 [2025-04-13 23:05:41,741 INFO L226 Difference]: Without dead ends: 1501 [2025-04-13 23:05:41,742 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=909, Invalid=6573, Unknown=0, NotChecked=0, Total=7482 [2025-04-13 23:05:41,742 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2498 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:41,742 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2498 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:05:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2025-04-13 23:05:41,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1168. [2025-04-13 23:05:41,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 3.473864610111397) internal successors, (4054), 1167 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:41,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 4054 transitions. [2025-04-13 23:05:41,756 INFO L79 Accepts]: Start accepts. Automaton has 1168 states and 4054 transitions. Word has length 25 [2025-04-13 23:05:41,756 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:41,756 INFO L485 AbstractCegarLoop]: Abstraction has 1168 states and 4054 transitions. [2025-04-13 23:05:41,756 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:41,756 INFO L278 IsEmpty]: Start isEmpty. Operand 1168 states and 4054 transitions. [2025-04-13 23:05:41,758 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:41,758 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:41,758 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:41,763 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2025-04-13 23:05:41,958 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable96 [2025-04-13 23:05:41,958 INFO L403 AbstractCegarLoop]: === Iteration 98 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:41,958 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:41,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1784691340, now seen corresponding path program 59 times [2025-04-13 23:05:41,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:41,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481940400] [2025-04-13 23:05:41,959 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:41,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:41,962 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:41,966 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:41,966 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:41,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:42,395 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:05:42,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:42,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481940400] [2025-04-13 23:05:42,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481940400] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:42,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972501124] [2025-04-13 23:05:42,395 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:05:42,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:42,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:42,397 INFO L229 MonitoredProcess]: Starting monitored process 67 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:42,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2025-04-13 23:05:42,460 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:42,473 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:42,473 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:42,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:42,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:05:42,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:42,865 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:42,865 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:05:42,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:42,930 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:43,372 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:43,372 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:05:44,298 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:44,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972501124] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:44,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:05:44,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 33 [2025-04-13 23:05:44,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27776424] [2025-04-13 23:05:44,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:44,298 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:05:44,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:44,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:05:44,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1016, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:05:44,299 INFO L87 Difference]: Start difference. First operand 1168 states and 4054 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:44,930 INFO L93 Difference]: Finished difference Result 1224 states and 4202 transitions. [2025-04-13 23:05:44,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:05:44,930 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:44,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:44,933 INFO L225 Difference]: With dead ends: 1224 [2025-04-13 23:05:44,933 INFO L226 Difference]: Without dead ends: 1218 [2025-04-13 23:05:44,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=224, Invalid=1498, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:05:44,933 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 46 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:44,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 0 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:05:44,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2025-04-13 23:05:44,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 1168. [2025-04-13 23:05:44,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1168 states, 1167 states have (on average 3.473864610111397) internal successors, (4054), 1167 states have internal predecessors, (4054), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:44,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1168 states to 1168 states and 4054 transitions. [2025-04-13 23:05:44,946 INFO L79 Accepts]: Start accepts. Automaton has 1168 states and 4054 transitions. Word has length 25 [2025-04-13 23:05:44,946 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:44,946 INFO L485 AbstractCegarLoop]: Abstraction has 1168 states and 4054 transitions. [2025-04-13 23:05:44,946 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:44,946 INFO L278 IsEmpty]: Start isEmpty. Operand 1168 states and 4054 transitions. [2025-04-13 23:05:44,948 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:44,948 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:44,948 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:44,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2025-04-13 23:05:45,148 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable97 [2025-04-13 23:05:45,148 INFO L403 AbstractCegarLoop]: === Iteration 99 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:45,148 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:45,149 INFO L85 PathProgramCache]: Analyzing trace with hash -334728268, now seen corresponding path program 60 times [2025-04-13 23:05:45,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:45,149 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693294446] [2025-04-13 23:05:45,149 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:05:45,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:45,152 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:45,156 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:45,156 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:05:45,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:45,485 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:45,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:45,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693294446] [2025-04-13 23:05:45,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693294446] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:45,485 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821754331] [2025-04-13 23:05:45,485 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:05:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:45,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:45,487 INFO L229 MonitoredProcess]: Starting monitored process 68 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:45,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2025-04-13 23:05:45,552 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:45,565 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:45,565 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:05:45,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:45,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:05:45,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:45,957 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:45,957 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:05:46,186 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:46,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:46,998 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:46,998 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 267 treesize of output 127 [2025-04-13 23:05:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:47,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821754331] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:47,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:47,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:05:47,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016684798] [2025-04-13 23:05:47,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:47,306 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:05:47,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:47,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:05:47,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1056, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:05:47,306 INFO L87 Difference]: Start difference. First operand 1168 states and 4054 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:53,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:53,202 INFO L93 Difference]: Finished difference Result 1629 states and 5596 transitions. [2025-04-13 23:05:53,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 23:05:53,202 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:53,202 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:53,206 INFO L225 Difference]: With dead ends: 1629 [2025-04-13 23:05:53,206 INFO L226 Difference]: Without dead ends: 1618 [2025-04-13 23:05:53,206 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2645 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1197, Invalid=7359, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 23:05:53,206 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 259 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:53,206 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 0 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 2655 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:05:53,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1618 states. [2025-04-13 23:05:53,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1618 to 1172. [2025-04-13 23:05:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 3.4722459436379163) internal successors, (4066), 1171 states have internal predecessors, (4066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:53,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 4066 transitions. [2025-04-13 23:05:53,221 INFO L79 Accepts]: Start accepts. Automaton has 1172 states and 4066 transitions. Word has length 25 [2025-04-13 23:05:53,221 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:53,221 INFO L485 AbstractCegarLoop]: Abstraction has 1172 states and 4066 transitions. [2025-04-13 23:05:53,221 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:53,221 INFO L278 IsEmpty]: Start isEmpty. Operand 1172 states and 4066 transitions. [2025-04-13 23:05:53,222 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:53,222 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:53,222 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:53,229 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Ended with exit code 0 [2025-04-13 23:05:53,423 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable98 [2025-04-13 23:05:53,423 INFO L403 AbstractCegarLoop]: === Iteration 100 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:53,423 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:53,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1479041198, now seen corresponding path program 61 times [2025-04-13 23:05:53,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:53,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335122969] [2025-04-13 23:05:53,423 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:53,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:53,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:05:53,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:53,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:53,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:53,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:05:53,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:53,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335122969] [2025-04-13 23:05:53,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335122969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:53,857 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915503102] [2025-04-13 23:05:53,857 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:05:53,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:53,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:53,859 INFO L229 MonitoredProcess]: Starting monitored process 69 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:53,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2025-04-13 23:05:53,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:05:53,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:53,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:05:53,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:53,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:05:53,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:54,271 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:54,271 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:05:54,338 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:54,338 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:05:54,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915503102] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:05:54,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:05:54,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:05:54,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777335821] [2025-04-13 23:05:54,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:05:54,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:05:54,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:54,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:05:54,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:05:54,339 INFO L87 Difference]: Start difference. First operand 1172 states and 4066 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:54,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:05:54,595 INFO L93 Difference]: Finished difference Result 1232 states and 4231 transitions. [2025-04-13 23:05:54,595 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:05:54,595 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:05:54,595 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:05:54,598 INFO L225 Difference]: With dead ends: 1232 [2025-04-13 23:05:54,598 INFO L226 Difference]: Without dead ends: 1226 [2025-04-13 23:05:54,598 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:05:54,598 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:05:54,598 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:05:54,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2025-04-13 23:05:54,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1172. [2025-04-13 23:05:54,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1172 states, 1171 states have (on average 3.4722459436379163) internal successors, (4066), 1171 states have internal predecessors, (4066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1172 states to 1172 states and 4066 transitions. [2025-04-13 23:05:54,611 INFO L79 Accepts]: Start accepts. Automaton has 1172 states and 4066 transitions. Word has length 25 [2025-04-13 23:05:54,611 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:05:54,611 INFO L485 AbstractCegarLoop]: Abstraction has 1172 states and 4066 transitions. [2025-04-13 23:05:54,611 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:05:54,611 INFO L278 IsEmpty]: Start isEmpty. Operand 1172 states and 4066 transitions. [2025-04-13 23:05:54,612 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:05:54,613 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:05:54,613 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:05:54,619 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Ended with exit code 0 [2025-04-13 23:05:54,813 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 69 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable99 [2025-04-13 23:05:54,813 INFO L403 AbstractCegarLoop]: === Iteration 101 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:05:54,813 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:05:54,813 INFO L85 PathProgramCache]: Analyzing trace with hash -29078126, now seen corresponding path program 62 times [2025-04-13 23:05:54,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:05:54,813 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200568692] [2025-04-13 23:05:54,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:54,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:05:54,817 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:54,821 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:54,821 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:54,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:55,160 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:55,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:05:55,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200568692] [2025-04-13 23:05:55,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200568692] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:05:55,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84342170] [2025-04-13 23:05:55,160 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:05:55,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:05:55,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:05:55,162 INFO L229 MonitoredProcess]: Starting monitored process 70 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:05:55,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Waiting until timeout for monitored process [2025-04-13 23:05:55,229 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:05:55,242 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:05:55,242 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:05:55,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:05:55,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:05:55,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:05:55,618 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:55,619 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:05:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:55,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:05:56,638 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:05:56,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:05:56,908 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:05:56,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84342170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:05:56,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:05:56,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:05:56,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501819101] [2025-04-13 23:05:56,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:05:56,909 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:05:56,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:05:56,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:05:56,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1000, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:05:56,909 INFO L87 Difference]: Start difference. First operand 1172 states and 4066 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:02,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:02,695 INFO L93 Difference]: Finished difference Result 1608 states and 5514 transitions. [2025-04-13 23:06:02,695 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 23:06:02,695 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:02,695 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:02,699 INFO L225 Difference]: With dead ends: 1608 [2025-04-13 23:06:02,699 INFO L226 Difference]: Without dead ends: 1597 [2025-04-13 23:06:02,700 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2557 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1180, Invalid=7010, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:06:02,700 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 262 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2571 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:02,700 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 0 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2571 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:06:02,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-04-13 23:06:02,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1174. [2025-04-13 23:06:02,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1174 states, 1173 states have (on average 3.4705882352941178) internal successors, (4071), 1173 states have internal predecessors, (4071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:02,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 4071 transitions. [2025-04-13 23:06:02,717 INFO L79 Accepts]: Start accepts. Automaton has 1174 states and 4071 transitions. Word has length 25 [2025-04-13 23:06:02,717 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:02,717 INFO L485 AbstractCegarLoop]: Abstraction has 1174 states and 4071 transitions. [2025-04-13 23:06:02,717 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:02,717 INFO L278 IsEmpty]: Start isEmpty. Operand 1174 states and 4071 transitions. [2025-04-13 23:06:02,719 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:02,719 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:02,719 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:02,725 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (70)] Ended with exit code 0 [2025-04-13 23:06:02,919 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable100,70 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:02,919 INFO L403 AbstractCegarLoop]: === Iteration 102 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:02,920 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:02,920 INFO L85 PathProgramCache]: Analyzing trace with hash -811722450, now seen corresponding path program 63 times [2025-04-13 23:06:02,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:02,920 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848565111] [2025-04-13 23:06:02,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:02,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:02,924 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:02,928 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:02,928 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:06:02,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:03,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:03,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:03,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848565111] [2025-04-13 23:06:03,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848565111] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:03,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [162159945] [2025-04-13 23:06:03,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:03,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:03,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:03,217 INFO L229 MonitoredProcess]: Starting monitored process 71 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:03,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Waiting until timeout for monitored process [2025-04-13 23:06:03,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:03,295 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:03,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:06:03,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:03,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:06:03,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:03,715 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:03,715 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:06:03,898 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:03,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:04,295 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:04,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:06:04,588 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:04,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [162159945] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:04,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:04,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:06:04,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298942365] [2025-04-13 23:06:04,588 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:04,588 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:06:04,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:04,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:06:04,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=949, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:06:04,589 INFO L87 Difference]: Start difference. First operand 1174 states and 4071 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:07,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:07,020 INFO L93 Difference]: Finished difference Result 1391 states and 4701 transitions. [2025-04-13 23:06:07,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 23:06:07,020 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:07,020 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:07,023 INFO L225 Difference]: With dead ends: 1391 [2025-04-13 23:06:07,023 INFO L226 Difference]: Without dead ends: 1380 [2025-04-13 23:06:07,024 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=680, Invalid=4290, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 23:06:07,024 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 239 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2954 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 2954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:07,024 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 0 Invalid, 2980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 2954 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:06:07,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-04-13 23:06:07,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1180. [2025-04-13 23:06:07,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1179 states have (on average 3.469041560644614) internal successors, (4090), 1179 states have internal predecessors, (4090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:07,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 4090 transitions. [2025-04-13 23:06:07,037 INFO L79 Accepts]: Start accepts. Automaton has 1180 states and 4090 transitions. Word has length 25 [2025-04-13 23:06:07,037 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:07,037 INFO L485 AbstractCegarLoop]: Abstraction has 1180 states and 4090 transitions. [2025-04-13 23:06:07,037 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:07,038 INFO L278 IsEmpty]: Start isEmpty. Operand 1180 states and 4090 transitions. [2025-04-13 23:06:07,039 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:07,039 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:07,039 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:07,045 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (71)] Ended with exit code 0 [2025-04-13 23:06:07,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 71 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable101 [2025-04-13 23:06:07,239 INFO L403 AbstractCegarLoop]: === Iteration 103 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:07,240 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:07,240 INFO L85 PathProgramCache]: Analyzing trace with hash 157688738, now seen corresponding path program 64 times [2025-04-13 23:06:07,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:07,240 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917114189] [2025-04-13 23:06:07,240 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:07,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:07,243 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:07,247 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:07,247 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:07,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:07,584 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:07,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:07,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917114189] [2025-04-13 23:06:07,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917114189] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:07,584 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845053281] [2025-04-13 23:06:07,584 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:07,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:07,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:07,586 INFO L229 MonitoredProcess]: Starting monitored process 72 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:07,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Waiting until timeout for monitored process [2025-04-13 23:06:07,652 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:07,664 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:07,664 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:07,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:07,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:06:07,666 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:08,137 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:08,137 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:06:08,205 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:08,206 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:08,975 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:08,975 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:06:09,842 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:09,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845053281] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:09,842 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:09,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:06:09,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439019432] [2025-04-13 23:06:09,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:09,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:06:09,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:09,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:06:09,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:06:09,843 INFO L87 Difference]: Start difference. First operand 1180 states and 4090 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:15,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:15,209 INFO L93 Difference]: Finished difference Result 1492 states and 5005 transitions. [2025-04-13 23:06:15,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:06:15,210 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:15,210 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:15,213 INFO L225 Difference]: With dead ends: 1492 [2025-04-13 23:06:15,213 INFO L226 Difference]: Without dead ends: 1476 [2025-04-13 23:06:15,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1749 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=808, Invalid=5672, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 23:06:15,213 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 213 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2398 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 2398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:15,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 0 Invalid, 2465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 2398 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:06:15,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2025-04-13 23:06:15,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1182. [2025-04-13 23:06:15,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 3.4674005080440304) internal successors, (4095), 1181 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:15,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 4095 transitions. [2025-04-13 23:06:15,227 INFO L79 Accepts]: Start accepts. Automaton has 1182 states and 4095 transitions. Word has length 25 [2025-04-13 23:06:15,227 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:15,227 INFO L485 AbstractCegarLoop]: Abstraction has 1182 states and 4095 transitions. [2025-04-13 23:06:15,227 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:15,227 INFO L278 IsEmpty]: Start isEmpty. Operand 1182 states and 4095 transitions. [2025-04-13 23:06:15,228 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:15,228 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:15,228 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:15,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (72)] Ended with exit code 0 [2025-04-13 23:06:15,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 72 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable102 [2025-04-13 23:06:15,429 INFO L403 AbstractCegarLoop]: === Iteration 104 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:15,429 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:15,429 INFO L85 PathProgramCache]: Analyzing trace with hash 257451058, now seen corresponding path program 65 times [2025-04-13 23:06:15,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:15,429 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309645554] [2025-04-13 23:06:15,429 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:15,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:15,433 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:15,437 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:15,437 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:15,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:15,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:15,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309645554] [2025-04-13 23:06:15,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309645554] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:15,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703169114] [2025-04-13 23:06:15,973 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:15,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:15,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:15,975 INFO L229 MonitoredProcess]: Starting monitored process 73 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:15,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Waiting until timeout for monitored process [2025-04-13 23:06:16,042 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:16,055 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:16,055 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:16,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:16,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:06:16,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:16,462 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:16,462 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:06:16,529 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:16,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:16,971 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:16,971 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:06:17,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:17,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703169114] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:17,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:06:17,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 33 [2025-04-13 23:06:17,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239104549] [2025-04-13 23:06:17,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:17,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:06:17,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:17,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:06:17,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:06:17,896 INFO L87 Difference]: Start difference. First operand 1182 states and 4095 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:18,428 INFO L93 Difference]: Finished difference Result 1240 states and 4256 transitions. [2025-04-13 23:06:18,429 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:06:18,429 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:18,429 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:18,432 INFO L225 Difference]: With dead ends: 1240 [2025-04-13 23:06:18,432 INFO L226 Difference]: Without dead ends: 1234 [2025-04-13 23:06:18,432 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=204, Invalid=1436, Unknown=0, NotChecked=0, Total=1640 [2025-04-13 23:06:18,432 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 49 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:18,432 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 0 Invalid, 723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 714 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:06:18,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2025-04-13 23:06:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 1182. [2025-04-13 23:06:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 1181 states have (on average 3.4674005080440304) internal successors, (4095), 1181 states have internal predecessors, (4095), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 4095 transitions. [2025-04-13 23:06:18,446 INFO L79 Accepts]: Start accepts. Automaton has 1182 states and 4095 transitions. Word has length 25 [2025-04-13 23:06:18,446 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:18,446 INFO L485 AbstractCegarLoop]: Abstraction has 1182 states and 4095 transitions. [2025-04-13 23:06:18,446 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:18,446 INFO L278 IsEmpty]: Start isEmpty. Operand 1182 states and 4095 transitions. [2025-04-13 23:06:18,447 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:18,447 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:18,447 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:18,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (73)] Ended with exit code 0 [2025-04-13 23:06:18,647 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 73 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable103 [2025-04-13 23:06:18,648 INFO L403 AbstractCegarLoop]: === Iteration 105 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:18,648 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:18,648 INFO L85 PathProgramCache]: Analyzing trace with hash -851343268, now seen corresponding path program 66 times [2025-04-13 23:06:18,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:18,648 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145143021] [2025-04-13 23:06:18,648 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:18,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:18,652 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:18,655 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:18,655 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:06:18,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:19,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:19,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145143021] [2025-04-13 23:06:19,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145143021] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:19,052 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642349720] [2025-04-13 23:06:19,052 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:19,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:19,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:19,053 INFO L229 MonitoredProcess]: Starting monitored process 74 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:19,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Waiting until timeout for monitored process [2025-04-13 23:06:19,120 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:19,133 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:19,133 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:06:19,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:19,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:06:19,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:19,651 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:19,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:06:19,837 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:19,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:20,593 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:20,593 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:06:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:20,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642349720] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:20,850 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:20,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:06:20,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387224662] [2025-04-13 23:06:20,850 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:20,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:06:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:20,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:06:20,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1098, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:06:20,850 INFO L87 Difference]: Start difference. First operand 1182 states and 4095 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:25,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:25,752 INFO L93 Difference]: Finished difference Result 1507 states and 5048 transitions. [2025-04-13 23:06:25,752 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2025-04-13 23:06:25,752 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:25,752 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:25,756 INFO L225 Difference]: With dead ends: 1507 [2025-04-13 23:06:25,756 INFO L226 Difference]: Without dead ends: 1486 [2025-04-13 23:06:25,756 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2519 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=885, Invalid=7305, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:06:25,756 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 229 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3298 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:25,756 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 0 Invalid, 3381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3298 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:06:25,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2025-04-13 23:06:25,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1196. [2025-04-13 23:06:25,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 3.477824267782427) internal successors, (4156), 1195 states have internal predecessors, (4156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:25,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 4156 transitions. [2025-04-13 23:06:25,770 INFO L79 Accepts]: Start accepts. Automaton has 1196 states and 4156 transitions. Word has length 25 [2025-04-13 23:06:25,770 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:25,770 INFO L485 AbstractCegarLoop]: Abstraction has 1196 states and 4156 transitions. [2025-04-13 23:06:25,771 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:25,771 INFO L278 IsEmpty]: Start isEmpty. Operand 1196 states and 4156 transitions. [2025-04-13 23:06:25,772 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:25,772 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:25,772 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:25,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (74)] Ended with exit code 0 [2025-04-13 23:06:25,972 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable104,74 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:25,972 INFO L403 AbstractCegarLoop]: === Iteration 106 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:25,973 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:25,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1422240658, now seen corresponding path program 67 times [2025-04-13 23:06:25,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:25,973 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143981182] [2025-04-13 23:06:25,973 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:25,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:25,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:25,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:25,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:25,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:26,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:26,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:26,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143981182] [2025-04-13 23:06:26,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143981182] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:26,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [795256940] [2025-04-13 23:06:26,378 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:26,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:26,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:26,380 INFO L229 MonitoredProcess]: Starting monitored process 75 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:26,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Waiting until timeout for monitored process [2025-04-13 23:06:26,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:26,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:26,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:26,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:26,459 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:06:26,460 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:26,783 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:26,783 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:06:26,865 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:26,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:27,307 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:27,309 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:06:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:28,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [795256940] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:28,225 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:28,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:06:28,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301481258] [2025-04-13 23:06:28,225 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:28,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:06:28,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:28,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:06:28,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:06:28,226 INFO L87 Difference]: Start difference. First operand 1196 states and 4156 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:30,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:30,113 INFO L93 Difference]: Finished difference Result 1391 states and 4756 transitions. [2025-04-13 23:06:30,113 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:06:30,113 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:30,113 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:30,116 INFO L225 Difference]: With dead ends: 1391 [2025-04-13 23:06:30,116 INFO L226 Difference]: Without dead ends: 1380 [2025-04-13 23:06:30,116 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=570, Invalid=3462, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:06:30,117 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 191 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1855 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 1855 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:30,117 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 0 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 1855 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:06:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2025-04-13 23:06:30,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 1196. [2025-04-13 23:06:30,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 3.481171548117155) internal successors, (4160), 1195 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:30,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 4160 transitions. [2025-04-13 23:06:30,130 INFO L79 Accepts]: Start accepts. Automaton has 1196 states and 4160 transitions. Word has length 25 [2025-04-13 23:06:30,130 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:30,130 INFO L485 AbstractCegarLoop]: Abstraction has 1196 states and 4160 transitions. [2025-04-13 23:06:30,130 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:30,130 INFO L278 IsEmpty]: Start isEmpty. Operand 1196 states and 4160 transitions. [2025-04-13 23:06:30,132 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:30,132 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:30,132 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:30,138 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (75)] Ended with exit code 0 [2025-04-13 23:06:30,332 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable105,75 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:30,332 INFO L403 AbstractCegarLoop]: === Iteration 107 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:30,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:30,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1174041796, now seen corresponding path program 68 times [2025-04-13 23:06:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:30,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394459042] [2025-04-13 23:06:30,333 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:06:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:30,336 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:30,340 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:30,341 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:30,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:30,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:30,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:30,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394459042] [2025-04-13 23:06:30,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1394459042] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:30,730 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [979438370] [2025-04-13 23:06:30,730 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:06:30,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:30,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:30,732 INFO L229 MonitoredProcess]: Starting monitored process 76 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:30,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Waiting until timeout for monitored process [2025-04-13 23:06:30,798 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:30,811 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:30,811 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:30,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:30,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:06:30,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:31,294 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:31,295 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:06:31,454 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:31,455 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:32,288 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:32,288 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:06:32,540 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:32,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [979438370] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:32,541 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:32,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:06:32,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625632877] [2025-04-13 23:06:32,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:32,541 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:06:32,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:32,541 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:06:32,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:06:32,542 INFO L87 Difference]: Start difference. First operand 1196 states and 4160 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:37,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:37,718 INFO L93 Difference]: Finished difference Result 1526 states and 5213 transitions. [2025-04-13 23:06:37,718 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2025-04-13 23:06:37,718 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:37,718 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:37,722 INFO L225 Difference]: With dead ends: 1526 [2025-04-13 23:06:37,722 INFO L226 Difference]: Without dead ends: 1510 [2025-04-13 23:06:37,722 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2653 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=1015, Invalid=7541, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 23:06:37,723 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 297 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2267 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:37,723 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 0 Invalid, 2378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2267 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:06:37,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2025-04-13 23:06:37,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1192. [2025-04-13 23:06:37,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 3.4777497900923593) internal successors, (4142), 1191 states have internal predecessors, (4142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:37,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 4142 transitions. [2025-04-13 23:06:37,737 INFO L79 Accepts]: Start accepts. Automaton has 1192 states and 4142 transitions. Word has length 25 [2025-04-13 23:06:37,737 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:37,737 INFO L485 AbstractCegarLoop]: Abstraction has 1192 states and 4142 transitions. [2025-04-13 23:06:37,737 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:37,737 INFO L278 IsEmpty]: Start isEmpty. Operand 1192 states and 4142 transitions. [2025-04-13 23:06:37,738 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:37,738 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:37,738 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:37,744 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (76)] Ended with exit code 0 [2025-04-13 23:06:37,939 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 76 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable106 [2025-04-13 23:06:37,939 INFO L403 AbstractCegarLoop]: === Iteration 108 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:37,939 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:37,939 INFO L85 PathProgramCache]: Analyzing trace with hash -255354048, now seen corresponding path program 69 times [2025-04-13 23:06:37,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:37,939 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588023331] [2025-04-13 23:06:37,939 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:06:37,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:37,943 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:37,946 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:06:37,946 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:06:37,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:38,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:38,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:38,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588023331] [2025-04-13 23:06:38,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588023331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:06:38,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:06:38,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:06:38,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762249652] [2025-04-13 23:06:38,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:38,233 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:06:38,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:38,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:06:38,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:06:38,233 INFO L87 Difference]: Start difference. First operand 1192 states and 4142 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:38,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:38,631 INFO L93 Difference]: Finished difference Result 1316 states and 4574 transitions. [2025-04-13 23:06:38,631 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:06:38,631 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:38,631 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:38,634 INFO L225 Difference]: With dead ends: 1316 [2025-04-13 23:06:38,634 INFO L226 Difference]: Without dead ends: 1310 [2025-04-13 23:06:38,634 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=506, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:06:38,635 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 150 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 621 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 621 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:38,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 0 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 621 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:06:38,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-04-13 23:06:38,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1192. [2025-04-13 23:06:38,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1192 states, 1191 states have (on average 3.4777497900923593) internal successors, (4142), 1191 states have internal predecessors, (4142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:38,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1192 states to 1192 states and 4142 transitions. [2025-04-13 23:06:38,649 INFO L79 Accepts]: Start accepts. Automaton has 1192 states and 4142 transitions. Word has length 25 [2025-04-13 23:06:38,649 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:38,649 INFO L485 AbstractCegarLoop]: Abstraction has 1192 states and 4142 transitions. [2025-04-13 23:06:38,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:38,649 INFO L278 IsEmpty]: Start isEmpty. Operand 1192 states and 4142 transitions. [2025-04-13 23:06:38,650 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:38,650 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:38,650 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:38,650 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable107 [2025-04-13 23:06:38,650 INFO L403 AbstractCegarLoop]: === Iteration 109 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:38,651 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:38,651 INFO L85 PathProgramCache]: Analyzing trace with hash 527941632, now seen corresponding path program 70 times [2025-04-13 23:06:38,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:38,651 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318190903] [2025-04-13 23:06:38,651 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:38,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:38,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:38,658 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:38,658 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:38,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:38,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:38,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:38,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318190903] [2025-04-13 23:06:38,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318190903] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:38,953 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324062606] [2025-04-13 23:06:38,953 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:06:38,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:38,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:38,955 INFO L229 MonitoredProcess]: Starting monitored process 77 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:38,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Waiting until timeout for monitored process [2025-04-13 23:06:39,024 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:39,037 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:39,037 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:06:39,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:39,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:06:39,038 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:39,406 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:39,406 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:06:39,471 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:39,471 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:40,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:40,268 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 317 treesize of output 165 [2025-04-13 23:06:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:41,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324062606] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:41,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:41,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:06:41,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205086990] [2025-04-13 23:06:41,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:41,097 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:06:41,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:41,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:06:41,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=933, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:06:41,097 INFO L87 Difference]: Start difference. First operand 1192 states and 4142 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:48,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:48,293 INFO L93 Difference]: Finished difference Result 1536 states and 5207 transitions. [2025-04-13 23:06:48,293 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 23:06:48,293 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:48,294 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:48,297 INFO L225 Difference]: With dead ends: 1536 [2025-04-13 23:06:48,297 INFO L226 Difference]: Without dead ends: 1520 [2025-04-13 23:06:48,297 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3290 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=1232, Invalid=9480, Unknown=0, NotChecked=0, Total=10712 [2025-04-13 23:06:48,297 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2873 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 2873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:48,298 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 2946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 2873 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:06:48,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1520 states. [2025-04-13 23:06:48,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1520 to 1196. [2025-04-13 23:06:48,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 3.481171548117155) internal successors, (4160), 1195 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:48,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 4160 transitions. [2025-04-13 23:06:48,311 INFO L79 Accepts]: Start accepts. Automaton has 1196 states and 4160 transitions. Word has length 25 [2025-04-13 23:06:48,311 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:48,311 INFO L485 AbstractCegarLoop]: Abstraction has 1196 states and 4160 transitions. [2025-04-13 23:06:48,311 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:48,312 INFO L278 IsEmpty]: Start isEmpty. Operand 1196 states and 4160 transitions. [2025-04-13 23:06:48,313 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:48,313 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:48,313 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:48,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (77)] Ended with exit code 0 [2025-04-13 23:06:48,513 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable108,77 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:48,513 INFO L403 AbstractCegarLoop]: === Iteration 110 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:48,514 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:48,514 INFO L85 PathProgramCache]: Analyzing trace with hash -524136138, now seen corresponding path program 71 times [2025-04-13 23:06:48,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:48,514 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590892519] [2025-04-13 23:06:48,514 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:48,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:48,517 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:48,521 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:48,521 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:48,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:48,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:06:48,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:48,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590892519] [2025-04-13 23:06:48,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590892519] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:48,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973543491] [2025-04-13 23:06:48,962 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:06:48,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:48,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:48,964 INFO L229 MonitoredProcess]: Starting monitored process 78 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:48,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Waiting until timeout for monitored process [2025-04-13 23:06:49,032 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:49,045 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:49,045 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:06:49,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:49,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:06:49,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:49,470 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:49,470 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:06:49,536 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:49,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:49,930 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:49,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:06:50,763 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:50,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973543491] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:50,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:06:50,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 32 [2025-04-13 23:06:50,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700466451] [2025-04-13 23:06:50,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:06:50,764 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:06:50,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:50,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:06:50,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=972, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:06:50,764 INFO L87 Difference]: Start difference. First operand 1196 states and 4160 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:51,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:51,427 INFO L93 Difference]: Finished difference Result 1298 states and 4431 transitions. [2025-04-13 23:06:51,427 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:06:51,427 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:51,427 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:51,430 INFO L225 Difference]: With dead ends: 1298 [2025-04-13 23:06:51,430 INFO L226 Difference]: Without dead ends: 1292 [2025-04-13 23:06:51,430 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=222, Invalid=1584, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:06:51,431 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 66 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:51,431 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 0 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:06:51,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1292 states. [2025-04-13 23:06:51,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1292 to 1196. [2025-04-13 23:06:51,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 3.481171548117155) internal successors, (4160), 1195 states have internal predecessors, (4160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:51,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 4160 transitions. [2025-04-13 23:06:51,444 INFO L79 Accepts]: Start accepts. Automaton has 1196 states and 4160 transitions. Word has length 25 [2025-04-13 23:06:51,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:51,444 INFO L485 AbstractCegarLoop]: Abstraction has 1196 states and 4160 transitions. [2025-04-13 23:06:51,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:51,444 INFO L278 IsEmpty]: Start isEmpty. Operand 1196 states and 4160 transitions. [2025-04-13 23:06:51,446 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:51,446 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:51,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:51,452 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (78)] Ended with exit code 0 [2025-04-13 23:06:51,646 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable109,78 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:51,646 INFO L403 AbstractCegarLoop]: === Iteration 111 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:51,646 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:51,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2111327592, now seen corresponding path program 72 times [2025-04-13 23:06:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:51,647 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528766481] [2025-04-13 23:06:51,647 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:51,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:51,651 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:51,655 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:51,655 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:06:51,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:52,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:52,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:52,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528766481] [2025-04-13 23:06:52,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528766481] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:52,036 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809020050] [2025-04-13 23:06:52,036 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:06:52,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:52,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:52,038 INFO L229 MonitoredProcess]: Starting monitored process 79 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:52,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Waiting until timeout for monitored process [2025-04-13 23:06:52,107 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:06:52,120 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:52,120 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:06:52,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:52,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:06:52,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:06:52,491 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:52,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:06:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:52,805 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:06:53,645 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:06:53,645 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:06:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:06:53,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809020050] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:06:53,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:06:53,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:06:53,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920410145] [2025-04-13 23:06:53,927 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:06:53,928 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:06:53,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:06:53,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:06:53,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1006, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:06:53,928 INFO L87 Difference]: Start difference. First operand 1196 states and 4160 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:06:59,027 INFO L93 Difference]: Finished difference Result 1577 states and 5492 transitions. [2025-04-13 23:06:59,028 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:06:59,028 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:06:59,028 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:06:59,031 INFO L225 Difference]: With dead ends: 1577 [2025-04-13 23:06:59,031 INFO L226 Difference]: Without dead ends: 1566 [2025-04-13 23:06:59,032 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1965 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=990, Invalid=5490, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 23:06:59,032 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 253 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2049 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 2049 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:06:59,032 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [253 Valid, 0 Invalid, 2165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 2049 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:06:59,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2025-04-13 23:06:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1210. [2025-04-13 23:06:59,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 3.4830438378825477) internal successors, (4211), 1209 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4211 transitions. [2025-04-13 23:06:59,046 INFO L79 Accepts]: Start accepts. Automaton has 1210 states and 4211 transitions. Word has length 25 [2025-04-13 23:06:59,047 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:06:59,047 INFO L485 AbstractCegarLoop]: Abstraction has 1210 states and 4211 transitions. [2025-04-13 23:06:59,047 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:06:59,047 INFO L278 IsEmpty]: Start isEmpty. Operand 1210 states and 4211 transitions. [2025-04-13 23:06:59,048 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:06:59,048 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:06:59,048 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:06:59,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (79)] Ended with exit code 0 [2025-04-13 23:06:59,248 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable110,79 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:59,249 INFO L403 AbstractCegarLoop]: === Iteration 112 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:06:59,249 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:06:59,249 INFO L85 PathProgramCache]: Analyzing trace with hash 750223016, now seen corresponding path program 73 times [2025-04-13 23:06:59,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:06:59,249 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198639476] [2025-04-13 23:06:59,249 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:59,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:06:59,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:59,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:59,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:59,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:59,670 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:06:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:06:59,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198639476] [2025-04-13 23:06:59,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198639476] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:06:59,671 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497261186] [2025-04-13 23:06:59,671 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:06:59,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:06:59,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:06:59,672 INFO L229 MonitoredProcess]: Starting monitored process 80 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:06:59,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Waiting until timeout for monitored process [2025-04-13 23:06:59,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:06:59,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:06:59,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:06:59,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:06:59,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:06:59,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:00,095 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:00,095 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:07:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:00,161 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:07:00,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497261186] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:07:00,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:07:00,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:07:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46801819] [2025-04-13 23:07:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:07:00,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:07:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:00,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:07:00,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=531, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:07:00,161 INFO L87 Difference]: Start difference. First operand 1210 states and 4211 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:00,392 INFO L93 Difference]: Finished difference Result 1276 states and 4390 transitions. [2025-04-13 23:07:00,392 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:07:00,392 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:00,392 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:00,395 INFO L225 Difference]: With dead ends: 1276 [2025-04-13 23:07:00,395 INFO L226 Difference]: Without dead ends: 1270 [2025-04-13 23:07:00,395 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=575, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:07:00,395 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:00,395 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:07:00,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2025-04-13 23:07:00,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1210. [2025-04-13 23:07:00,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 3.4830438378825477) internal successors, (4211), 1209 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:00,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 4211 transitions. [2025-04-13 23:07:00,408 INFO L79 Accepts]: Start accepts. Automaton has 1210 states and 4211 transitions. Word has length 25 [2025-04-13 23:07:00,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:00,408 INFO L485 AbstractCegarLoop]: Abstraction has 1210 states and 4211 transitions. [2025-04-13 23:07:00,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:00,408 INFO L278 IsEmpty]: Start isEmpty. Operand 1210 states and 4211 transitions. [2025-04-13 23:07:00,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:00,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:00,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:00,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (80)] Forceful destruction successful, exit code 0 [2025-04-13 23:07:00,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 80 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable111 [2025-04-13 23:07:00,610 INFO L403 AbstractCegarLoop]: === Iteration 113 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:00,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:00,610 INFO L85 PathProgramCache]: Analyzing trace with hash -78690010, now seen corresponding path program 74 times [2025-04-13 23:07:00,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:00,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677332969] [2025-04-13 23:07:00,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:00,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:00,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:00,618 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:00,618 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:00,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:00,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:00,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:00,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677332969] [2025-04-13 23:07:00,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677332969] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:00,958 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844422790] [2025-04-13 23:07:00,958 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:00,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:00,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:00,959 INFO L229 MonitoredProcess]: Starting monitored process 81 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:00,960 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Waiting until timeout for monitored process [2025-04-13 23:07:01,028 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:01,042 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:01,042 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:01,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:01,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:07:01,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:01,535 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:07:01,538 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:01,538 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 165 treesize of output 93 [2025-04-13 23:07:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:01,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:02,552 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:02,552 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 263 treesize of output 127 [2025-04-13 23:07:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:02,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844422790] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:02,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:02,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:07:02,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472727535] [2025-04-13 23:07:02,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:02,862 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:07:02,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:02,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:07:02,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:07:02,863 INFO L87 Difference]: Start difference. First operand 1210 states and 4211 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:07,199 INFO L93 Difference]: Finished difference Result 1532 states and 5368 transitions. [2025-04-13 23:07:07,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 23:07:07,199 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:07,199 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:07,202 INFO L225 Difference]: With dead ends: 1532 [2025-04-13 23:07:07,202 INFO L226 Difference]: Without dead ends: 1521 [2025-04-13 23:07:07,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1607 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=767, Invalid=4783, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:07:07,203 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 230 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:07,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 0 Invalid, 2508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:07:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2025-04-13 23:07:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 1196. [2025-04-13 23:07:07,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1196 states, 1195 states have (on average 3.482845188284519) internal successors, (4162), 1195 states have internal predecessors, (4162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:07,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1196 states to 1196 states and 4162 transitions. [2025-04-13 23:07:07,216 INFO L79 Accepts]: Start accepts. Automaton has 1196 states and 4162 transitions. Word has length 25 [2025-04-13 23:07:07,216 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:07,216 INFO L485 AbstractCegarLoop]: Abstraction has 1196 states and 4162 transitions. [2025-04-13 23:07:07,217 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:07,217 INFO L278 IsEmpty]: Start isEmpty. Operand 1196 states and 4162 transitions. [2025-04-13 23:07:07,218 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:07,218 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:07,218 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:07,224 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (81)] Ended with exit code 0 [2025-04-13 23:07:07,418 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 81 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable112 [2025-04-13 23:07:07,418 INFO L403 AbstractCegarLoop]: === Iteration 114 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:07,419 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:07,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1055873158, now seen corresponding path program 75 times [2025-04-13 23:07:07,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:07,419 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023724306] [2025-04-13 23:07:07,419 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:07:07,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:07,423 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:07,426 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:07:07,426 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:07:07,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:07,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:07,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:07,684 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023724306] [2025-04-13 23:07:07,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023724306] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:07:07,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:07:07,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:07:07,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459801966] [2025-04-13 23:07:07,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:07:07,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:07:07,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:07,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:07:07,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:07:07,684 INFO L87 Difference]: Start difference. First operand 1196 states and 4162 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:08,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:08,118 INFO L93 Difference]: Finished difference Result 1308 states and 4531 transitions. [2025-04-13 23:07:08,118 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:07:08,118 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:08,118 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:08,121 INFO L225 Difference]: With dead ends: 1308 [2025-04-13 23:07:08,121 INFO L226 Difference]: Without dead ends: 1302 [2025-04-13 23:07:08,122 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=496, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:07:08,122 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 86 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 964 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:08,122 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 0 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 964 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:07:08,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-04-13 23:07:08,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1204. [2025-04-13 23:07:08,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 3.481296758104738) internal successors, (4188), 1203 states have internal predecessors, (4188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 4188 transitions. [2025-04-13 23:07:08,135 INFO L79 Accepts]: Start accepts. Automaton has 1204 states and 4188 transitions. Word has length 25 [2025-04-13 23:07:08,135 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:08,135 INFO L485 AbstractCegarLoop]: Abstraction has 1204 states and 4188 transitions. [2025-04-13 23:07:08,135 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:08,135 INFO L278 IsEmpty]: Start isEmpty. Operand 1204 states and 4188 transitions. [2025-04-13 23:07:08,137 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:08,137 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:08,137 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:08,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable113 [2025-04-13 23:07:08,137 INFO L403 AbstractCegarLoop]: === Iteration 115 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:08,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:08,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1295098206, now seen corresponding path program 76 times [2025-04-13 23:07:08,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:08,137 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013832608] [2025-04-13 23:07:08,137 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:08,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:08,141 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:08,144 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:08,144 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:08,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:08,495 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:08,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:08,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013832608] [2025-04-13 23:07:08,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013832608] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:08,495 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186620531] [2025-04-13 23:07:08,495 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:08,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:08,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:08,497 INFO L229 MonitoredProcess]: Starting monitored process 82 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:08,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Waiting until timeout for monitored process [2025-04-13 23:07:08,567 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:08,580 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:08,580 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:08,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:08,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:07:08,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:09,032 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:09,032 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:07:09,092 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:09,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:09,792 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:09,793 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:07:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:10,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [186620531] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:10,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:10,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:07:10,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231789365] [2025-04-13 23:07:10,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:10,623 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:07:10,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:10,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:07:10,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:07:10,623 INFO L87 Difference]: Start difference. First operand 1204 states and 4188 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:17,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:17,854 INFO L93 Difference]: Finished difference Result 1527 states and 5174 transitions. [2025-04-13 23:07:17,854 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2025-04-13 23:07:17,854 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:17,854 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:17,857 INFO L225 Difference]: With dead ends: 1527 [2025-04-13 23:07:17,857 INFO L226 Difference]: Without dead ends: 1516 [2025-04-13 23:07:17,858 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3333 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=1170, Invalid=9960, Unknown=0, NotChecked=0, Total=11130 [2025-04-13 23:07:17,858 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 276 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3731 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 276 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 3731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:17,858 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [276 Valid, 0 Invalid, 3801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 3731 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 23:07:17,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2025-04-13 23:07:17,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1214. [2025-04-13 23:07:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 1213 states have (on average 3.4863973619126134) internal successors, (4229), 1213 states have internal predecessors, (4229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:17,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 4229 transitions. [2025-04-13 23:07:17,872 INFO L79 Accepts]: Start accepts. Automaton has 1214 states and 4229 transitions. Word has length 25 [2025-04-13 23:07:17,872 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:17,872 INFO L485 AbstractCegarLoop]: Abstraction has 1214 states and 4229 transitions. [2025-04-13 23:07:17,872 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:17,872 INFO L278 IsEmpty]: Start isEmpty. Operand 1214 states and 4229 transitions. [2025-04-13 23:07:17,873 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:17,873 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:17,873 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:17,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (82)] Forceful destruction successful, exit code 0 [2025-04-13 23:07:18,074 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 82 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable114 [2025-04-13 23:07:18,074 INFO L403 AbstractCegarLoop]: === Iteration 116 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:18,074 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:18,074 INFO L85 PathProgramCache]: Analyzing trace with hash 787091068, now seen corresponding path program 77 times [2025-04-13 23:07:18,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:18,074 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588144174] [2025-04-13 23:07:18,074 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:07:18,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:18,078 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:18,082 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:18,082 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:18,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:18,507 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:18,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:18,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588144174] [2025-04-13 23:07:18,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588144174] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:18,508 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665982317] [2025-04-13 23:07:18,508 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:07:18,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:18,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:18,510 INFO L229 MonitoredProcess]: Starting monitored process 83 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:18,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Waiting until timeout for monitored process [2025-04-13 23:07:18,588 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:18,602 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:18,602 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:18,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:18,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:07:18,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:18,970 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:18,970 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:07:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:19,038 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:19,488 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:19,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:07:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:20,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665982317] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:20,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:07:20,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 33 [2025-04-13 23:07:20,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721487643] [2025-04-13 23:07:20,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:07:20,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:07:20,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:20,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:07:20,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1024, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:07:20,304 INFO L87 Difference]: Start difference. First operand 1214 states and 4229 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:20,929 INFO L93 Difference]: Finished difference Result 1308 states and 4499 transitions. [2025-04-13 23:07:20,930 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:07:20,930 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:20,930 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:20,933 INFO L225 Difference]: With dead ends: 1308 [2025-04-13 23:07:20,933 INFO L226 Difference]: Without dead ends: 1302 [2025-04-13 23:07:20,933 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 451 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=220, Invalid=1502, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:07:20,933 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:20,933 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:07:20,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2025-04-13 23:07:20,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1212. [2025-04-13 23:07:20,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 1211 states have (on average 3.4880264244426096) internal successors, (4224), 1211 states have internal predecessors, (4224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:20,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 4224 transitions. [2025-04-13 23:07:20,947 INFO L79 Accepts]: Start accepts. Automaton has 1212 states and 4224 transitions. Word has length 25 [2025-04-13 23:07:20,947 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:20,947 INFO L485 AbstractCegarLoop]: Abstraction has 1212 states and 4224 transitions. [2025-04-13 23:07:20,947 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:20,947 INFO L278 IsEmpty]: Start isEmpty. Operand 1212 states and 4224 transitions. [2025-04-13 23:07:20,949 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:20,949 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:20,949 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:20,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (83)] Ended with exit code 0 [2025-04-13 23:07:21,149 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 83 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2025-04-13 23:07:21,149 INFO L403 AbstractCegarLoop]: === Iteration 117 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:21,150 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:21,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1563473684, now seen corresponding path program 78 times [2025-04-13 23:07:21,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:21,150 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980704963] [2025-04-13 23:07:21,150 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:07:21,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:21,153 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:21,157 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:21,157 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:07:21,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:21,556 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:21,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:21,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980704963] [2025-04-13 23:07:21,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980704963] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:21,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925797526] [2025-04-13 23:07:21,557 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:07:21,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:21,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:21,559 INFO L229 MonitoredProcess]: Starting monitored process 84 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:21,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Waiting until timeout for monitored process [2025-04-13 23:07:21,629 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:21,642 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:21,642 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:07:21,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:21,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:07:21,644 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:22,159 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:22,160 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:07:22,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:22,388 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:23,069 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:23,069 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:07:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:23,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925797526] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:23,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:23,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:07:23,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497955121] [2025-04-13 23:07:23,365 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:23,365 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:07:23,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:23,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:07:23,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:07:23,366 INFO L87 Difference]: Start difference. First operand 1212 states and 4224 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:29,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:29,720 INFO L93 Difference]: Finished difference Result 1589 states and 5354 transitions. [2025-04-13 23:07:29,720 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-13 23:07:29,720 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:29,720 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:29,723 INFO L225 Difference]: With dead ends: 1589 [2025-04-13 23:07:29,723 INFO L226 Difference]: Without dead ends: 1573 [2025-04-13 23:07:29,724 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2720 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1180, Invalid=7750, Unknown=0, NotChecked=0, Total=8930 [2025-04-13 23:07:29,724 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 218 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2454 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2571 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 2454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:29,724 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 0 Invalid, 2571 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 2454 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:07:29,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-04-13 23:07:29,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1218. [2025-04-13 23:07:29,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1218 states, 1217 states have (on average 3.4995891536565327) internal successors, (4259), 1217 states have internal predecessors, (4259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:29,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1218 states to 1218 states and 4259 transitions. [2025-04-13 23:07:29,738 INFO L79 Accepts]: Start accepts. Automaton has 1218 states and 4259 transitions. Word has length 25 [2025-04-13 23:07:29,738 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:29,738 INFO L485 AbstractCegarLoop]: Abstraction has 1218 states and 4259 transitions. [2025-04-13 23:07:29,738 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:29,738 INFO L278 IsEmpty]: Start isEmpty. Operand 1218 states and 4259 transitions. [2025-04-13 23:07:29,740 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:29,740 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:29,740 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:29,746 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (84)] Ended with exit code 0 [2025-04-13 23:07:29,940 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable116,84 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:29,940 INFO L403 AbstractCegarLoop]: === Iteration 118 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:29,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:29,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1121472796, now seen corresponding path program 79 times [2025-04-13 23:07:29,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:29,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887700266] [2025-04-13 23:07:29,941 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:29,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:29,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:07:29,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:29,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:29,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:30,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:30,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887700266] [2025-04-13 23:07:30,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887700266] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:30,314 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [857352528] [2025-04-13 23:07:30,314 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:07:30,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:30,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:30,316 INFO L229 MonitoredProcess]: Starting monitored process 85 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:30,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Waiting until timeout for monitored process [2025-04-13 23:07:30,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:07:30,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:30,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:07:30,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:30,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:07:30,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:30,811 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:30,812 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:07:30,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:30,890 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:31,273 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:31,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:07:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:32,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [857352528] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:32,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:32,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:07:32,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216389818] [2025-04-13 23:07:32,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:32,119 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:07:32,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:32,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:07:32,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=976, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:07:32,120 INFO L87 Difference]: Start difference. First operand 1218 states and 4259 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:34,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:34,968 INFO L93 Difference]: Finished difference Result 1634 states and 5463 transitions. [2025-04-13 23:07:34,969 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2025-04-13 23:07:34,969 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:34,969 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:34,972 INFO L225 Difference]: With dead ends: 1634 [2025-04-13 23:07:34,972 INFO L226 Difference]: Without dead ends: 1613 [2025-04-13 23:07:34,973 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1472 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=686, Invalid=5166, Unknown=0, NotChecked=0, Total=5852 [2025-04-13 23:07:34,973 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 384 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2203 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 384 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 2203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:34,973 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [384 Valid, 0 Invalid, 2282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 2203 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:07:34,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1613 states. [2025-04-13 23:07:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1613 to 1249. [2025-04-13 23:07:34,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 3.5176282051282053) internal successors, (4390), 1248 states have internal predecessors, (4390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:34,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 4390 transitions. [2025-04-13 23:07:34,988 INFO L79 Accepts]: Start accepts. Automaton has 1249 states and 4390 transitions. Word has length 25 [2025-04-13 23:07:34,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:34,989 INFO L485 AbstractCegarLoop]: Abstraction has 1249 states and 4390 transitions. [2025-04-13 23:07:34,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:34,989 INFO L278 IsEmpty]: Start isEmpty. Operand 1249 states and 4390 transitions. [2025-04-13 23:07:34,990 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:34,990 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:34,990 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:34,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (85)] Ended with exit code 0 [2025-04-13 23:07:35,190 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable117,85 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:35,191 INFO L403 AbstractCegarLoop]: === Iteration 119 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:35,191 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash -1413631864, now seen corresponding path program 80 times [2025-04-13 23:07:35,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:35,191 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7131803] [2025-04-13 23:07:35,191 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:35,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:35,195 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:35,199 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:35,199 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:35,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:35,601 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:35,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:35,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7131803] [2025-04-13 23:07:35,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7131803] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:35,601 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1071152160] [2025-04-13 23:07:35,601 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:07:35,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:35,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:35,603 INFO L229 MonitoredProcess]: Starting monitored process 86 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:35,603 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Waiting until timeout for monitored process [2025-04-13 23:07:35,675 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:35,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:35,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:35,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:35,688 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:07:35,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:36,170 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:36,170 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:07:36,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:36,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:37,191 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:37,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 119 [2025-04-13 23:07:37,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:37,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1071152160] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:37,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:37,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:07:37,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803501708] [2025-04-13 23:07:37,461 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:37,461 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:07:37,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:37,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:07:37,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1075, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:07:37,461 INFO L87 Difference]: Start difference. First operand 1249 states and 4390 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:43,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:43,209 INFO L93 Difference]: Finished difference Result 1610 states and 5471 transitions. [2025-04-13 23:07:43,209 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:07:43,209 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:43,209 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:43,212 INFO L225 Difference]: With dead ends: 1610 [2025-04-13 23:07:43,212 INFO L226 Difference]: Without dead ends: 1599 [2025-04-13 23:07:43,213 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2603 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1071, Invalid=7119, Unknown=0, NotChecked=0, Total=8190 [2025-04-13 23:07:43,213 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 238 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2230 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 2230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:43,213 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 0 Invalid, 2350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 2230 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:07:43,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2025-04-13 23:07:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1249. [2025-04-13 23:07:43,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1248 states have (on average 3.5128205128205128) internal successors, (4384), 1248 states have internal predecessors, (4384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 4384 transitions. [2025-04-13 23:07:43,228 INFO L79 Accepts]: Start accepts. Automaton has 1249 states and 4384 transitions. Word has length 25 [2025-04-13 23:07:43,228 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:43,228 INFO L485 AbstractCegarLoop]: Abstraction has 1249 states and 4384 transitions. [2025-04-13 23:07:43,229 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:43,229 INFO L278 IsEmpty]: Start isEmpty. Operand 1249 states and 4384 transitions. [2025-04-13 23:07:43,230 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:43,230 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:43,230 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:43,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (86)] Ended with exit code 0 [2025-04-13 23:07:43,430 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 86 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable118 [2025-04-13 23:07:43,431 INFO L403 AbstractCegarLoop]: === Iteration 120 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:43,431 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:43,431 INFO L85 PathProgramCache]: Analyzing trace with hash 2097158534, now seen corresponding path program 81 times [2025-04-13 23:07:43,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:43,431 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598716299] [2025-04-13 23:07:43,431 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:07:43,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:43,435 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:43,439 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:43,439 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:07:43,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:43,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:43,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:43,862 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598716299] [2025-04-13 23:07:43,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598716299] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:43,863 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930817309] [2025-04-13 23:07:43,863 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:07:43,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:43,863 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:43,864 INFO L229 MonitoredProcess]: Starting monitored process 87 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:43,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Waiting until timeout for monitored process [2025-04-13 23:07:43,937 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:43,951 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:43,951 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:07:43,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:43,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:07:43,952 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:44,559 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:07:44,562 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:44,562 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:07:44,704 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:44,704 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:45,128 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:45,129 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:07:45,465 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:45,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930817309] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:45,465 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:45,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:07:45,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857158489] [2025-04-13 23:07:45,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:45,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:07:45,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:45,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:07:45,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:07:45,466 INFO L87 Difference]: Start difference. First operand 1249 states and 4384 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:48,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:48,160 INFO L93 Difference]: Finished difference Result 1737 states and 5943 transitions. [2025-04-13 23:07:48,161 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:07:48,161 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:48,161 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:48,164 INFO L225 Difference]: With dead ends: 1737 [2025-04-13 23:07:48,165 INFO L226 Difference]: Without dead ends: 1726 [2025-04-13 23:07:48,165 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1237 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=694, Invalid=3862, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 23:07:48,165 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 257 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2611 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 2611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:48,165 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 0 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 2611 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:07:48,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1726 states. [2025-04-13 23:07:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1726 to 1255. [2025-04-13 23:07:48,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1254 states have (on average 3.5207336523126) internal successors, (4415), 1254 states have internal predecessors, (4415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:48,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 4415 transitions. [2025-04-13 23:07:48,181 INFO L79 Accepts]: Start accepts. Automaton has 1255 states and 4415 transitions. Word has length 25 [2025-04-13 23:07:48,181 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:48,181 INFO L485 AbstractCegarLoop]: Abstraction has 1255 states and 4415 transitions. [2025-04-13 23:07:48,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:48,181 INFO L278 IsEmpty]: Start isEmpty. Operand 1255 states and 4415 transitions. [2025-04-13 23:07:48,183 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:48,183 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:48,183 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:48,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (87)] Ended with exit code 0 [2025-04-13 23:07:48,383 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable119,87 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:48,383 INFO L403 AbstractCegarLoop]: === Iteration 121 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:48,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1682413954, now seen corresponding path program 82 times [2025-04-13 23:07:48,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:48,384 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357573651] [2025-04-13 23:07:48,384 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:48,387 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:48,390 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:48,391 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:48,391 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:48,757 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:48,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:48,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357573651] [2025-04-13 23:07:48,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357573651] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:48,757 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1647499566] [2025-04-13 23:07:48,757 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:07:48,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:48,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:48,759 INFO L229 MonitoredProcess]: Starting monitored process 88 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:48,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Waiting until timeout for monitored process [2025-04-13 23:07:48,831 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:48,844 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:48,844 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:07:48,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:48,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:07:48,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:49,289 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:49,290 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:07:49,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:49,357 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:50,139 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:50,139 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 309 treesize of output 165 [2025-04-13 23:07:50,853 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:50,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1647499566] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:07:50,853 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:07:50,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:07:50,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540458808] [2025-04-13 23:07:50,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:07:50,853 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:07:50,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:50,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:07:50,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:07:50,854 INFO L87 Difference]: Start difference. First operand 1255 states and 4415 transitions. Second operand has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:56,422 INFO L93 Difference]: Finished difference Result 1534 states and 5270 transitions. [2025-04-13 23:07:56,423 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 23:07:56,423 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:56,423 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:56,426 INFO L225 Difference]: With dead ends: 1534 [2025-04-13 23:07:56,426 INFO L226 Difference]: Without dead ends: 1523 [2025-04-13 23:07:56,427 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1871 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=808, Invalid=6164, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:07:56,427 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 202 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2722 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2780 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 2722 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:56,427 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 0 Invalid, 2780 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 2722 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:07:56,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-04-13 23:07:56,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1253. [2025-04-13 23:07:56,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 3.5207667731629395) internal successors, (4408), 1252 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4408 transitions. [2025-04-13 23:07:56,441 INFO L79 Accepts]: Start accepts. Automaton has 1253 states and 4408 transitions. Word has length 25 [2025-04-13 23:07:56,441 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:56,441 INFO L485 AbstractCegarLoop]: Abstraction has 1253 states and 4408 transitions. [2025-04-13 23:07:56,441 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.03125) internal successors, (65), 32 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:56,441 INFO L278 IsEmpty]: Start isEmpty. Operand 1253 states and 4408 transitions. [2025-04-13 23:07:56,443 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:56,443 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:56,443 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:56,449 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (88)] Ended with exit code 0 [2025-04-13 23:07:56,643 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable120,88 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:56,643 INFO L403 AbstractCegarLoop]: === Iteration 122 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:07:56,643 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:07:56,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1138676460, now seen corresponding path program 83 times [2025-04-13 23:07:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:07:56,643 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637325833] [2025-04-13 23:07:56,644 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:07:56,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:07:56,647 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:56,651 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:56,651 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:56,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:57,171 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:07:57,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:07:57,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637325833] [2025-04-13 23:07:57,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637325833] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:57,171 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354510541] [2025-04-13 23:07:57,171 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:07:57,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:07:57,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:07:57,173 INFO L229 MonitoredProcess]: Starting monitored process 89 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:07:57,173 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Waiting until timeout for monitored process [2025-04-13 23:07:57,247 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:07:57,261 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:07:57,261 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:07:57,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:07:57,262 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:07:57,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:07:57,635 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:57,635 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:07:57,710 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:07:57,711 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:07:58,171 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:07:58,171 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:07:59,192 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:07:59,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354510541] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:07:59,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:07:59,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15, 12] total 33 [2025-04-13 23:07:59,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895557314] [2025-04-13 23:07:59,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:07:59,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:07:59,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:07:59,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:07:59,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:07:59,192 INFO L87 Difference]: Start difference. First operand 1253 states and 4408 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:07:59,917 INFO L93 Difference]: Finished difference Result 1363 states and 4774 transitions. [2025-04-13 23:07:59,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-13 23:07:59,917 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:07:59,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:07:59,920 INFO L225 Difference]: With dead ends: 1363 [2025-04-13 23:07:59,920 INFO L226 Difference]: Without dead ends: 1357 [2025-04-13 23:07:59,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=225, Invalid=1581, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:07:59,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 47 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:07:59,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 0 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:07:59,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2025-04-13 23:07:59,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 1253. [2025-04-13 23:07:59,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 3.5207667731629395) internal successors, (4408), 1252 states have internal predecessors, (4408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:59,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 4408 transitions. [2025-04-13 23:07:59,935 INFO L79 Accepts]: Start accepts. Automaton has 1253 states and 4408 transitions. Word has length 25 [2025-04-13 23:07:59,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:07:59,935 INFO L485 AbstractCegarLoop]: Abstraction has 1253 states and 4408 transitions. [2025-04-13 23:07:59,935 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:07:59,935 INFO L278 IsEmpty]: Start isEmpty. Operand 1253 states and 4408 transitions. [2025-04-13 23:07:59,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:07:59,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:07:59,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:07:59,943 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (89)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:00,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 89 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable121 [2025-04-13 23:08:00,137 INFO L403 AbstractCegarLoop]: === Iteration 123 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:00,137 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2072793384, now seen corresponding path program 84 times [2025-04-13 23:08:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:00,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984077417] [2025-04-13 23:08:00,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:00,141 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:00,145 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:00,146 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:00,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:00,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984077417] [2025-04-13 23:08:00,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984077417] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:00,524 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394278746] [2025-04-13 23:08:00,524 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:00,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:00,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:00,526 INFO L229 MonitoredProcess]: Starting monitored process 90 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:00,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Waiting until timeout for monitored process [2025-04-13 23:08:00,600 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:00,614 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:00,614 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:00,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:00,614 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:08:00,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:01,072 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:01,072 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:08:01,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:01,254 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:01,852 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:01,853 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 119 [2025-04-13 23:08:02,146 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:02,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394278746] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:02,146 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:02,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:08:02,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994941595] [2025-04-13 23:08:02,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:02,146 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:08:02,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:02,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:08:02,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:08:02,147 INFO L87 Difference]: Start difference. First operand 1253 states and 4408 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:04,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:04,435 INFO L93 Difference]: Finished difference Result 1426 states and 4909 transitions. [2025-04-13 23:08:04,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 23:08:04,436 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:04,436 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:04,439 INFO L225 Difference]: With dead ends: 1426 [2025-04-13 23:08:04,439 INFO L226 Difference]: Without dead ends: 1415 [2025-04-13 23:08:04,439 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1129 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=512, Invalid=3520, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:08:04,439 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 180 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2058 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 2058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:04,439 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 0 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 2058 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:08:04,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2025-04-13 23:08:04,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1263. [2025-04-13 23:08:04,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1263 states, 1262 states have (on average 3.523771790808241) internal successors, (4447), 1262 states have internal predecessors, (4447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1263 states to 1263 states and 4447 transitions. [2025-04-13 23:08:04,453 INFO L79 Accepts]: Start accepts. Automaton has 1263 states and 4447 transitions. Word has length 25 [2025-04-13 23:08:04,453 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:04,453 INFO L485 AbstractCegarLoop]: Abstraction has 1263 states and 4447 transitions. [2025-04-13 23:08:04,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:04,453 INFO L278 IsEmpty]: Start isEmpty. Operand 1263 states and 4447 transitions. [2025-04-13 23:08:04,455 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:04,455 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:04,455 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:04,461 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (90)] Ended with exit code 0 [2025-04-13 23:08:04,655 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 90 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable122 [2025-04-13 23:08:04,655 INFO L403 AbstractCegarLoop]: === Iteration 124 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:04,656 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:04,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1101808408, now seen corresponding path program 85 times [2025-04-13 23:08:04,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:04,656 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843724802] [2025-04-13 23:08:04,656 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:04,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:04,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:04,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:04,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:04,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:05,088 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:05,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:05,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843724802] [2025-04-13 23:08:05,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [843724802] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:05,088 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725004137] [2025-04-13 23:08:05,088 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:05,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:05,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:05,090 INFO L229 MonitoredProcess]: Starting monitored process 91 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:05,090 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Waiting until timeout for monitored process [2025-04-13 23:08:05,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:05,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:05,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:05,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:05,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:08:05,179 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:05,518 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:05,518 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:08:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:05,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:08:05,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1725004137] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:05,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:08:05,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:08:05,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591164838] [2025-04-13 23:08:05,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:05,580 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:08:05,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:05,581 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:08:05,581 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:08:05,581 INFO L87 Difference]: Start difference. First operand 1263 states and 4447 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:05,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:05,851 INFO L93 Difference]: Finished difference Result 1325 states and 4615 transitions. [2025-04-13 23:08:05,851 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:08:05,851 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:05,851 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:05,854 INFO L225 Difference]: With dead ends: 1325 [2025-04-13 23:08:05,854 INFO L226 Difference]: Without dead ends: 1319 [2025-04-13 23:08:05,854 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:08:05,855 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 695 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:05,855 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 695 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:05,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2025-04-13 23:08:05,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1261. [2025-04-13 23:08:05,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1260 states have (on average 3.5253968253968253) internal successors, (4442), 1260 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 4442 transitions. [2025-04-13 23:08:05,868 INFO L79 Accepts]: Start accepts. Automaton has 1261 states and 4442 transitions. Word has length 25 [2025-04-13 23:08:05,868 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:05,868 INFO L485 AbstractCegarLoop]: Abstraction has 1261 states and 4442 transitions. [2025-04-13 23:08:05,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:05,868 INFO L278 IsEmpty]: Start isEmpty. Operand 1261 states and 4442 transitions. [2025-04-13 23:08:05,870 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:05,870 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:05,870 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:05,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (91)] Ended with exit code 0 [2025-04-13 23:08:06,070 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 91 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable123 [2025-04-13 23:08:06,070 INFO L403 AbstractCegarLoop]: === Iteration 125 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:06,071 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:06,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1726298000, now seen corresponding path program 86 times [2025-04-13 23:08:06,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:06,071 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884752372] [2025-04-13 23:08:06,071 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:06,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:06,075 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:06,078 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:06,078 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:06,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:06,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:06,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884752372] [2025-04-13 23:08:06,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884752372] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:06,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247017304] [2025-04-13 23:08:06,474 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:06,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:06,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:06,476 INFO L229 MonitoredProcess]: Starting monitored process 92 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:06,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Waiting until timeout for monitored process [2025-04-13 23:08:06,551 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:06,564 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:06,564 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:06,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:06,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:08:06,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:07,011 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:07,011 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:08:07,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:07,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:07,752 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:07,752 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 119 [2025-04-13 23:08:08,090 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:08,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247017304] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:08,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:08,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:08:08,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502354562] [2025-04-13 23:08:08,090 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:08,090 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:08:08,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:08,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:08:08,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1030, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:08:08,090 INFO L87 Difference]: Start difference. First operand 1261 states and 4442 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:11,437 INFO L93 Difference]: Finished difference Result 1490 states and 5068 transitions. [2025-04-13 23:08:11,437 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-04-13 23:08:11,437 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:11,437 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:11,440 INFO L225 Difference]: With dead ends: 1490 [2025-04-13 23:08:11,440 INFO L226 Difference]: Without dead ends: 1469 [2025-04-13 23:08:11,441 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1482 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=659, Invalid=4597, Unknown=0, NotChecked=0, Total=5256 [2025-04-13 23:08:11,441 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 267 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2346 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 2346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:11,441 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 0 Invalid, 2406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 2346 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:08:11,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2025-04-13 23:08:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1259. [2025-04-13 23:08:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 3.52543720190779) internal successors, (4435), 1258 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 4435 transitions. [2025-04-13 23:08:11,455 INFO L79 Accepts]: Start accepts. Automaton has 1259 states and 4435 transitions. Word has length 25 [2025-04-13 23:08:11,455 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:11,455 INFO L485 AbstractCegarLoop]: Abstraction has 1259 states and 4435 transitions. [2025-04-13 23:08:11,455 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:11,455 INFO L278 IsEmpty]: Start isEmpty. Operand 1259 states and 4435 transitions. [2025-04-13 23:08:11,457 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:11,457 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:11,457 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:11,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (92)] Ended with exit code 0 [2025-04-13 23:08:11,657 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 92 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable124 [2025-04-13 23:08:11,657 INFO L403 AbstractCegarLoop]: === Iteration 126 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:11,658 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:11,658 INFO L85 PathProgramCache]: Analyzing trace with hash 11842550, now seen corresponding path program 87 times [2025-04-13 23:08:11,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:11,658 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012653106] [2025-04-13 23:08:11,658 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:11,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:11,662 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:11,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:08:11,665 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:08:11,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:11,972 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:11,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:11,972 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012653106] [2025-04-13 23:08:11,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012653106] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:11,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:11,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:08:11,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145591905] [2025-04-13 23:08:11,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:11,972 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:08:11,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:11,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:08:11,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:08:11,973 INFO L87 Difference]: Start difference. First operand 1259 states and 4435 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:12,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:12,282 INFO L93 Difference]: Finished difference Result 1323 states and 4646 transitions. [2025-04-13 23:08:12,282 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-13 23:08:12,282 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:12,282 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:12,286 INFO L225 Difference]: With dead ends: 1323 [2025-04-13 23:08:12,286 INFO L226 Difference]: Without dead ends: 1317 [2025-04-13 23:08:12,286 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:08:12,286 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 77 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:12,286 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 0 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:12,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2025-04-13 23:08:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 1259. [2025-04-13 23:08:12,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1259 states, 1258 states have (on average 3.52543720190779) internal successors, (4435), 1258 states have internal predecessors, (4435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:12,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1259 states to 1259 states and 4435 transitions. [2025-04-13 23:08:12,300 INFO L79 Accepts]: Start accepts. Automaton has 1259 states and 4435 transitions. Word has length 25 [2025-04-13 23:08:12,300 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:12,300 INFO L485 AbstractCegarLoop]: Abstraction has 1259 states and 4435 transitions. [2025-04-13 23:08:12,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:12,300 INFO L278 IsEmpty]: Start isEmpty. Operand 1259 states and 4435 transitions. [2025-04-13 23:08:12,301 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:12,301 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:12,301 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:12,301 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable125 [2025-04-13 23:08:12,302 INFO L403 AbstractCegarLoop]: === Iteration 127 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:12,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:12,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1498209692, now seen corresponding path program 88 times [2025-04-13 23:08:12,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:12,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026040117] [2025-04-13 23:08:12,302 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:12,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:12,305 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:12,309 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:12,309 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:12,309 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:12,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:12,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:12,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026040117] [2025-04-13 23:08:12,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026040117] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:12,646 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210472843] [2025-04-13 23:08:12,646 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:12,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:12,646 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:12,648 INFO L229 MonitoredProcess]: Starting monitored process 93 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:12,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Waiting until timeout for monitored process [2025-04-13 23:08:12,723 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:12,736 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:12,736 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:12,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:12,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:08:12,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:13,114 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:13,115 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:08:13,175 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:13,175 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:13,780 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:13,780 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:08:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:14,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210472843] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:14,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:14,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 31 [2025-04-13 23:08:14,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241129137] [2025-04-13 23:08:14,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:14,761 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:08:14,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:14,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:08:14,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=922, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:08:14,761 INFO L87 Difference]: Start difference. First operand 1259 states and 4435 transitions. Second operand has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:17,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:17,588 INFO L93 Difference]: Finished difference Result 1492 states and 5082 transitions. [2025-04-13 23:08:17,588 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:08:17,588 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:17,588 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:17,591 INFO L225 Difference]: With dead ends: 1492 [2025-04-13 23:08:17,591 INFO L226 Difference]: Without dead ends: 1481 [2025-04-13 23:08:17,592 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1067 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=498, Invalid=3534, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:08:17,592 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 221 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2917 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 2917 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:17,592 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 0 Invalid, 2955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 2917 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:08:17,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2025-04-13 23:08:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 1251. [2025-04-13 23:08:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 1250 states have (on average 3.5296) internal successors, (4412), 1250 states have internal predecessors, (4412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:17,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 4412 transitions. [2025-04-13 23:08:17,607 INFO L79 Accepts]: Start accepts. Automaton has 1251 states and 4412 transitions. Word has length 25 [2025-04-13 23:08:17,607 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:17,607 INFO L485 AbstractCegarLoop]: Abstraction has 1251 states and 4412 transitions. [2025-04-13 23:08:17,607 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0) internal successors, (64), 32 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:17,607 INFO L278 IsEmpty]: Start isEmpty. Operand 1251 states and 4412 transitions. [2025-04-13 23:08:17,609 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:17,609 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:17,609 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:17,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (93)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:17,809 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable126,93 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:17,810 INFO L403 AbstractCegarLoop]: === Iteration 128 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:17,810 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:17,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1191620214, now seen corresponding path program 89 times [2025-04-13 23:08:17,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:17,810 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104363130] [2025-04-13 23:08:17,810 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:17,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:17,814 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:17,818 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:17,818 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:17,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:18,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:18,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104363130] [2025-04-13 23:08:18,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104363130] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:18,208 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [612370691] [2025-04-13 23:08:18,208 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:18,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:18,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:18,210 INFO L229 MonitoredProcess]: Starting monitored process 94 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:18,210 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Waiting until timeout for monitored process [2025-04-13 23:08:18,285 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:18,297 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:18,298 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:18,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:18,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:08:18,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:18,710 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:18,710 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:08:18,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:18,769 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:19,207 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:19,208 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:08:20,052 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:20,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [612370691] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:20,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:08:20,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 32 [2025-04-13 23:08:20,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451591910] [2025-04-13 23:08:20,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:20,052 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:08:20,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:20,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:08:20,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:08:20,053 INFO L87 Difference]: Start difference. First operand 1251 states and 4412 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:20,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:20,801 INFO L93 Difference]: Finished difference Result 1388 states and 4865 transitions. [2025-04-13 23:08:20,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:08:20,802 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:20,802 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:20,805 INFO L225 Difference]: With dead ends: 1388 [2025-04-13 23:08:20,805 INFO L226 Difference]: Without dead ends: 1382 [2025-04-13 23:08:20,805 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=226, Invalid=1496, Unknown=0, NotChecked=0, Total=1722 [2025-04-13 23:08:20,806 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 54 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:20,806 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 0 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:08:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2025-04-13 23:08:20,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 1256. [2025-04-13 23:08:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 1255 states have (on average 3.5330677290836654) internal successors, (4434), 1255 states have internal predecessors, (4434), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:20,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 4434 transitions. [2025-04-13 23:08:20,821 INFO L79 Accepts]: Start accepts. Automaton has 1256 states and 4434 transitions. Word has length 25 [2025-04-13 23:08:20,821 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:20,821 INFO L485 AbstractCegarLoop]: Abstraction has 1256 states and 4434 transitions. [2025-04-13 23:08:20,821 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:20,821 INFO L278 IsEmpty]: Start isEmpty. Operand 1256 states and 4434 transitions. [2025-04-13 23:08:20,823 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:20,823 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:20,823 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:20,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (94)] Ended with exit code 0 [2025-04-13 23:08:21,023 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable127,94 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:21,023 INFO L403 AbstractCegarLoop]: === Iteration 129 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:21,023 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:21,023 INFO L85 PathProgramCache]: Analyzing trace with hash -103389216, now seen corresponding path program 90 times [2025-04-13 23:08:21,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:21,023 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966421874] [2025-04-13 23:08:21,024 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:21,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:21,028 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:21,032 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:21,032 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:21,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:21,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:21,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966421874] [2025-04-13 23:08:21,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966421874] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:21,297 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1703304484] [2025-04-13 23:08:21,297 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:21,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:21,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:21,299 INFO L229 MonitoredProcess]: Starting monitored process 95 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:21,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Waiting until timeout for monitored process [2025-04-13 23:08:21,375 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:21,389 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:21,389 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:21,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:21,389 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:08:21,390 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:21,841 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:21,842 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:08:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:21,987 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:22,421 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:22,421 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:08:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:22,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1703304484] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:22,722 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:22,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:08:22,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460960561] [2025-04-13 23:08:22,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:22,722 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:08:22,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:22,722 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:08:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1011, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:08:22,723 INFO L87 Difference]: Start difference. First operand 1256 states and 4434 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:26,367 INFO L93 Difference]: Finished difference Result 1690 states and 5705 transitions. [2025-04-13 23:08:26,367 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:08:26,367 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:26,368 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:26,371 INFO L225 Difference]: With dead ends: 1690 [2025-04-13 23:08:26,372 INFO L226 Difference]: Without dead ends: 1679 [2025-04-13 23:08:26,372 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2057 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=868, Invalid=6104, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:08:26,372 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 306 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:26,372 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 0 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:08:26,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2025-04-13 23:08:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 1266. [2025-04-13 23:08:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 3.5454545454545454) internal successors, (4485), 1265 states have internal predecessors, (4485), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:26,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 4485 transitions. [2025-04-13 23:08:26,388 INFO L79 Accepts]: Start accepts. Automaton has 1266 states and 4485 transitions. Word has length 25 [2025-04-13 23:08:26,389 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:26,389 INFO L485 AbstractCegarLoop]: Abstraction has 1266 states and 4485 transitions. [2025-04-13 23:08:26,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:26,389 INFO L278 IsEmpty]: Start isEmpty. Operand 1266 states and 4485 transitions. [2025-04-13 23:08:26,390 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:26,390 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:26,390 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:26,396 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (95)] Ended with exit code 0 [2025-04-13 23:08:26,591 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 95 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable128 [2025-04-13 23:08:26,591 INFO L403 AbstractCegarLoop]: === Iteration 130 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:26,591 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:26,591 INFO L85 PathProgramCache]: Analyzing trace with hash -537427120, now seen corresponding path program 91 times [2025-04-13 23:08:26,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:26,591 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348987854] [2025-04-13 23:08:26,591 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:26,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:26,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:26,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:26,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:26,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:27,048 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348987854] [2025-04-13 23:08:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348987854] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:27,049 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685159158] [2025-04-13 23:08:27,049 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:27,050 INFO L229 MonitoredProcess]: Starting monitored process 96 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:27,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Waiting until timeout for monitored process [2025-04-13 23:08:27,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:27,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:27,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:27,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:27,141 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:08:27,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:27,486 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 23:08:27,486 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:08:27,656 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:27,657 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:08:27,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685159158] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:27,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:08:27,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:08:27,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936944583] [2025-04-13 23:08:27,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:27,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:08:27,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:27,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:08:27,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=523, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:08:27,657 INFO L87 Difference]: Start difference. First operand 1266 states and 4485 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:27,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:27,952 INFO L93 Difference]: Finished difference Result 1379 states and 4866 transitions. [2025-04-13 23:08:27,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-13 23:08:27,952 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:27,952 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:27,955 INFO L225 Difference]: With dead ends: 1379 [2025-04-13 23:08:27,955 INFO L226 Difference]: Without dead ends: 1373 [2025-04-13 23:08:27,955 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=137, Invalid=565, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:08:27,955 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 675 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 677 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:27,955 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 677 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 675 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:08:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2025-04-13 23:08:27,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 1278. [2025-04-13 23:08:27,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 3.5489428347689898) internal successors, (4532), 1277 states have internal predecessors, (4532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:27,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 4532 transitions. [2025-04-13 23:08:27,970 INFO L79 Accepts]: Start accepts. Automaton has 1278 states and 4532 transitions. Word has length 25 [2025-04-13 23:08:27,970 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:27,970 INFO L485 AbstractCegarLoop]: Abstraction has 1278 states and 4532 transitions. [2025-04-13 23:08:27,970 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:27,970 INFO L278 IsEmpty]: Start isEmpty. Operand 1278 states and 4532 transitions. [2025-04-13 23:08:27,971 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:27,971 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:27,971 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:27,977 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (96)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:28,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 96 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable129 [2025-04-13 23:08:28,172 INFO L403 AbstractCegarLoop]: === Iteration 131 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:28,172 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:28,172 INFO L85 PathProgramCache]: Analyzing trace with hash -1332036644, now seen corresponding path program 92 times [2025-04-13 23:08:28,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:28,172 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648049228] [2025-04-13 23:08:28,172 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:28,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:28,176 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:28,180 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:28,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:28,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:28,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:28,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648049228] [2025-04-13 23:08:28,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648049228] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:28,528 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157834894] [2025-04-13 23:08:28,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:28,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:28,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:28,530 INFO L229 MonitoredProcess]: Starting monitored process 97 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:28,531 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Waiting until timeout for monitored process [2025-04-13 23:08:28,608 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:28,620 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:28,621 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:28,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:28,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:08:28,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:29,077 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:29,077 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:08:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:29,354 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:29,770 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:29,770 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:08:30,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:30,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157834894] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:30,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:30,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:08:30,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728828545] [2025-04-13 23:08:30,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:30,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:08:30,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:30,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:08:30,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:08:30,096 INFO L87 Difference]: Start difference. First operand 1278 states and 4532 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:35,898 INFO L93 Difference]: Finished difference Result 1835 states and 6181 transitions. [2025-04-13 23:08:35,898 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2025-04-13 23:08:35,898 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:35,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:35,903 INFO L225 Difference]: With dead ends: 1835 [2025-04-13 23:08:35,903 INFO L226 Difference]: Without dead ends: 1824 [2025-04-13 23:08:35,903 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4172 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1567, Invalid=10865, Unknown=0, NotChecked=0, Total=12432 [2025-04-13 23:08:35,903 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 283 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2896 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3006 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2896 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:35,904 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 0 Invalid, 3006 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2896 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:08:35,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1824 states. [2025-04-13 23:08:35,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1824 to 1278. [2025-04-13 23:08:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1278 states, 1277 states have (on average 3.553641346906813) internal successors, (4538), 1277 states have internal predecessors, (4538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:35,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 4538 transitions. [2025-04-13 23:08:35,920 INFO L79 Accepts]: Start accepts. Automaton has 1278 states and 4538 transitions. Word has length 25 [2025-04-13 23:08:35,920 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:35,920 INFO L485 AbstractCegarLoop]: Abstraction has 1278 states and 4538 transitions. [2025-04-13 23:08:35,921 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:35,921 INFO L278 IsEmpty]: Start isEmpty. Operand 1278 states and 4538 transitions. [2025-04-13 23:08:35,922 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:35,922 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:35,922 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:35,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (97)] Forceful destruction successful, exit code 0 [2025-04-13 23:08:36,122 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable130,97 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:36,123 INFO L403 AbstractCegarLoop]: === Iteration 132 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:36,123 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:36,123 INFO L85 PathProgramCache]: Analyzing trace with hash -56502664, now seen corresponding path program 93 times [2025-04-13 23:08:36,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:36,123 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593332535] [2025-04-13 23:08:36,123 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:08:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:36,127 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:36,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:08:36,130 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:08:36,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:36,510 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:36,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:36,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593332535] [2025-04-13 23:08:36,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593332535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:36,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:08:36,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:08:36,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605562164] [2025-04-13 23:08:36,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:36,511 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:08:36,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:36,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:08:36,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:08:36,511 INFO L87 Difference]: Start difference. First operand 1278 states and 4538 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:36,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:36,981 INFO L93 Difference]: Finished difference Result 1380 states and 4881 transitions. [2025-04-13 23:08:36,981 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:08:36,982 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:36,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:36,985 INFO L225 Difference]: With dead ends: 1380 [2025-04-13 23:08:36,985 INFO L226 Difference]: Without dead ends: 1374 [2025-04-13 23:08:36,985 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=110, Invalid=396, Unknown=0, NotChecked=0, Total=506 [2025-04-13 23:08:36,985 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 69 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:36,985 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 0 Invalid, 1010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:08:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2025-04-13 23:08:36,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 1284. [2025-04-13 23:08:36,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1284 states, 1283 states have (on average 3.55962587685113) internal successors, (4567), 1283 states have internal predecessors, (4567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:36,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1284 states to 1284 states and 4567 transitions. [2025-04-13 23:08:37,000 INFO L79 Accepts]: Start accepts. Automaton has 1284 states and 4567 transitions. Word has length 25 [2025-04-13 23:08:37,000 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:37,000 INFO L485 AbstractCegarLoop]: Abstraction has 1284 states and 4567 transitions. [2025-04-13 23:08:37,000 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:37,000 INFO L278 IsEmpty]: Start isEmpty. Operand 1284 states and 4567 transitions. [2025-04-13 23:08:37,002 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:37,002 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:37,002 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:37,002 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable131 [2025-04-13 23:08:37,002 INFO L403 AbstractCegarLoop]: === Iteration 133 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:37,002 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:37,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1848338126, now seen corresponding path program 94 times [2025-04-13 23:08:37,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:37,002 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108160307] [2025-04-13 23:08:37,002 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:37,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:37,006 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:37,010 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:37,010 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:37,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:37,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:37,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108160307] [2025-04-13 23:08:37,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108160307] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:37,275 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753261070] [2025-04-13 23:08:37,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:08:37,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:37,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:37,277 INFO L229 MonitoredProcess]: Starting monitored process 98 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:37,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Waiting until timeout for monitored process [2025-04-13 23:08:37,354 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:37,366 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:37,366 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:08:37,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:37,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:08:37,368 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:37,787 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:37,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:08:37,844 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:37,844 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:38,478 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:38,478 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:08:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:39,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753261070] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:39,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:39,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:08:39,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173527088] [2025-04-13 23:08:39,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:39,314 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:08:39,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:39,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:08:39,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:08:39,314 INFO L87 Difference]: Start difference. First operand 1284 states and 4567 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:44,088 INFO L93 Difference]: Finished difference Result 1654 states and 5659 transitions. [2025-04-13 23:08:44,089 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:08:44,089 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:44,089 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:44,092 INFO L225 Difference]: With dead ends: 1654 [2025-04-13 23:08:44,092 INFO L226 Difference]: Without dead ends: 1643 [2025-04-13 23:08:44,093 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2420 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=972, Invalid=7038, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 23:08:44,093 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 224 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2757 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:44,093 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 0 Invalid, 2829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2757 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:08:44,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-04-13 23:08:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1296. [2025-04-13 23:08:44,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 3.555984555984556) internal successors, (4605), 1295 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4605 transitions. [2025-04-13 23:08:44,109 INFO L79 Accepts]: Start accepts. Automaton has 1296 states and 4605 transitions. Word has length 25 [2025-04-13 23:08:44,109 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:44,109 INFO L485 AbstractCegarLoop]: Abstraction has 1296 states and 4605 transitions. [2025-04-13 23:08:44,109 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:44,109 INFO L278 IsEmpty]: Start isEmpty. Operand 1296 states and 4605 transitions. [2025-04-13 23:08:44,110 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:44,110 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:44,110 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:44,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (98)] Ended with exit code 0 [2025-04-13 23:08:44,311 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable132,98 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:44,311 INFO L403 AbstractCegarLoop]: === Iteration 134 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:44,311 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1773062432, now seen corresponding path program 95 times [2025-04-13 23:08:44,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:44,311 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280648246] [2025-04-13 23:08:44,311 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:44,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:44,315 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:44,318 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:44,318 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:44,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:44,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:44,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:44,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280648246] [2025-04-13 23:08:44,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1280648246] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:44,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145888529] [2025-04-13 23:08:44,813 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:08:44,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:44,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:44,814 INFO L229 MonitoredProcess]: Starting monitored process 99 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:44,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Waiting until timeout for monitored process [2025-04-13 23:08:44,893 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:44,906 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:44,906 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:44,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:44,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:08:44,907 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:45,274 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:45,274 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:08:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:45,346 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:45,784 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:45,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:08:46,632 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:46,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145888529] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:46,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:46,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:08:46,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726013779] [2025-04-13 23:08:46,632 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:46,632 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:08:46,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:46,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:08:46,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:08:46,633 INFO L87 Difference]: Start difference. First operand 1296 states and 4605 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:49,584 INFO L93 Difference]: Finished difference Result 1546 states and 5397 transitions. [2025-04-13 23:08:49,584 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 23:08:49,584 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:49,584 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:49,587 INFO L225 Difference]: With dead ends: 1546 [2025-04-13 23:08:49,587 INFO L226 Difference]: Without dead ends: 1535 [2025-04-13 23:08:49,588 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=537, Invalid=3369, Unknown=0, NotChecked=0, Total=3906 [2025-04-13 23:08:49,588 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 197 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2856 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 2856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:49,588 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 0 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 2856 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:08:49,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1535 states. [2025-04-13 23:08:49,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1535 to 1296. [2025-04-13 23:08:49,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1296 states, 1295 states have (on average 3.555984555984556) internal successors, (4605), 1295 states have internal predecessors, (4605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1296 states to 1296 states and 4605 transitions. [2025-04-13 23:08:49,603 INFO L79 Accepts]: Start accepts. Automaton has 1296 states and 4605 transitions. Word has length 25 [2025-04-13 23:08:49,603 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:49,603 INFO L485 AbstractCegarLoop]: Abstraction has 1296 states and 4605 transitions. [2025-04-13 23:08:49,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:49,604 INFO L278 IsEmpty]: Start isEmpty. Operand 1296 states and 4605 transitions. [2025-04-13 23:08:49,605 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:49,605 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:49,605 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:49,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (99)] Ended with exit code 0 [2025-04-13 23:08:49,806 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 99 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable133 [2025-04-13 23:08:49,806 INFO L403 AbstractCegarLoop]: === Iteration 135 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:49,806 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash -875608270, now seen corresponding path program 96 times [2025-04-13 23:08:49,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:49,806 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47955888] [2025-04-13 23:08:49,806 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:49,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:49,810 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:49,814 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:49,814 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:49,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:50,134 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:50,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:50,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47955888] [2025-04-13 23:08:50,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47955888] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:50,134 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1167208795] [2025-04-13 23:08:50,134 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:08:50,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:50,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:50,136 INFO L229 MonitoredProcess]: Starting monitored process 100 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:50,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Waiting until timeout for monitored process [2025-04-13 23:08:50,215 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:50,228 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:50,228 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:08:50,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:50,229 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:08:50,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:50,607 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:50,607 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:08:50,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:50,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:08:51,504 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:51,505 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:08:51,836 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:51,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1167208795] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:08:51,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:08:51,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:08:51,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121207541] [2025-04-13 23:08:51,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:08:51,837 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:08:51,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:51,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:08:51,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:08:51,837 INFO L87 Difference]: Start difference. First operand 1296 states and 4605 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:57,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:57,488 INFO L93 Difference]: Finished difference Result 1756 states and 6213 transitions. [2025-04-13 23:08:57,488 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2025-04-13 23:08:57,489 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:57,489 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:57,493 INFO L225 Difference]: With dead ends: 1756 [2025-04-13 23:08:57,493 INFO L226 Difference]: Without dead ends: 1745 [2025-04-13 23:08:57,493 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3078 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1409, Invalid=8293, Unknown=0, NotChecked=0, Total=9702 [2025-04-13 23:08:57,493 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 248 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2444 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2444 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:57,493 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 0 Invalid, 2580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2444 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:08:57,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2025-04-13 23:08:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1292. [2025-04-13 23:08:57,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1292 states, 1291 states have (on average 3.5515104570100697) internal successors, (4585), 1291 states have internal predecessors, (4585), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1292 states to 1292 states and 4585 transitions. [2025-04-13 23:08:57,510 INFO L79 Accepts]: Start accepts. Automaton has 1292 states and 4585 transitions. Word has length 25 [2025-04-13 23:08:57,510 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:57,510 INFO L485 AbstractCegarLoop]: Abstraction has 1292 states and 4585 transitions. [2025-04-13 23:08:57,510 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:57,510 INFO L278 IsEmpty]: Start isEmpty. Operand 1292 states and 4585 transitions. [2025-04-13 23:08:57,511 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:57,512 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:57,512 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:57,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (100)] Ended with exit code 0 [2025-04-13 23:08:57,712 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable134,100 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:57,712 INFO L403 AbstractCegarLoop]: === Iteration 136 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:57,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1831109446, now seen corresponding path program 97 times [2025-04-13 23:08:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:57,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220327587] [2025-04-13 23:08:57,712 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:57,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:57,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:57,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:57,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:57,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:58,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:08:58,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:58,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220327587] [2025-04-13 23:08:58,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220327587] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:58,122 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636768951] [2025-04-13 23:08:58,122 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:08:58,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:58,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:58,124 INFO L229 MonitoredProcess]: Starting monitored process 101 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:58,124 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Waiting until timeout for monitored process [2025-04-13 23:08:58,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:08:58,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:58,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:08:58,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:58,219 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:08:58,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:58,596 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:58,596 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:08:58,666 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:08:58,666 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:08:58,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636768951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:08:58,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:08:58,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:08:58,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798296004] [2025-04-13 23:08:58,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:08:58,666 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:08:58,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:08:58,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:08:58,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:08:58,667 INFO L87 Difference]: Start difference. First operand 1292 states and 4585 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:58,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:08:58,885 INFO L93 Difference]: Finished difference Result 1354 states and 4758 transitions. [2025-04-13 23:08:58,885 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:08:58,885 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:08:58,885 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:08:58,888 INFO L225 Difference]: With dead ends: 1354 [2025-04-13 23:08:58,888 INFO L226 Difference]: Without dead ends: 1348 [2025-04-13 23:08:58,889 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:08:58,889 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:08:58,889 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:08:58,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2025-04-13 23:08:58,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 1294. [2025-04-13 23:08:58,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 3.5498839907192576) internal successors, (4590), 1293 states have internal predecessors, (4590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:58,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 4590 transitions. [2025-04-13 23:08:58,903 INFO L79 Accepts]: Start accepts. Automaton has 1294 states and 4590 transitions. Word has length 25 [2025-04-13 23:08:58,903 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:08:58,903 INFO L485 AbstractCegarLoop]: Abstraction has 1294 states and 4590 transitions. [2025-04-13 23:08:58,903 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:08:58,903 INFO L278 IsEmpty]: Start isEmpty. Operand 1294 states and 4590 transitions. [2025-04-13 23:08:58,905 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:08:58,905 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:08:58,905 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:08:58,911 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (101)] Ended with exit code 0 [2025-04-13 23:08:59,105 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 101 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable135 [2025-04-13 23:08:59,105 INFO L403 AbstractCegarLoop]: === Iteration 137 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:08:59,106 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:08:59,106 INFO L85 PathProgramCache]: Analyzing trace with hash -569958128, now seen corresponding path program 98 times [2025-04-13 23:08:59,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:08:59,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366135362] [2025-04-13 23:08:59,106 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:59,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:08:59,110 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:59,114 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:59,114 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:59,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:08:59,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:08:59,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366135362] [2025-04-13 23:08:59,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366135362] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:08:59,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018941560] [2025-04-13 23:08:59,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:08:59,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:08:59,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:08:59,508 INFO L229 MonitoredProcess]: Starting monitored process 102 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:08:59,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Waiting until timeout for monitored process [2025-04-13 23:08:59,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:08:59,601 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:08:59,601 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:08:59,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:08:59,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:08:59,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:08:59,979 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:08:59,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 101 [2025-04-13 23:09:00,242 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:00,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:00,927 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:00,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:09:01,220 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:01,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018941560] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:01,220 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:01,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 35 [2025-04-13 23:09:01,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894761547] [2025-04-13 23:09:01,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:01,221 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:09:01,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:01,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:09:01,221 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=1123, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:09:01,221 INFO L87 Difference]: Start difference. First operand 1294 states and 4590 transitions. Second operand has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:06,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:06,923 INFO L93 Difference]: Finished difference Result 1762 states and 6227 transitions. [2025-04-13 23:09:06,923 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2025-04-13 23:09:06,923 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:06,923 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:06,927 INFO L225 Difference]: With dead ends: 1762 [2025-04-13 23:09:06,927 INFO L226 Difference]: Without dead ends: 1751 [2025-04-13 23:09:06,928 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3245 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1447, Invalid=8855, Unknown=0, NotChecked=0, Total=10302 [2025-04-13 23:09:06,928 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:06,928 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 2485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:09:06,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2025-04-13 23:09:06,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1288. [2025-04-13 23:09:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1288 states, 1287 states have (on average 3.5563325563325563) internal successors, (4577), 1287 states have internal predecessors, (4577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1288 states to 1288 states and 4577 transitions. [2025-04-13 23:09:06,944 INFO L79 Accepts]: Start accepts. Automaton has 1288 states and 4577 transitions. Word has length 25 [2025-04-13 23:09:06,944 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:06,944 INFO L485 AbstractCegarLoop]: Abstraction has 1288 states and 4577 transitions. [2025-04-13 23:09:06,944 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.7777777777777777) internal successors, (64), 36 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:06,944 INFO L278 IsEmpty]: Start isEmpty. Operand 1288 states and 4577 transitions. [2025-04-13 23:09:06,945 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:06,945 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:06,945 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:06,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (102)] Ended with exit code 0 [2025-04-13 23:09:07,146 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 102 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable136 [2025-04-13 23:09:07,146 INFO L403 AbstractCegarLoop]: === Iteration 138 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:07,146 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash -117364360, now seen corresponding path program 99 times [2025-04-13 23:09:07,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:07,146 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590501069] [2025-04-13 23:09:07,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:07,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:07,150 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:07,153 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:07,153 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:07,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:07,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:07,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590501069] [2025-04-13 23:09:07,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590501069] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:07,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744914652] [2025-04-13 23:09:07,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:07,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:07,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:07,463 INFO L229 MonitoredProcess]: Starting monitored process 103 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:07,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Waiting until timeout for monitored process [2025-04-13 23:09:07,543 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:07,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:07,555 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:07,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:07,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:07,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:07,927 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:07,927 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:09:08,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:08,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:08,650 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:08,651 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:09:08,945 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:08,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744914652] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:08,945 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:08,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:09:08,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803904580] [2025-04-13 23:09:08,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:08,946 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:09:08,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:08,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:09:08,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=208, Invalid=914, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:09:08,946 INFO L87 Difference]: Start difference. First operand 1288 states and 4577 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:12,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:12,072 INFO L93 Difference]: Finished difference Result 1672 states and 5863 transitions. [2025-04-13 23:09:12,072 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:09:12,072 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:12,072 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:12,076 INFO L225 Difference]: With dead ends: 1672 [2025-04-13 23:09:12,076 INFO L226 Difference]: Without dead ends: 1661 [2025-04-13 23:09:12,077 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1097, Invalid=5875, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:09:12,077 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 272 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2025 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 2025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:12,077 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 0 Invalid, 2102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 2025 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:09:12,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-04-13 23:09:12,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1298. [2025-04-13 23:09:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 3.558982266769468) internal successors, (4616), 1297 states have internal predecessors, (4616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4616 transitions. [2025-04-13 23:09:12,093 INFO L79 Accepts]: Start accepts. Automaton has 1298 states and 4616 transitions. Word has length 25 [2025-04-13 23:09:12,093 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:12,093 INFO L485 AbstractCegarLoop]: Abstraction has 1298 states and 4616 transitions. [2025-04-13 23:09:12,093 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:12,093 INFO L278 IsEmpty]: Start isEmpty. Operand 1298 states and 4616 transitions. [2025-04-13 23:09:12,094 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:12,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:12,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:12,100 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (103)] Ended with exit code 0 [2025-04-13 23:09:12,295 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 103 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable137 [2025-04-13 23:09:12,295 INFO L403 AbstractCegarLoop]: === Iteration 139 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:12,295 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:12,295 INFO L85 PathProgramCache]: Analyzing trace with hash -114409174, now seen corresponding path program 100 times [2025-04-13 23:09:12,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:12,295 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118457980] [2025-04-13 23:09:12,295 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:12,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:12,299 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:12,303 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:12,303 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:12,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:12,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:12,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118457980] [2025-04-13 23:09:12,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118457980] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:12,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1747099376] [2025-04-13 23:09:12,571 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:12,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:12,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:12,573 INFO L229 MonitoredProcess]: Starting monitored process 104 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:12,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Waiting until timeout for monitored process [2025-04-13 23:09:12,654 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:12,667 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:12,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:12,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:12,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:12,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:13,069 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:13,069 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:09:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:13,132 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:13,711 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:13,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 385 treesize of output 169 [2025-04-13 23:09:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:14,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1747099376] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:14,567 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:14,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 30 [2025-04-13 23:09:14,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975254761] [2025-04-13 23:09:14,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:14,567 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:09:14,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:14,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:09:14,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=871, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:09:14,568 INFO L87 Difference]: Start difference. First operand 1298 states and 4616 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:18,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:18,917 INFO L93 Difference]: Finished difference Result 1600 states and 5510 transitions. [2025-04-13 23:09:18,917 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-04-13 23:09:18,917 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:18,917 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:18,921 INFO L225 Difference]: With dead ends: 1600 [2025-04-13 23:09:18,921 INFO L226 Difference]: Without dead ends: 1589 [2025-04-13 23:09:18,921 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1820 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=797, Invalid=5845, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:09:18,921 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 186 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2609 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 2609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:18,921 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 0 Invalid, 2673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 2609 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:09:18,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2025-04-13 23:09:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1298. [2025-04-13 23:09:18,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 3.558982266769468) internal successors, (4616), 1297 states have internal predecessors, (4616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:18,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4616 transitions. [2025-04-13 23:09:18,936 INFO L79 Accepts]: Start accepts. Automaton has 1298 states and 4616 transitions. Word has length 25 [2025-04-13 23:09:18,936 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:18,936 INFO L485 AbstractCegarLoop]: Abstraction has 1298 states and 4616 transitions. [2025-04-13 23:09:18,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:18,936 INFO L278 IsEmpty]: Start isEmpty. Operand 1298 states and 4616 transitions. [2025-04-13 23:09:18,938 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:18,938 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:18,938 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:18,944 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (104)] Ended with exit code 0 [2025-04-13 23:09:19,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable138,104 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:19,138 INFO L403 AbstractCegarLoop]: === Iteration 140 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:19,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:19,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1915273222, now seen corresponding path program 101 times [2025-04-13 23:09:19,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:19,139 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620637882] [2025-04-13 23:09:19,139 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:19,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:19,142 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:19,146 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:19,146 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:19,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:19,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:19,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:19,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620637882] [2025-04-13 23:09:19,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620637882] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:19,494 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1284675944] [2025-04-13 23:09:19,495 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:19,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:19,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:19,496 INFO L229 MonitoredProcess]: Starting monitored process 105 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:19,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Waiting until timeout for monitored process [2025-04-13 23:09:19,576 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:19,589 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:19,589 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:19,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:19,590 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-04-13 23:09:19,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:20,065 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:20,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:09:20,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:20,120 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:20,574 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:20,574 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:09:21,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:21,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1284675944] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:21,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:21,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 9] total 31 [2025-04-13 23:09:21,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125971186] [2025-04-13 23:09:21,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:21,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:09:21,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:21,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:09:21,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:09:21,379 INFO L87 Difference]: Start difference. First operand 1298 states and 4616 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:23,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:23,538 INFO L93 Difference]: Finished difference Result 1519 states and 5306 transitions. [2025-04-13 23:09:23,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:09:23,538 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:23,539 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:23,542 INFO L225 Difference]: With dead ends: 1519 [2025-04-13 23:09:23,542 INFO L226 Difference]: Without dead ends: 1508 [2025-04-13 23:09:23,542 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1173 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=524, Invalid=3766, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:09:23,543 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 154 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1825 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1868 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:23,543 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 0 Invalid, 1868 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1825 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:09:23,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states. [2025-04-13 23:09:23,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1294. [2025-04-13 23:09:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1294 states, 1293 states have (on average 3.5560711523588555) internal successors, (4598), 1293 states have internal predecessors, (4598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:23,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1294 states to 1294 states and 4598 transitions. [2025-04-13 23:09:23,558 INFO L79 Accepts]: Start accepts. Automaton has 1294 states and 4598 transitions. Word has length 25 [2025-04-13 23:09:23,558 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:23,558 INFO L485 AbstractCegarLoop]: Abstraction has 1294 states and 4598 transitions. [2025-04-13 23:09:23,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:23,558 INFO L278 IsEmpty]: Start isEmpty. Operand 1294 states and 4598 transitions. [2025-04-13 23:09:23,559 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:23,559 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:23,559 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:23,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (105)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:23,760 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable139,105 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:23,760 INFO L403 AbstractCegarLoop]: === Iteration 141 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:23,760 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:23,760 INFO L85 PathProgramCache]: Analyzing trace with hash -556438956, now seen corresponding path program 102 times [2025-04-13 23:09:23,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:23,760 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019238229] [2025-04-13 23:09:23,760 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:23,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:23,764 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:23,769 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:23,769 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:09:23,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:24,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019238229] [2025-04-13 23:09:24,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019238229] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:24,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [482522278] [2025-04-13 23:09:24,191 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:24,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:24,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:24,193 INFO L229 MonitoredProcess]: Starting monitored process 106 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:24,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Waiting until timeout for monitored process [2025-04-13 23:09:24,274 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:24,287 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:24,287 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:09:24,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:24,288 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:09:24,288 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:24,800 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:24,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:09:25,104 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:25,104 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:25,690 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:25,690 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 119 [2025-04-13 23:09:25,968 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:25,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [482522278] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:25,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:25,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:09:25,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622079992] [2025-04-13 23:09:25,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:25,968 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:09:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:25,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:09:25,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1074, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:09:25,969 INFO L87 Difference]: Start difference. First operand 1294 states and 4598 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:31,978 INFO L93 Difference]: Finished difference Result 1692 states and 5843 transitions. [2025-04-13 23:09:31,978 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2025-04-13 23:09:31,978 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:31,978 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:31,981 INFO L225 Difference]: With dead ends: 1692 [2025-04-13 23:09:31,982 INFO L226 Difference]: Without dead ends: 1676 [2025-04-13 23:09:31,982 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2646 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1121, Invalid=7435, Unknown=0, NotChecked=0, Total=8556 [2025-04-13 23:09:31,982 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 208 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2492 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 2492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:31,982 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 0 Invalid, 2676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 2492 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:09:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2025-04-13 23:09:31,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1300. [2025-04-13 23:09:31,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1300 states, 1299 states have (on average 3.569668976135489) internal successors, (4637), 1299 states have internal predecessors, (4637), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:31,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1300 states to 1300 states and 4637 transitions. [2025-04-13 23:09:31,998 INFO L79 Accepts]: Start accepts. Automaton has 1300 states and 4637 transitions. Word has length 25 [2025-04-13 23:09:31,998 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:31,998 INFO L485 AbstractCegarLoop]: Abstraction has 1300 states and 4637 transitions. [2025-04-13 23:09:31,998 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:31,998 INFO L278 IsEmpty]: Start isEmpty. Operand 1300 states and 4637 transitions. [2025-04-13 23:09:32,000 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:32,000 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:32,000 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:32,006 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (106)] Ended with exit code 0 [2025-04-13 23:09:32,200 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable140,106 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:32,200 INFO L403 AbstractCegarLoop]: === Iteration 142 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:32,200 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:32,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1523893654, now seen corresponding path program 103 times [2025-04-13 23:09:32,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:32,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075000152] [2025-04-13 23:09:32,201 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:32,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:32,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:32,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:32,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:32,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:32,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:32,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075000152] [2025-04-13 23:09:32,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075000152] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:32,616 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267302935] [2025-04-13 23:09:32,616 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:32,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:32,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:32,618 INFO L229 MonitoredProcess]: Starting monitored process 107 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:32,619 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Waiting until timeout for monitored process [2025-04-13 23:09:32,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:32,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:32,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:32,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:32,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:09:32,714 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:33,088 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:33,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:09:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:33,150 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:09:33,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267302935] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:33,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:09:33,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:09:33,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674533827] [2025-04-13 23:09:33,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:33,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:09:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:33,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:09:33,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:09:33,150 INFO L87 Difference]: Start difference. First operand 1300 states and 4637 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:33,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:33,373 INFO L93 Difference]: Finished difference Result 1360 states and 4805 transitions. [2025-04-13 23:09:33,373 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 23:09:33,374 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:33,374 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:33,376 INFO L225 Difference]: With dead ends: 1360 [2025-04-13 23:09:33,377 INFO L226 Difference]: Without dead ends: 1354 [2025-04-13 23:09:33,377 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:09:33,377 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 38 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:33,377 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 0 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:09:33,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2025-04-13 23:09:33,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1298. [2025-04-13 23:09:33,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1298 states, 1297 states have (on average 3.571318427139553) internal successors, (4632), 1297 states have internal predecessors, (4632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:33,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1298 states to 1298 states and 4632 transitions. [2025-04-13 23:09:33,392 INFO L79 Accepts]: Start accepts. Automaton has 1298 states and 4632 transitions. Word has length 25 [2025-04-13 23:09:33,393 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:33,393 INFO L485 AbstractCegarLoop]: Abstraction has 1298 states and 4632 transitions. [2025-04-13 23:09:33,393 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:33,393 INFO L278 IsEmpty]: Start isEmpty. Operand 1298 states and 4632 transitions. [2025-04-13 23:09:33,394 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:33,394 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:33,394 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:33,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (107)] Ended with exit code 0 [2025-04-13 23:09:33,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable141,107 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:33,595 INFO L403 AbstractCegarLoop]: === Iteration 143 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:33,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash 870858414, now seen corresponding path program 104 times [2025-04-13 23:09:33,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:33,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851210463] [2025-04-13 23:09:33,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:33,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:33,599 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:33,602 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:33,602 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:33,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:33,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:33,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:33,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851210463] [2025-04-13 23:09:33,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851210463] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:33,929 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945670208] [2025-04-13 23:09:33,929 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:33,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:33,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:33,931 INFO L229 MonitoredProcess]: Starting monitored process 108 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:33,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Waiting until timeout for monitored process [2025-04-13 23:09:34,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:34,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:34,026 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:34,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:34,026 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:34,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:34,411 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:09:34,417 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:34,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 99 [2025-04-13 23:09:34,737 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:34,737 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:35,334 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:35,335 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:09:35,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:35,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945670208] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:35,670 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:35,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:09:35,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881820743] [2025-04-13 23:09:35,670 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:35,670 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:09:35,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:35,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:09:35,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=989, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:09:35,670 INFO L87 Difference]: Start difference. First operand 1298 states and 4632 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:42,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:42,385 INFO L93 Difference]: Finished difference Result 1937 states and 6628 transitions. [2025-04-13 23:09:42,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2025-04-13 23:09:42,385 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:42,385 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:42,389 INFO L225 Difference]: With dead ends: 1937 [2025-04-13 23:09:42,389 INFO L226 Difference]: Without dead ends: 1921 [2025-04-13 23:09:42,389 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3542 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1417, Invalid=9503, Unknown=0, NotChecked=0, Total=10920 [2025-04-13 23:09:42,390 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 209 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2869 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 2869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:42,390 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 0 Invalid, 3015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 2869 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:09:42,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1921 states. [2025-04-13 23:09:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1921 to 1324. [2025-04-13 23:09:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 1323 states have (on average 3.6031746031746033) internal successors, (4767), 1323 states have internal predecessors, (4767), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 4767 transitions. [2025-04-13 23:09:42,407 INFO L79 Accepts]: Start accepts. Automaton has 1324 states and 4767 transitions. Word has length 25 [2025-04-13 23:09:42,408 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:42,408 INFO L485 AbstractCegarLoop]: Abstraction has 1324 states and 4767 transitions. [2025-04-13 23:09:42,408 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:42,408 INFO L278 IsEmpty]: Start isEmpty. Operand 1324 states and 4767 transitions. [2025-04-13 23:09:42,409 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:42,409 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:42,409 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:42,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (108)] Forceful destruction successful, exit code 0 [2025-04-13 23:09:42,609 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable142,108 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:42,610 INFO L403 AbstractCegarLoop]: === Iteration 144 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:42,610 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:42,610 INFO L85 PathProgramCache]: Analyzing trace with hash -536966148, now seen corresponding path program 105 times [2025-04-13 23:09:42,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:42,610 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422973516] [2025-04-13 23:09:42,610 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:42,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:42,614 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:42,616 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:09:42,617 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-13 23:09:42,617 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:42,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:42,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:42,951 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422973516] [2025-04-13 23:09:42,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422973516] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:42,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:42,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:09:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481816040] [2025-04-13 23:09:42,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:42,951 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:09:42,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:42,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:09:42,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:09:42,952 INFO L87 Difference]: Start difference. First operand 1324 states and 4767 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:43,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:43,425 INFO L93 Difference]: Finished difference Result 1412 states and 5051 transitions. [2025-04-13 23:09:43,425 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:09:43,425 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:43,425 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:43,428 INFO L225 Difference]: With dead ends: 1412 [2025-04-13 23:09:43,428 INFO L226 Difference]: Without dead ends: 1406 [2025-04-13 23:09:43,428 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:09:43,429 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 60 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:43,429 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 0 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 997 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:09:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2025-04-13 23:09:43,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 1326. [2025-04-13 23:09:43,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1326 states, 1325 states have (on average 3.6060377358490565) internal successors, (4778), 1325 states have internal predecessors, (4778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:43,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1326 states to 1326 states and 4778 transitions. [2025-04-13 23:09:43,444 INFO L79 Accepts]: Start accepts. Automaton has 1326 states and 4778 transitions. Word has length 25 [2025-04-13 23:09:43,444 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:43,444 INFO L485 AbstractCegarLoop]: Abstraction has 1326 states and 4778 transitions. [2025-04-13 23:09:43,444 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:43,444 INFO L278 IsEmpty]: Start isEmpty. Operand 1326 states and 4778 transitions. [2025-04-13 23:09:43,445 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:43,445 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:43,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:43,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable143 [2025-04-13 23:09:43,446 INFO L403 AbstractCegarLoop]: === Iteration 145 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:43,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash -836243840, now seen corresponding path program 106 times [2025-04-13 23:09:43,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:43,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860249416] [2025-04-13 23:09:43,446 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:43,450 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:43,453 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:43,453 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:43,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:43,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:43,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:43,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860249416] [2025-04-13 23:09:43,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860249416] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:43,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [785586458] [2025-04-13 23:09:43,656 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:43,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:43,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:43,657 INFO L229 MonitoredProcess]: Starting monitored process 109 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:43,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Waiting until timeout for monitored process [2025-04-13 23:09:43,740 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:43,753 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:43,753 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:43,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:43,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:43,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:44,116 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:44,116 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:09:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:44,190 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:44,562 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:44,563 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:09:45,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:45,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [785586458] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:45,438 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:45,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 28 [2025-04-13 23:09:45,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428490717] [2025-04-13 23:09:45,438 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:45,438 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 23:09:45,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:45,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 23:09:45,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:09:45,439 INFO L87 Difference]: Start difference. First operand 1326 states and 4778 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:47,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:47,362 INFO L93 Difference]: Finished difference Result 1545 states and 5455 transitions. [2025-04-13 23:09:47,362 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:09:47,362 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:47,362 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:47,366 INFO L225 Difference]: With dead ends: 1545 [2025-04-13 23:09:47,366 INFO L226 Difference]: Without dead ends: 1534 [2025-04-13 23:09:47,366 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 939 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=523, Invalid=3259, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 23:09:47,366 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 233 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:47,366 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 0 Invalid, 2305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:09:47,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1534 states. [2025-04-13 23:09:47,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1534 to 1354. [2025-04-13 23:09:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 3.6001478196600147) internal successors, (4871), 1353 states have internal predecessors, (4871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:47,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 4871 transitions. [2025-04-13 23:09:47,382 INFO L79 Accepts]: Start accepts. Automaton has 1354 states and 4871 transitions. Word has length 25 [2025-04-13 23:09:47,382 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:47,382 INFO L485 AbstractCegarLoop]: Abstraction has 1354 states and 4871 transitions. [2025-04-13 23:09:47,382 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:47,382 INFO L278 IsEmpty]: Start isEmpty. Operand 1354 states and 4871 transitions. [2025-04-13 23:09:47,384 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:47,384 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:47,384 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:47,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (109)] Ended with exit code 0 [2025-04-13 23:09:47,584 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable144,109 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:47,584 INFO L403 AbstractCegarLoop]: === Iteration 146 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:47,584 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:47,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2041441380, now seen corresponding path program 107 times [2025-04-13 23:09:47,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:47,585 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818862819] [2025-04-13 23:09:47,585 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:47,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:47,589 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:47,594 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:47,594 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:47,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:48,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818862819] [2025-04-13 23:09:48,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818862819] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:48,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103258164] [2025-04-13 23:09:48,233 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:48,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:48,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:48,235 INFO L229 MonitoredProcess]: Starting monitored process 110 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:48,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Waiting until timeout for monitored process [2025-04-13 23:09:48,319 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:48,332 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:48,332 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:48,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:48,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:09:48,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:48,749 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:48,749 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:09:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:48,814 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:49,267 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:49,267 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:09:50,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:50,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103258164] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:50,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:09:50,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14, 12] total 32 [2025-04-13 23:09:50,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305031249] [2025-04-13 23:09:50,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:50,137 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-13 23:09:50,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:50,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-13 23:09:50,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=959, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:09:50,137 INFO L87 Difference]: Start difference. First operand 1354 states and 4871 transitions. Second operand has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:50,983 INFO L93 Difference]: Finished difference Result 1488 states and 5310 transitions. [2025-04-13 23:09:50,984 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:09:50,984 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:50,984 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:50,987 INFO L225 Difference]: With dead ends: 1488 [2025-04-13 23:09:50,987 INFO L226 Difference]: Without dead ends: 1482 [2025-04-13 23:09:50,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2025-04-13 23:09:50,987 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 51 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 959 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:50,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 0 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 959 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-04-13 23:09:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2025-04-13 23:09:51,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 1354. [2025-04-13 23:09:51,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1354 states, 1353 states have (on average 3.6001478196600147) internal successors, (4871), 1353 states have internal predecessors, (4871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:51,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1354 states to 1354 states and 4871 transitions. [2025-04-13 23:09:51,013 INFO L79 Accepts]: Start accepts. Automaton has 1354 states and 4871 transitions. Word has length 25 [2025-04-13 23:09:51,013 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:51,013 INFO L485 AbstractCegarLoop]: Abstraction has 1354 states and 4871 transitions. [2025-04-13 23:09:51,013 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.4) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:51,013 INFO L278 IsEmpty]: Start isEmpty. Operand 1354 states and 4871 transitions. [2025-04-13 23:09:51,014 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:51,014 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:51,014 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:51,021 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (110)] Ended with exit code 0 [2025-04-13 23:09:51,215 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 110 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable145 [2025-04-13 23:09:51,215 INFO L403 AbstractCegarLoop]: === Iteration 147 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:51,215 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:51,215 INFO L85 PathProgramCache]: Analyzing trace with hash -2140292214, now seen corresponding path program 108 times [2025-04-13 23:09:51,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:51,215 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476338823] [2025-04-13 23:09:51,215 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:09:51,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:51,220 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:51,223 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:09:51,223 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:09:51,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:51,503 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:51,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:51,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476338823] [2025-04-13 23:09:51,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476338823] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:51,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:51,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:09:51,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096364208] [2025-04-13 23:09:51,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:51,504 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:09:51,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:51,504 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:09:51,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:09:51,504 INFO L87 Difference]: Start difference. First operand 1354 states and 4871 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:52,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:52,012 INFO L93 Difference]: Finished difference Result 1515 states and 5397 transitions. [2025-04-13 23:09:52,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:09:52,012 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:52,012 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:52,016 INFO L225 Difference]: With dead ends: 1515 [2025-04-13 23:09:52,016 INFO L226 Difference]: Without dead ends: 1509 [2025-04-13 23:09:52,016 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:09:52,016 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:52,016 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:09:52,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states. [2025-04-13 23:09:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1360. [2025-04-13 23:09:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1360 states, 1359 states have (on average 3.601177336276674) internal successors, (4894), 1359 states have internal predecessors, (4894), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 4894 transitions. [2025-04-13 23:09:52,032 INFO L79 Accepts]: Start accepts. Automaton has 1360 states and 4894 transitions. Word has length 25 [2025-04-13 23:09:52,033 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:52,033 INFO L485 AbstractCegarLoop]: Abstraction has 1360 states and 4894 transitions. [2025-04-13 23:09:52,033 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:52,033 INFO L278 IsEmpty]: Start isEmpty. Operand 1360 states and 4894 transitions. [2025-04-13 23:09:52,034 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:52,034 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:52,034 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:52,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable146 [2025-04-13 23:09:52,034 INFO L403 AbstractCegarLoop]: === Iteration 148 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:52,034 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:52,035 INFO L85 PathProgramCache]: Analyzing trace with hash 349262098, now seen corresponding path program 109 times [2025-04-13 23:09:52,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:52,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580981678] [2025-04-13 23:09:52,035 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:52,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:52,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:52,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:52,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:52,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:52,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:09:52,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:52,487 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580981678] [2025-04-13 23:09:52,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580981678] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:52,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758407733] [2025-04-13 23:09:52,488 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:09:52,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:52,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:52,489 INFO L229 MonitoredProcess]: Starting monitored process 111 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:52,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Waiting until timeout for monitored process [2025-04-13 23:09:52,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:09:52,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:52,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:09:52,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:52,587 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:09:52,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:52,934 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 23:09:52,934 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 91 [2025-04-13 23:09:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:53,104 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:09:53,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758407733] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:53,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:09:53,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 24 [2025-04-13 23:09:53,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135278737] [2025-04-13 23:09:53,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:53,104 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:09:53,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:53,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:09:53,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:09:53,104 INFO L87 Difference]: Start difference. First operand 1360 states and 4894 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:53,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:53,347 INFO L93 Difference]: Finished difference Result 1456 states and 5214 transitions. [2025-04-13 23:09:53,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:09:53,347 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:53,347 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:53,350 INFO L225 Difference]: With dead ends: 1456 [2025-04-13 23:09:53,350 INFO L226 Difference]: Without dead ends: 1450 [2025-04-13 23:09:53,351 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=155, Invalid=601, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:09:53,351 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 53 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:53,351 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 0 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:09:53,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-04-13 23:09:53,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1364. [2025-04-13 23:09:53,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1364 states, 1363 states have (on average 3.6023477622890683) internal successors, (4910), 1363 states have internal predecessors, (4910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:53,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1364 states to 1364 states and 4910 transitions. [2025-04-13 23:09:53,366 INFO L79 Accepts]: Start accepts. Automaton has 1364 states and 4910 transitions. Word has length 25 [2025-04-13 23:09:53,366 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:53,366 INFO L485 AbstractCegarLoop]: Abstraction has 1364 states and 4910 transitions. [2025-04-13 23:09:53,366 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:53,366 INFO L278 IsEmpty]: Start isEmpty. Operand 1364 states and 4910 transitions. [2025-04-13 23:09:53,367 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:53,367 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:53,368 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:53,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (111)] Ended with exit code 0 [2025-04-13 23:09:53,568 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 111 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable147 [2025-04-13 23:09:53,568 INFO L403 AbstractCegarLoop]: === Iteration 149 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:53,568 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:53,568 INFO L85 PathProgramCache]: Analyzing trace with hash 169333224, now seen corresponding path program 110 times [2025-04-13 23:09:53,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:53,568 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277942585] [2025-04-13 23:09:53,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:09:53,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:53,572 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:53,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:09:53,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:09:53,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:53,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:53,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:53,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277942585] [2025-04-13 23:09:53,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277942585] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:53,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:53,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:09:53,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182453509] [2025-04-13 23:09:53,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:53,807 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:09:53,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:53,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:09:53,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:09:53,807 INFO L87 Difference]: Start difference. First operand 1364 states and 4910 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:54,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:54,145 INFO L93 Difference]: Finished difference Result 1478 states and 5309 transitions. [2025-04-13 23:09:54,145 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 23:09:54,145 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:54,145 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:54,149 INFO L225 Difference]: With dead ends: 1478 [2025-04-13 23:09:54,149 INFO L226 Difference]: Without dead ends: 1472 [2025-04-13 23:09:54,149 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:09:54,150 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 104 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:54,150 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 0 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:09:54,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2025-04-13 23:09:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1358. [2025-04-13 23:09:54,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1357 states have (on average 3.6013264554163595) internal successors, (4887), 1357 states have internal predecessors, (4887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:54,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 4887 transitions. [2025-04-13 23:09:54,166 INFO L79 Accepts]: Start accepts. Automaton has 1358 states and 4887 transitions. Word has length 25 [2025-04-13 23:09:54,166 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:54,166 INFO L485 AbstractCegarLoop]: Abstraction has 1358 states and 4887 transitions. [2025-04-13 23:09:54,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:54,166 INFO L278 IsEmpty]: Start isEmpty. Operand 1358 states and 4887 transitions. [2025-04-13 23:09:54,168 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:54,168 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:54,168 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:54,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable148 [2025-04-13 23:09:54,168 INFO L403 AbstractCegarLoop]: === Iteration 150 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:54,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:54,168 INFO L85 PathProgramCache]: Analyzing trace with hash 2086454542, now seen corresponding path program 111 times [2025-04-13 23:09:54,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:54,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426125431] [2025-04-13 23:09:54,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:54,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:54,172 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:54,176 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:54,177 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:54,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:54,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:54,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426125431] [2025-04-13 23:09:54,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426125431] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:54,491 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519790106] [2025-04-13 23:09:54,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:09:54,491 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:54,491 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:54,493 INFO L229 MonitoredProcess]: Starting monitored process 112 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:54,493 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Waiting until timeout for monitored process [2025-04-13 23:09:54,578 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:54,590 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:54,591 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:09:54,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:54,591 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:09:54,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:55,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:09:55,130 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:55,130 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:09:55,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:55,275 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:09:55,822 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:55,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:09:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:56,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519790106] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:09:56,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:09:56,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:09:56,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682199992] [2025-04-13 23:09:56,141 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:09:56,141 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:09:56,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:56,142 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:09:56,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=969, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:09:56,142 INFO L87 Difference]: Start difference. First operand 1358 states and 4887 transitions. Second operand has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:57,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:57,673 INFO L93 Difference]: Finished difference Result 1788 states and 6127 transitions. [2025-04-13 23:09:57,673 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-04-13 23:09:57,673 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:57,673 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:57,677 INFO L225 Difference]: With dead ends: 1788 [2025-04-13 23:09:57,677 INFO L226 Difference]: Without dead ends: 1777 [2025-04-13 23:09:57,678 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 717 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=401, Invalid=2569, Unknown=0, NotChecked=0, Total=2970 [2025-04-13 23:09:57,678 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 332 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1683 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:57,678 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 0 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1683 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:09:57,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2025-04-13 23:09:57,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1390. [2025-04-13 23:09:57,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1389 states have (on average 3.5961123110151187) internal successors, (4995), 1389 states have internal predecessors, (4995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:57,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 4995 transitions. [2025-04-13 23:09:57,695 INFO L79 Accepts]: Start accepts. Automaton has 1390 states and 4995 transitions. Word has length 25 [2025-04-13 23:09:57,695 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:57,695 INFO L485 AbstractCegarLoop]: Abstraction has 1390 states and 4995 transitions. [2025-04-13 23:09:57,695 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.878787878787879) internal successors, (62), 33 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:57,695 INFO L278 IsEmpty]: Start isEmpty. Operand 1390 states and 4995 transitions. [2025-04-13 23:09:57,696 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:57,697 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:57,697 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:57,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (112)] Ended with exit code 0 [2025-04-13 23:09:57,897 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 112 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable149 [2025-04-13 23:09:57,897 INFO L403 AbstractCegarLoop]: === Iteration 151 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:57,897 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:57,897 INFO L85 PathProgramCache]: Analyzing trace with hash 474983366, now seen corresponding path program 112 times [2025-04-13 23:09:57,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:57,897 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287099539] [2025-04-13 23:09:57,897 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:09:57,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:57,901 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:57,904 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:57,904 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:09:57,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:58,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:58,118 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287099539] [2025-04-13 23:09:58,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287099539] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:09:58,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:09:58,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 23:09:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236417857] [2025-04-13 23:09:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:09:58,118 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:09:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:09:58,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:09:58,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:09:58,119 INFO L87 Difference]: Start difference. First operand 1390 states and 4995 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:58,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:09:58,440 INFO L93 Difference]: Finished difference Result 1519 states and 5449 transitions. [2025-04-13 23:09:58,440 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:09:58,441 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:09:58,441 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:09:58,444 INFO L225 Difference]: With dead ends: 1519 [2025-04-13 23:09:58,444 INFO L226 Difference]: Without dead ends: 1513 [2025-04-13 23:09:58,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=148, Invalid=404, Unknown=0, NotChecked=0, Total=552 [2025-04-13 23:09:58,445 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 98 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:09:58,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 0 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-04-13 23:09:58,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1513 states. [2025-04-13 23:09:58,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1513 to 1392. [2025-04-13 23:09:58,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1392 states, 1391 states have (on average 3.5945363048166787) internal successors, (5000), 1391 states have internal predecessors, (5000), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:58,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1392 states to 1392 states and 5000 transitions. [2025-04-13 23:09:58,460 INFO L79 Accepts]: Start accepts. Automaton has 1392 states and 5000 transitions. Word has length 25 [2025-04-13 23:09:58,460 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:09:58,460 INFO L485 AbstractCegarLoop]: Abstraction has 1392 states and 5000 transitions. [2025-04-13 23:09:58,460 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:09:58,460 INFO L278 IsEmpty]: Start isEmpty. Operand 1392 states and 5000 transitions. [2025-04-13 23:09:58,461 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:09:58,461 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:09:58,462 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:09:58,462 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable150 [2025-04-13 23:09:58,462 INFO L403 AbstractCegarLoop]: === Iteration 152 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:09:58,462 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:09:58,462 INFO L85 PathProgramCache]: Analyzing trace with hash 593268424, now seen corresponding path program 113 times [2025-04-13 23:09:58,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:09:58,462 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959398599] [2025-04-13 23:09:58,462 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:58,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:09:58,472 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:58,476 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:58,476 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:58,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:09:59,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:09:59,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959398599] [2025-04-13 23:09:59,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959398599] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:09:59,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [832385019] [2025-04-13 23:09:59,053 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:09:59,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:09:59,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:09:59,055 INFO L229 MonitoredProcess]: Starting monitored process 113 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:09:59,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Waiting until timeout for monitored process [2025-04-13 23:09:59,141 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:09:59,153 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:09:59,154 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:09:59,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:09:59,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:09:59,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:09:59,526 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:09:59,527 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:09:59,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:09:59,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:00,085 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:00,085 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:10:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [832385019] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:00,863 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:10:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144968198] [2025-04-13 23:10:00,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:00,863 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:00,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:00,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=996, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:00,863 INFO L87 Difference]: Start difference. First operand 1392 states and 5000 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:04,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:04,654 INFO L93 Difference]: Finished difference Result 2146 states and 7423 transitions. [2025-04-13 23:10:04,655 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 23:10:04,655 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:04,655 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:04,659 INFO L225 Difference]: With dead ends: 2146 [2025-04-13 23:10:04,659 INFO L226 Difference]: Without dead ends: 2130 [2025-04-13 23:10:04,660 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1719 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=723, Invalid=6083, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 23:10:04,660 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 419 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3195 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 3195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:04,660 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 0 Invalid, 3316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 3195 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:10:04,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2130 states. [2025-04-13 23:10:04,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2130 to 1436. [2025-04-13 23:10:04,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1436 states, 1435 states have (on average 3.5958188153310107) internal successors, (5160), 1435 states have internal predecessors, (5160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1436 states to 1436 states and 5160 transitions. [2025-04-13 23:10:04,678 INFO L79 Accepts]: Start accepts. Automaton has 1436 states and 5160 transitions. Word has length 25 [2025-04-13 23:10:04,679 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:04,679 INFO L485 AbstractCegarLoop]: Abstraction has 1436 states and 5160 transitions. [2025-04-13 23:10:04,679 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:04,679 INFO L278 IsEmpty]: Start isEmpty. Operand 1436 states and 5160 transitions. [2025-04-13 23:10:04,680 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:04,680 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:04,680 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:04,687 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (113)] Ended with exit code 0 [2025-04-13 23:10:04,881 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable151,113 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:04,881 INFO L403 AbstractCegarLoop]: === Iteration 153 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:04,881 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:04,881 INFO L85 PathProgramCache]: Analyzing trace with hash 206201276, now seen corresponding path program 114 times [2025-04-13 23:10:04,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:04,881 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653139916] [2025-04-13 23:10:04,881 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:10:04,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:04,885 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:04,888 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:04,888 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:10:04,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:05,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:05,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653139916] [2025-04-13 23:10:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653139916] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914208492] [2025-04-13 23:10:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:05,169 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:05,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:05,170 INFO L87 Difference]: Start difference. First operand 1436 states and 5160 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:05,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:05,630 INFO L93 Difference]: Finished difference Result 1546 states and 5541 transitions. [2025-04-13 23:10:05,630 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:10:05,630 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:05,630 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:05,634 INFO L225 Difference]: With dead ends: 1546 [2025-04-13 23:10:05,634 INFO L226 Difference]: Without dead ends: 1540 [2025-04-13 23:10:05,634 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2025-04-13 23:10:05,634 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 967 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:05,635 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 967 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:10:05,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1540 states. [2025-04-13 23:10:05,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1540 to 1442. [2025-04-13 23:10:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1442 states, 1441 states have (on average 3.5968077723802914) internal successors, (5183), 1441 states have internal predecessors, (5183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:05,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1442 states to 1442 states and 5183 transitions. [2025-04-13 23:10:05,652 INFO L79 Accepts]: Start accepts. Automaton has 1442 states and 5183 transitions. Word has length 25 [2025-04-13 23:10:05,652 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:05,652 INFO L485 AbstractCegarLoop]: Abstraction has 1442 states and 5183 transitions. [2025-04-13 23:10:05,652 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:05,652 INFO L278 IsEmpty]: Start isEmpty. Operand 1442 states and 5183 transitions. [2025-04-13 23:10:05,654 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:05,654 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:05,654 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:05,654 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable152 [2025-04-13 23:10:05,654 INFO L403 AbstractCegarLoop]: === Iteration 154 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:05,654 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:05,654 INFO L85 PathProgramCache]: Analyzing trace with hash -710779950, now seen corresponding path program 115 times [2025-04-13 23:10:05,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:05,654 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985452771] [2025-04-13 23:10:05,654 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:05,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:05,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:05,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:05,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:05,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:06,152 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:06,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985452771] [2025-04-13 23:10:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985452771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:06,152 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70767000] [2025-04-13 23:10:06,152 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:06,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:06,154 INFO L229 MonitoredProcess]: Starting monitored process 114 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:06,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Waiting until timeout for monitored process [2025-04-13 23:10:06,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:06,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:06,253 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:06,253 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:06,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:10:06,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:06,613 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:06,613 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:10:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:06,677 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:07,209 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:07,210 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:10:08,150 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:08,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70767000] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:08,150 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:10:08,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363376291] [2025-04-13 23:10:08,150 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:08,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:08,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:08,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:08,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:08,151 INFO L87 Difference]: Start difference. First operand 1442 states and 5183 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:11,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:11,768 INFO L93 Difference]: Finished difference Result 1820 states and 6473 transitions. [2025-04-13 23:10:11,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-04-13 23:10:11,768 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:11,768 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:11,772 INFO L225 Difference]: With dead ends: 1820 [2025-04-13 23:10:11,772 INFO L226 Difference]: Without dead ends: 1809 [2025-04-13 23:10:11,773 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=711, Invalid=5451, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 23:10:11,773 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 270 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4247 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 4247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:11,773 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 0 Invalid, 4323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 4247 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-04-13 23:10:11,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1809 states. [2025-04-13 23:10:11,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1809 to 1454. [2025-04-13 23:10:11,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1454 states, 1453 states have (on average 3.6001376462491397) internal successors, (5231), 1453 states have internal predecessors, (5231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:11,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1454 states to 1454 states and 5231 transitions. [2025-04-13 23:10:11,791 INFO L79 Accepts]: Start accepts. Automaton has 1454 states and 5231 transitions. Word has length 25 [2025-04-13 23:10:11,791 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:11,791 INFO L485 AbstractCegarLoop]: Abstraction has 1454 states and 5231 transitions. [2025-04-13 23:10:11,791 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:11,791 INFO L278 IsEmpty]: Start isEmpty. Operand 1454 states and 5231 transitions. [2025-04-13 23:10:11,793 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:11,793 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:11,793 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:11,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (114)] Ended with exit code 0 [2025-04-13 23:10:11,993 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable153,114 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:11,993 INFO L403 AbstractCegarLoop]: === Iteration 155 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:11,993 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:11,993 INFO L85 PathProgramCache]: Analyzing trace with hash -2056128438, now seen corresponding path program 116 times [2025-04-13 23:10:11,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:11,994 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756871085] [2025-04-13 23:10:11,994 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:10:11,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:11,997 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:12,000 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:12,000 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:10:12,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:12,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:12,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:12,363 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756871085] [2025-04-13 23:10:12,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756871085] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:12,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:12,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:12,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300451555] [2025-04-13 23:10:12,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:12,363 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:12,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:12,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:12,363 INFO L87 Difference]: Start difference. First operand 1454 states and 5231 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:12,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:12,813 INFO L93 Difference]: Finished difference Result 1571 states and 5611 transitions. [2025-04-13 23:10:12,813 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:10:12,813 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:12,813 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:12,816 INFO L225 Difference]: With dead ends: 1571 [2025-04-13 23:10:12,816 INFO L226 Difference]: Without dead ends: 1565 [2025-04-13 23:10:12,817 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=517, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:10:12,817 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 107 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:12,817 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 0 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:10:12,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2025-04-13 23:10:12,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1439. [2025-04-13 23:10:12,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1439 states, 1438 states have (on average 3.596662030598053) internal successors, (5172), 1438 states have internal predecessors, (5172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1439 states to 1439 states and 5172 transitions. [2025-04-13 23:10:12,832 INFO L79 Accepts]: Start accepts. Automaton has 1439 states and 5172 transitions. Word has length 25 [2025-04-13 23:10:12,833 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:12,833 INFO L485 AbstractCegarLoop]: Abstraction has 1439 states and 5172 transitions. [2025-04-13 23:10:12,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:12,833 INFO L278 IsEmpty]: Start isEmpty. Operand 1439 states and 5172 transitions. [2025-04-13 23:10:12,834 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:12,834 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:12,834 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:12,834 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable154 [2025-04-13 23:10:12,834 INFO L403 AbstractCegarLoop]: === Iteration 156 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:12,835 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:12,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1904495630, now seen corresponding path program 117 times [2025-04-13 23:10:12,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:12,835 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455025688] [2025-04-13 23:10:12,835 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:12,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:12,838 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:12,842 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:12,843 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:10:12,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:13,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:13,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:13,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455025688] [2025-04-13 23:10:13,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455025688] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:13,170 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371583117] [2025-04-13 23:10:13,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:13,170 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:13,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:13,171 INFO L229 MonitoredProcess]: Starting monitored process 115 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:13,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Waiting until timeout for monitored process [2025-04-13 23:10:13,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:13,279 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:13,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:10:13,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:13,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:10:13,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:13,636 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:13,636 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:10:13,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:13,870 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:14,453 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:14,453 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:10:14,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:14,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371583117] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:14,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:14,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:10:14,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697830969] [2025-04-13 23:10:14,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:14,740 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:14,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:14,740 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:14,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=935, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:14,740 INFO L87 Difference]: Start difference. First operand 1439 states and 5172 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:18,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:18,016 INFO L93 Difference]: Finished difference Result 1949 states and 6999 transitions. [2025-04-13 23:10:18,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2025-04-13 23:10:18,016 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:18,017 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:18,021 INFO L225 Difference]: With dead ends: 1949 [2025-04-13 23:10:18,021 INFO L226 Difference]: Without dead ends: 1938 [2025-04-13 23:10:18,021 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1649 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=1062, Invalid=4944, Unknown=0, NotChecked=0, Total=6006 [2025-04-13 23:10:18,021 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 281 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2048 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 2048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:18,021 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 0 Invalid, 2169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 2048 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:10:18,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-04-13 23:10:18,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1451. [2025-04-13 23:10:18,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1451 states, 1450 states have (on average 3.5944827586206896) internal successors, (5212), 1450 states have internal predecessors, (5212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:18,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1451 states to 1451 states and 5212 transitions. [2025-04-13 23:10:18,039 INFO L79 Accepts]: Start accepts. Automaton has 1451 states and 5212 transitions. Word has length 25 [2025-04-13 23:10:18,039 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:18,039 INFO L485 AbstractCegarLoop]: Abstraction has 1451 states and 5212 transitions. [2025-04-13 23:10:18,039 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:18,039 INFO L278 IsEmpty]: Start isEmpty. Operand 1451 states and 5212 transitions. [2025-04-13 23:10:18,041 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:18,041 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:18,041 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:18,047 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (115)] Ended with exit code 0 [2025-04-13 23:10:18,241 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 115 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable155 [2025-04-13 23:10:18,241 INFO L403 AbstractCegarLoop]: === Iteration 157 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:18,242 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:18,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1142302114, now seen corresponding path program 118 times [2025-04-13 23:10:18,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:18,242 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588018199] [2025-04-13 23:10:18,242 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:18,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:18,246 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:18,249 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:18,249 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:18,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:18,440 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:18,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:18,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588018199] [2025-04-13 23:10:18,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588018199] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:18,440 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [975093499] [2025-04-13 23:10:18,440 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:18,441 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:18,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:18,442 INFO L229 MonitoredProcess]: Starting monitored process 116 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:18,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Waiting until timeout for monitored process [2025-04-13 23:10:18,530 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:18,542 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:18,543 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:18,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:18,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:10:18,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:18,908 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:18,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:10:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:18,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:19,375 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:19,375 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:10:20,339 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:20,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [975093499] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:20,339 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:20,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 9] total 28 [2025-04-13 23:10:20,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851697297] [2025-04-13 23:10:20,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:20,339 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-04-13 23:10:20,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:20,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-04-13 23:10:20,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=749, Unknown=0, NotChecked=0, Total=870 [2025-04-13 23:10:20,340 INFO L87 Difference]: Start difference. First operand 1451 states and 5212 transitions. Second operand has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:22,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:22,280 INFO L93 Difference]: Finished difference Result 1719 states and 5974 transitions. [2025-04-13 23:10:22,281 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 23:10:22,281 INFO L79 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:22,281 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:22,285 INFO L225 Difference]: With dead ends: 1719 [2025-04-13 23:10:22,285 INFO L226 Difference]: Without dead ends: 1708 [2025-04-13 23:10:22,285 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 810 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=452, Invalid=2854, Unknown=0, NotChecked=0, Total=3306 [2025-04-13 23:10:22,285 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 193 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2825 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:22,285 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 0 Invalid, 2846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2825 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:10:22,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1708 states. [2025-04-13 23:10:22,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1708 to 1459. [2025-04-13 23:10:22,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1459 states, 1458 states have (on average 3.5912208504801097) internal successors, (5236), 1458 states have internal predecessors, (5236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1459 states to 1459 states and 5236 transitions. [2025-04-13 23:10:22,302 INFO L79 Accepts]: Start accepts. Automaton has 1459 states and 5236 transitions. Word has length 25 [2025-04-13 23:10:22,302 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:22,302 INFO L485 AbstractCegarLoop]: Abstraction has 1459 states and 5236 transitions. [2025-04-13 23:10:22,302 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 29 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:22,302 INFO L278 IsEmpty]: Start isEmpty. Operand 1459 states and 5236 transitions. [2025-04-13 23:10:22,304 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:22,304 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:22,304 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:22,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (116)] Ended with exit code 0 [2025-04-13 23:10:22,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 116 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable156 [2025-04-13 23:10:22,504 INFO L403 AbstractCegarLoop]: === Iteration 158 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:22,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:22,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1635713540, now seen corresponding path program 119 times [2025-04-13 23:10:22,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:22,505 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651517342] [2025-04-13 23:10:22,505 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:22,509 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:22,513 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:22,513 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:22,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:23,050 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:23,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:23,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651517342] [2025-04-13 23:10:23,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651517342] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:23,051 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1966585522] [2025-04-13 23:10:23,051 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:23,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:23,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:23,052 INFO L229 MonitoredProcess]: Starting monitored process 117 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:23,053 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Waiting until timeout for monitored process [2025-04-13 23:10:23,140 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:23,153 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:23,153 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:23,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:23,154 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-04-13 23:10:23,155 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:23,480 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:23,480 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:10:23,547 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:23,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:24,061 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:24,062 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:10:24,929 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:24,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1966585522] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:24,929 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:24,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:10:24,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890850891] [2025-04-13 23:10:24,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:24,930 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:24,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:24,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:24,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=990, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:24,930 INFO L87 Difference]: Start difference. First operand 1459 states and 5236 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:28,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:28,505 INFO L93 Difference]: Finished difference Result 2345 states and 8218 transitions. [2025-04-13 23:10:28,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-04-13 23:10:28,505 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:28,505 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:28,510 INFO L225 Difference]: With dead ends: 2345 [2025-04-13 23:10:28,510 INFO L226 Difference]: Without dead ends: 2329 [2025-04-13 23:10:28,510 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1464 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=639, Invalid=5061, Unknown=0, NotChecked=0, Total=5700 [2025-04-13 23:10:28,510 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 320 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3568 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 3568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:28,511 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 0 Invalid, 3682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 3568 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:10:28,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2329 states. [2025-04-13 23:10:28,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2329 to 1515. [2025-04-13 23:10:28,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1515 states, 1514 states have (on average 3.6215323645970936) internal successors, (5483), 1514 states have internal predecessors, (5483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:28,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1515 states to 1515 states and 5483 transitions. [2025-04-13 23:10:28,531 INFO L79 Accepts]: Start accepts. Automaton has 1515 states and 5483 transitions. Word has length 25 [2025-04-13 23:10:28,531 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:28,531 INFO L485 AbstractCegarLoop]: Abstraction has 1515 states and 5483 transitions. [2025-04-13 23:10:28,531 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:28,531 INFO L278 IsEmpty]: Start isEmpty. Operand 1515 states and 5483 transitions. [2025-04-13 23:10:28,532 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:28,533 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:28,533 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:28,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (117)] Ended with exit code 0 [2025-04-13 23:10:28,733 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 117 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable157 [2025-04-13 23:10:28,733 INFO L403 AbstractCegarLoop]: === Iteration 159 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:28,733 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:28,733 INFO L85 PathProgramCache]: Analyzing trace with hash -2083491674, now seen corresponding path program 120 times [2025-04-13 23:10:28,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:28,733 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235132331] [2025-04-13 23:10:28,733 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:10:28,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:28,737 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:28,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:28,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:10:28,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:29,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:29,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235132331] [2025-04-13 23:10:29,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235132331] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:29,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:29,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:29,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590137802] [2025-04-13 23:10:29,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:29,027 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:29,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:29,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:29,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:29,027 INFO L87 Difference]: Start difference. First operand 1515 states and 5483 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:29,520 INFO L93 Difference]: Finished difference Result 1629 states and 5831 transitions. [2025-04-13 23:10:29,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:10:29,520 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:29,520 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:29,524 INFO L225 Difference]: With dead ends: 1629 [2025-04-13 23:10:29,524 INFO L226 Difference]: Without dead ends: 1623 [2025-04-13 23:10:29,524 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=518, Unknown=0, NotChecked=0, Total=650 [2025-04-13 23:10:29,524 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 72 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:29,524 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 0 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:10:29,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1623 states. [2025-04-13 23:10:29,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1623 to 1517. [2025-04-13 23:10:29,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1516 states have (on average 3.620052770448549) internal successors, (5488), 1516 states have internal predecessors, (5488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:29,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 5488 transitions. [2025-04-13 23:10:29,555 INFO L79 Accepts]: Start accepts. Automaton has 1517 states and 5488 transitions. Word has length 25 [2025-04-13 23:10:29,555 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:29,555 INFO L485 AbstractCegarLoop]: Abstraction has 1517 states and 5488 transitions. [2025-04-13 23:10:29,555 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:29,555 INFO L278 IsEmpty]: Start isEmpty. Operand 1517 states and 5488 transitions. [2025-04-13 23:10:29,557 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:29,557 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:29,557 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:29,557 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable158 [2025-04-13 23:10:29,557 INFO L403 AbstractCegarLoop]: === Iteration 160 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:29,557 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:29,557 INFO L85 PathProgramCache]: Analyzing trace with hash -21271898, now seen corresponding path program 121 times [2025-04-13 23:10:29,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:29,558 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288891235] [2025-04-13 23:10:29,558 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:29,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:29,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:29,565 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:29,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:29,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:29,993 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:29,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:29,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288891235] [2025-04-13 23:10:29,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288891235] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:29,993 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079456900] [2025-04-13 23:10:29,993 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:29,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:29,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:29,995 INFO L229 MonitoredProcess]: Starting monitored process 118 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:29,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Waiting until timeout for monitored process [2025-04-13 23:10:30,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:30,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:30,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:30,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:30,096 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:10:30,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:30,440 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:30,441 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:10:30,508 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:30,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:31,036 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:31,036 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:10:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:31,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079456900] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:31,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:31,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:10:31,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722236439] [2025-04-13 23:10:31,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:31,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:31,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:31,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:31,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:31,904 INFO L87 Difference]: Start difference. First operand 1517 states and 5488 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:35,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:35,911 INFO L93 Difference]: Finished difference Result 1959 states and 6997 transitions. [2025-04-13 23:10:35,911 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:10:35,912 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:35,912 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:35,916 INFO L225 Difference]: With dead ends: 1959 [2025-04-13 23:10:35,916 INFO L226 Difference]: Without dead ends: 1948 [2025-04-13 23:10:35,916 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1832 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=737, Invalid=6069, Unknown=0, NotChecked=0, Total=6806 [2025-04-13 23:10:35,916 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 266 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3456 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 3456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:35,916 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 0 Invalid, 3576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 3456 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:10:35,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2025-04-13 23:10:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1517. [2025-04-13 23:10:35,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1517 states, 1516 states have (on average 3.6226912928759893) internal successors, (5492), 1516 states have internal predecessors, (5492), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:35,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 5492 transitions. [2025-04-13 23:10:35,935 INFO L79 Accepts]: Start accepts. Automaton has 1517 states and 5492 transitions. Word has length 25 [2025-04-13 23:10:35,935 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:35,936 INFO L485 AbstractCegarLoop]: Abstraction has 1517 states and 5492 transitions. [2025-04-13 23:10:35,936 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:35,936 INFO L278 IsEmpty]: Start isEmpty. Operand 1517 states and 5492 transitions. [2025-04-13 23:10:35,937 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:35,937 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:35,937 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:35,943 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (118)] Ended with exit code 0 [2025-04-13 23:10:36,138 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable159,118 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:36,138 INFO L403 AbstractCegarLoop]: === Iteration 161 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:36,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:36,138 INFO L85 PathProgramCache]: Analyzing trace with hash 226133764, now seen corresponding path program 122 times [2025-04-13 23:10:36,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:36,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235348208] [2025-04-13 23:10:36,138 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:10:36,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:36,142 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:36,145 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:36,145 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:10:36,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:36,487 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:36,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:36,488 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235348208] [2025-04-13 23:10:36,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [235348208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:36,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:36,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:36,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723853215] [2025-04-13 23:10:36,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:36,488 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:36,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:36,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:36,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:36,488 INFO L87 Difference]: Start difference. First operand 1517 states and 5492 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:36,855 INFO L93 Difference]: Finished difference Result 1603 states and 5768 transitions. [2025-04-13 23:10:36,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:10:36,855 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:36,855 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:36,859 INFO L225 Difference]: With dead ends: 1603 [2025-04-13 23:10:36,859 INFO L226 Difference]: Without dead ends: 1597 [2025-04-13 23:10:36,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=347, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:10:36,859 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 74 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:36,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 0 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:10:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states. [2025-04-13 23:10:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 1511. [2025-04-13 23:10:36,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1511 states, 1510 states have (on average 3.6205298013245035) internal successors, (5467), 1510 states have internal predecessors, (5467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:36,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1511 states to 1511 states and 5467 transitions. [2025-04-13 23:10:36,875 INFO L79 Accepts]: Start accepts. Automaton has 1511 states and 5467 transitions. Word has length 25 [2025-04-13 23:10:36,875 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:36,876 INFO L485 AbstractCegarLoop]: Abstraction has 1511 states and 5467 transitions. [2025-04-13 23:10:36,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:36,876 INFO L278 IsEmpty]: Start isEmpty. Operand 1511 states and 5467 transitions. [2025-04-13 23:10:36,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:36,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:36,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:36,877 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable160 [2025-04-13 23:10:36,877 INFO L403 AbstractCegarLoop]: === Iteration 162 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:36,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:36,878 INFO L85 PathProgramCache]: Analyzing trace with hash 860465022, now seen corresponding path program 123 times [2025-04-13 23:10:36,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:36,878 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689328195] [2025-04-13 23:10:36,878 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:36,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:36,881 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:36,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:36,886 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:10:36,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:37,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:37,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689328195] [2025-04-13 23:10:37,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689328195] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:37,262 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1244880571] [2025-04-13 23:10:37,262 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:37,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:37,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:37,263 INFO L229 MonitoredProcess]: Starting monitored process 119 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:37,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Waiting until timeout for monitored process [2025-04-13 23:10:37,353 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:37,366 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:37,366 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:10:37,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:37,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:10:37,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:37,822 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:37,822 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:10:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:38,096 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:38,686 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:38,687 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:10:38,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:38,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1244880571] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:38,995 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:38,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:10:38,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050997136] [2025-04-13 23:10:38,995 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:38,995 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:10:38,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:38,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:10:38,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:10:38,995 INFO L87 Difference]: Start difference. First operand 1511 states and 5467 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:42,949 INFO L93 Difference]: Finished difference Result 1991 states and 7136 transitions. [2025-04-13 23:10:42,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:10:42,949 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:42,949 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:42,954 INFO L225 Difference]: With dead ends: 1991 [2025-04-13 23:10:42,954 INFO L226 Difference]: Without dead ends: 1980 [2025-04-13 23:10:42,954 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1826 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=945, Invalid=5535, Unknown=0, NotChecked=0, Total=6480 [2025-04-13 23:10:42,954 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 256 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2556 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 2556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:42,954 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 0 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 2556 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:10:42,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2025-04-13 23:10:42,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1513. [2025-04-13 23:10:42,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1513 states, 1512 states have (on average 3.6203703703703702) internal successors, (5474), 1512 states have internal predecessors, (5474), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:42,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1513 states to 1513 states and 5474 transitions. [2025-04-13 23:10:42,974 INFO L79 Accepts]: Start accepts. Automaton has 1513 states and 5474 transitions. Word has length 25 [2025-04-13 23:10:42,974 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:42,974 INFO L485 AbstractCegarLoop]: Abstraction has 1513 states and 5474 transitions. [2025-04-13 23:10:42,974 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:42,974 INFO L278 IsEmpty]: Start isEmpty. Operand 1513 states and 5474 transitions. [2025-04-13 23:10:42,975 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:42,976 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:42,976 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:42,982 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (119)] Ended with exit code 0 [2025-04-13 23:10:43,176 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 119 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable161 [2025-04-13 23:10:43,176 INFO L403 AbstractCegarLoop]: === Iteration 163 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:43,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:43,176 INFO L85 PathProgramCache]: Analyzing trace with hash 531783906, now seen corresponding path program 124 times [2025-04-13 23:10:43,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:43,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285732956] [2025-04-13 23:10:43,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:43,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:43,180 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:43,183 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:43,183 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:43,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:43,403 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:43,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:43,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285732956] [2025-04-13 23:10:43,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285732956] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:43,403 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1853774469] [2025-04-13 23:10:43,403 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:10:43,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:43,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:43,405 INFO L229 MonitoredProcess]: Starting monitored process 120 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:43,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Waiting until timeout for monitored process [2025-04-13 23:10:43,494 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:43,507 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:43,507 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:10:43,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:43,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:10:43,509 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:43,883 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:43,884 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:10:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:43,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:44,372 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:44,373 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:10:45,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:45,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1853774469] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:45,257 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 30 [2025-04-13 23:10:45,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608404947] [2025-04-13 23:10:45,257 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:45,258 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:10:45,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:45,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:10:45,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:10:45,258 INFO L87 Difference]: Start difference. First operand 1513 states and 5474 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:46,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:46,938 INFO L93 Difference]: Finished difference Result 1751 states and 6257 transitions. [2025-04-13 23:10:46,939 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-13 23:10:46,939 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:46,939 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:46,943 INFO L225 Difference]: With dead ends: 1751 [2025-04-13 23:10:46,943 INFO L226 Difference]: Without dead ends: 1740 [2025-04-13 23:10:46,943 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1010 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=542, Invalid=3240, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 23:10:46,943 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 212 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1979 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:46,943 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 0 Invalid, 1979 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1914 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:10:46,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1740 states. [2025-04-13 23:10:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1740 to 1521. [2025-04-13 23:10:46,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1520 states have (on average 3.623684210526316) internal successors, (5508), 1520 states have internal predecessors, (5508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 5508 transitions. [2025-04-13 23:10:46,960 INFO L79 Accepts]: Start accepts. Automaton has 1521 states and 5508 transitions. Word has length 25 [2025-04-13 23:10:46,960 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:46,960 INFO L485 AbstractCegarLoop]: Abstraction has 1521 states and 5508 transitions. [2025-04-13 23:10:46,960 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:46,960 INFO L278 IsEmpty]: Start isEmpty. Operand 1521 states and 5508 transitions. [2025-04-13 23:10:46,962 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:46,962 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:46,962 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:46,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (120)] Ended with exit code 0 [2025-04-13 23:10:47,162 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable162,120 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:47,162 INFO L403 AbstractCegarLoop]: === Iteration 164 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:47,163 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:47,163 INFO L85 PathProgramCache]: Analyzing trace with hash -693420782, now seen corresponding path program 125 times [2025-04-13 23:10:47,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:47,163 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696081050] [2025-04-13 23:10:47,163 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:47,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:47,167 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:47,170 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:47,170 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:47,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:10:47,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:47,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696081050] [2025-04-13 23:10:47,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696081050] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:47,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333531492] [2025-04-13 23:10:47,772 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:10:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:47,774 INFO L229 MonitoredProcess]: Starting monitored process 121 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:47,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Waiting until timeout for monitored process [2025-04-13 23:10:47,862 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:47,875 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:47,875 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:10:47,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:47,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:10:47,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:48,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:48,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:10:48,434 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:48,434 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:48,878 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:48,878 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 375 treesize of output 165 [2025-04-13 23:10:49,655 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:49,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333531492] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:49,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:49,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 29 [2025-04-13 23:10:49,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525626336] [2025-04-13 23:10:49,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:49,656 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-04-13 23:10:49,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:49,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-04-13 23:10:49,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-04-13 23:10:49,656 INFO L87 Difference]: Start difference. First operand 1521 states and 5508 transitions. Second operand has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:52,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:52,230 INFO L93 Difference]: Finished difference Result 1846 states and 6489 transitions. [2025-04-13 23:10:52,230 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2025-04-13 23:10:52,230 INFO L79 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:52,230 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:52,235 INFO L225 Difference]: With dead ends: 1846 [2025-04-13 23:10:52,235 INFO L226 Difference]: Without dead ends: 1835 [2025-04-13 23:10:52,235 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=375, Invalid=3407, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 23:10:52,235 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 319 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2830 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 2830 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:52,235 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 0 Invalid, 2866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 2830 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:10:52,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2025-04-13 23:10:52,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1539. [2025-04-13 23:10:52,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1539 states, 1538 states have (on average 3.6248374512353707) internal successors, (5575), 1538 states have internal predecessors, (5575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:52,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1539 states to 1539 states and 5575 transitions. [2025-04-13 23:10:52,255 INFO L79 Accepts]: Start accepts. Automaton has 1539 states and 5575 transitions. Word has length 25 [2025-04-13 23:10:52,255 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:52,255 INFO L485 AbstractCegarLoop]: Abstraction has 1539 states and 5575 transitions. [2025-04-13 23:10:52,255 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 30 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:52,255 INFO L278 IsEmpty]: Start isEmpty. Operand 1539 states and 5575 transitions. [2025-04-13 23:10:52,257 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:52,257 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:52,257 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:52,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (121)] Forceful destruction successful, exit code 0 [2025-04-13 23:10:52,457 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable163,121 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:52,457 INFO L403 AbstractCegarLoop]: === Iteration 165 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:52,457 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:52,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1429888426, now seen corresponding path program 126 times [2025-04-13 23:10:52,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:52,458 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875247490] [2025-04-13 23:10:52,458 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:10:52,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:52,461 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:52,464 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:52,464 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:10:52,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:52,749 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:52,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:52,749 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875247490] [2025-04-13 23:10:52,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875247490] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:52,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:52,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:52,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145947666] [2025-04-13 23:10:52,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:52,750 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:52,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:52,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:52,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:52,750 INFO L87 Difference]: Start difference. First operand 1539 states and 5575 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:53,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:53,232 INFO L93 Difference]: Finished difference Result 1669 states and 6037 transitions. [2025-04-13 23:10:53,232 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-13 23:10:53,232 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:53,232 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:53,236 INFO L225 Difference]: With dead ends: 1669 [2025-04-13 23:10:53,236 INFO L226 Difference]: Without dead ends: 1663 [2025-04-13 23:10:53,237 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=548, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:10:53,237 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 136 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 901 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 901 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:53,237 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 0 Invalid, 912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 901 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:10:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1663 states. [2025-04-13 23:10:53,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1663 to 1547. [2025-04-13 23:10:53,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1547 states, 1546 states have (on average 3.6261319534282017) internal successors, (5606), 1546 states have internal predecessors, (5606), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1547 states to 1547 states and 5606 transitions. [2025-04-13 23:10:53,254 INFO L79 Accepts]: Start accepts. Automaton has 1547 states and 5606 transitions. Word has length 25 [2025-04-13 23:10:53,254 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:53,254 INFO L485 AbstractCegarLoop]: Abstraction has 1547 states and 5606 transitions. [2025-04-13 23:10:53,254 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:53,254 INFO L278 IsEmpty]: Start isEmpty. Operand 1547 states and 5606 transitions. [2025-04-13 23:10:53,256 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:53,256 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:53,256 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:53,256 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable164 [2025-04-13 23:10:53,256 INFO L403 AbstractCegarLoop]: === Iteration 166 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:53,256 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1000613152, now seen corresponding path program 127 times [2025-04-13 23:10:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:53,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458878471] [2025-04-13 23:10:53,256 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:53,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:53,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:53,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:10:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:53,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458878471] [2025-04-13 23:10:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458878471] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:10:53,717 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606090047] [2025-04-13 23:10:53,717 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:10:53,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:53,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:10:53,719 INFO L229 MonitoredProcess]: Starting monitored process 122 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:10:53,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Waiting until timeout for monitored process [2025-04-13 23:10:53,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:10:53,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:53,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:10:53,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:53,828 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:10:53,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:10:54,258 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:54,259 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:10:54,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:54,329 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:10:54,805 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:10:54,806 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:10:55,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:55,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606090047] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:10:55,644 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:10:55,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:10:55,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833645373] [2025-04-13 23:10:55,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:10:55,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:10:55,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:55,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:10:55,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:10:55,644 INFO L87 Difference]: Start difference. First operand 1547 states and 5606 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:58,624 INFO L93 Difference]: Finished difference Result 1874 states and 6625 transitions. [2025-04-13 23:10:58,624 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 23:10:58,624 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:58,624 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:58,628 INFO L225 Difference]: With dead ends: 1874 [2025-04-13 23:10:58,628 INFO L226 Difference]: Without dead ends: 1863 [2025-04-13 23:10:58,629 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1214 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=512, Invalid=4458, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 23:10:58,629 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 308 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2961 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 2961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:58,629 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 0 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 2961 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:10:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-04-13 23:10:58,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1562. [2025-04-13 23:10:58,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1561 states have (on average 3.623959000640615) internal successors, (5657), 1561 states have internal predecessors, (5657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:58,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 5657 transitions. [2025-04-13 23:10:58,648 INFO L79 Accepts]: Start accepts. Automaton has 1562 states and 5657 transitions. Word has length 25 [2025-04-13 23:10:58,648 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:58,649 INFO L485 AbstractCegarLoop]: Abstraction has 1562 states and 5657 transitions. [2025-04-13 23:10:58,649 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:58,649 INFO L278 IsEmpty]: Start isEmpty. Operand 1562 states and 5657 transitions. [2025-04-13 23:10:58,651 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:58,651 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:58,651 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:58,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (122)] Ended with exit code 0 [2025-04-13 23:10:58,851 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable165,122 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:10:58,851 INFO L403 AbstractCegarLoop]: === Iteration 167 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:58,851 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:58,851 INFO L85 PathProgramCache]: Analyzing trace with hash -832441288, now seen corresponding path program 128 times [2025-04-13 23:10:58,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:58,851 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743438835] [2025-04-13 23:10:58,852 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:10:58,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:58,855 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:58,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:10:58,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-13 23:10:58,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:10:59,169 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:10:59,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:10:59,169 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743438835] [2025-04-13 23:10:59,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743438835] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:10:59,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:10:59,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:10:59,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595625416] [2025-04-13 23:10:59,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:10:59,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:10:59,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:10:59,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:10:59,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:10:59,170 INFO L87 Difference]: Start difference. First operand 1562 states and 5657 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:59,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:10:59,694 INFO L93 Difference]: Finished difference Result 1708 states and 6153 transitions. [2025-04-13 23:10:59,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-13 23:10:59,694 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:10:59,694 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:10:59,698 INFO L225 Difference]: With dead ends: 1708 [2025-04-13 23:10:59,698 INFO L226 Difference]: Without dead ends: 1702 [2025-04-13 23:10:59,698 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=566, Unknown=0, NotChecked=0, Total=702 [2025-04-13 23:10:59,698 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 113 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 961 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 961 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:10:59,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 0 Invalid, 971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 961 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:10:59,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2025-04-13 23:10:59,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1558. [2025-04-13 23:10:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1557 states have (on average 3.621708413615928) internal successors, (5639), 1557 states have internal predecessors, (5639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:59,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 5639 transitions. [2025-04-13 23:10:59,716 INFO L79 Accepts]: Start accepts. Automaton has 1558 states and 5639 transitions. Word has length 25 [2025-04-13 23:10:59,716 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:10:59,716 INFO L485 AbstractCegarLoop]: Abstraction has 1558 states and 5639 transitions. [2025-04-13 23:10:59,716 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:10:59,716 INFO L278 IsEmpty]: Start isEmpty. Operand 1558 states and 5639 transitions. [2025-04-13 23:10:59,718 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:10:59,718 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:10:59,718 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:10:59,718 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable166 [2025-04-13 23:10:59,718 INFO L403 AbstractCegarLoop]: === Iteration 168 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:10:59,718 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:10:59,719 INFO L85 PathProgramCache]: Analyzing trace with hash 430286260, now seen corresponding path program 129 times [2025-04-13 23:10:59,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:10:59,719 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792550503] [2025-04-13 23:10:59,719 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:10:59,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:10:59,722 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:10:59,726 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:10:59,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:10:59,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:00,113 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:00,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792550503] [2025-04-13 23:11:00,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792550503] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:00,113 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547792229] [2025-04-13 23:11:00,113 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:11:00,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:00,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:00,115 INFO L229 MonitoredProcess]: Starting monitored process 123 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:00,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Waiting until timeout for monitored process [2025-04-13 23:11:00,207 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:00,221 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:00,221 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:11:00,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:00,222 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:11:00,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:00,657 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:11:00,663 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:00,663 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 169 treesize of output 99 [2025-04-13 23:11:00,987 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:00,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:01,483 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:01,483 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 271 treesize of output 119 [2025-04-13 23:11:01,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:01,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547792229] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:01,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:01,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:11:01,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302956299] [2025-04-13 23:11:01,790 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:01,790 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:11:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:01,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:11:01,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=952, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:11:01,791 INFO L87 Difference]: Start difference. First operand 1558 states and 5639 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:05,506 INFO L93 Difference]: Finished difference Result 2122 states and 7477 transitions. [2025-04-13 23:11:05,506 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-04-13 23:11:05,506 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:05,506 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:05,511 INFO L225 Difference]: With dead ends: 2122 [2025-04-13 23:11:05,511 INFO L226 Difference]: Without dead ends: 2106 [2025-04-13 23:11:05,512 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1982 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=995, Invalid=5647, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:11:05,512 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 336 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:05,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 0 Invalid, 2392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:11:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2106 states. [2025-04-13 23:11:05,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2106 to 1590. [2025-04-13 23:11:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1589 states have (on average 3.6375078665827565) internal successors, (5780), 1589 states have internal predecessors, (5780), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 5780 transitions. [2025-04-13 23:11:05,533 INFO L79 Accepts]: Start accepts. Automaton has 1590 states and 5780 transitions. Word has length 25 [2025-04-13 23:11:05,533 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:05,533 INFO L485 AbstractCegarLoop]: Abstraction has 1590 states and 5780 transitions. [2025-04-13 23:11:05,533 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:05,533 INFO L278 IsEmpty]: Start isEmpty. Operand 1590 states and 5780 transitions. [2025-04-13 23:11:05,535 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:05,535 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:05,535 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:05,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (123)] Ended with exit code 0 [2025-04-13 23:11:05,735 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable167,123 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:05,735 INFO L403 AbstractCegarLoop]: === Iteration 169 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:05,735 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:05,735 INFO L85 PathProgramCache]: Analyzing trace with hash -372353016, now seen corresponding path program 130 times [2025-04-13 23:11:05,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:05,736 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872629698] [2025-04-13 23:11:05,736 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:11:05,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:05,739 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:05,742 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:05,742 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:11:05,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:05,932 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872629698] [2025-04-13 23:11:05,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872629698] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:11:05,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:11:05,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-13 23:11:05,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391331583] [2025-04-13 23:11:05,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:11:05,932 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-13 23:11:05,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:05,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-13 23:11:05,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2025-04-13 23:11:05,933 INFO L87 Difference]: Start difference. First operand 1590 states and 5780 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:06,295 INFO L93 Difference]: Finished difference Result 1735 states and 6204 transitions. [2025-04-13 23:11:06,296 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-04-13 23:11:06,296 INFO L79 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:06,296 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:06,300 INFO L225 Difference]: With dead ends: 1735 [2025-04-13 23:11:06,300 INFO L226 Difference]: Without dead ends: 1729 [2025-04-13 23:11:06,300 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2025-04-13 23:11:06,300 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 869 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 869 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:06,300 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 0 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 869 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:11:06,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1729 states. [2025-04-13 23:11:06,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1729 to 1574. [2025-04-13 23:11:06,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1574 states, 1573 states have (on average 3.6363636363636362) internal successors, (5720), 1573 states have internal predecessors, (5720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:06,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1574 states to 1574 states and 5720 transitions. [2025-04-13 23:11:06,318 INFO L79 Accepts]: Start accepts. Automaton has 1574 states and 5720 transitions. Word has length 25 [2025-04-13 23:11:06,318 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:06,318 INFO L485 AbstractCegarLoop]: Abstraction has 1574 states and 5720 transitions. [2025-04-13 23:11:06,318 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:06,318 INFO L278 IsEmpty]: Start isEmpty. Operand 1574 states and 5720 transitions. [2025-04-13 23:11:06,320 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:06,320 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:06,320 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:06,320 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable168 [2025-04-13 23:11:06,320 INFO L403 AbstractCegarLoop]: === Iteration 170 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:06,321 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash -871040972, now seen corresponding path program 131 times [2025-04-13 23:11:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:06,321 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430433866] [2025-04-13 23:11:06,321 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:06,325 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:06,328 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:06,328 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:06,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:06,874 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:06,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:06,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430433866] [2025-04-13 23:11:06,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430433866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:06,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1753318170] [2025-04-13 23:11:06,875 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:06,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:06,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:06,876 INFO L229 MonitoredProcess]: Starting monitored process 124 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:06,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Waiting until timeout for monitored process [2025-04-13 23:11:06,967 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:06,980 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:06,980 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:06,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:06,981 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:11:06,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:07,427 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 23:11:07,427 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:11:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:07,591 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:08,096 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:08,097 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:11:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:08,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1753318170] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:08,865 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:08,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:11:08,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900404405] [2025-04-13 23:11:08,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:08,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:11:08,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:08,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:11:08,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=940, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:11:08,865 INFO L87 Difference]: Start difference. First operand 1574 states and 5720 transitions. Second operand has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:11,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:11,811 INFO L93 Difference]: Finished difference Result 1946 states and 6921 transitions. [2025-04-13 23:11:11,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 23:11:11,811 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:11,812 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:11,816 INFO L225 Difference]: With dead ends: 1946 [2025-04-13 23:11:11,816 INFO L226 Difference]: Without dead ends: 1935 [2025-04-13 23:11:11,816 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=458, Invalid=3832, Unknown=0, NotChecked=0, Total=4290 [2025-04-13 23:11:11,817 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 329 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2795 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 2795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:11,817 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 0 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 2795 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-04-13 23:11:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1935 states. [2025-04-13 23:11:11,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1935 to 1594. [2025-04-13 23:11:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1594 states, 1593 states have (on average 3.6271186440677967) internal successors, (5778), 1593 states have internal predecessors, (5778), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:11,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1594 states to 1594 states and 5778 transitions. [2025-04-13 23:11:11,836 INFO L79 Accepts]: Start accepts. Automaton has 1594 states and 5778 transitions. Word has length 25 [2025-04-13 23:11:11,836 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:11,836 INFO L485 AbstractCegarLoop]: Abstraction has 1594 states and 5778 transitions. [2025-04-13 23:11:11,836 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.15625) internal successors, (69), 32 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:11,836 INFO L278 IsEmpty]: Start isEmpty. Operand 1594 states and 5778 transitions. [2025-04-13 23:11:11,838 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:11,838 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:11,838 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:11,844 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (124)] Ended with exit code 0 [2025-04-13 23:11:12,038 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 124 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable169 [2025-04-13 23:11:12,038 INFO L403 AbstractCegarLoop]: === Iteration 171 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:12,038 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1897521900, now seen corresponding path program 132 times [2025-04-13 23:11:12,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:12,039 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093012938] [2025-04-13 23:11:12,039 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:12,042 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:12,045 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 23 of 25 statements. [2025-04-13 23:11:12,045 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-04-13 23:11:12,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:12,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:12,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:12,365 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093012938] [2025-04-13 23:11:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093012938] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:11:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:11:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-04-13 23:11:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774168669] [2025-04-13 23:11:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:11:12,366 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-13 23:11:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:12,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-13 23:11:12,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-13 23:11:12,366 INFO L87 Difference]: Start difference. First operand 1594 states and 5778 transitions. Second operand has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:12,775 INFO L93 Difference]: Finished difference Result 1720 states and 6187 transitions. [2025-04-13 23:11:12,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-13 23:11:12,775 INFO L79 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:12,775 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:12,779 INFO L225 Difference]: With dead ends: 1720 [2025-04-13 23:11:12,779 INFO L226 Difference]: Without dead ends: 1714 [2025-04-13 23:11:12,779 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2025-04-13 23:11:12,779 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 67 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:12,779 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 0 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-04-13 23:11:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2025-04-13 23:11:12,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1600. [2025-04-13 23:11:12,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1599 states have (on average 3.6316447779862413) internal successors, (5807), 1599 states have internal predecessors, (5807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:12,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 5807 transitions. [2025-04-13 23:11:12,797 INFO L79 Accepts]: Start accepts. Automaton has 1600 states and 5807 transitions. Word has length 25 [2025-04-13 23:11:12,798 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:12,798 INFO L485 AbstractCegarLoop]: Abstraction has 1600 states and 5807 transitions. [2025-04-13 23:11:12,798 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 1.7142857142857142) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:12,798 INFO L278 IsEmpty]: Start isEmpty. Operand 1600 states and 5807 transitions. [2025-04-13 23:11:12,800 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:12,800 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:12,800 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:12,800 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable170 [2025-04-13 23:11:12,800 INFO L403 AbstractCegarLoop]: === Iteration 172 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:12,800 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -272117234, now seen corresponding path program 133 times [2025-04-13 23:11:12,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:12,800 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775354620] [2025-04-13 23:11:12,800 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:12,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:12,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:12,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:12,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:12,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:13,329 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:13,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:13,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775354620] [2025-04-13 23:11:13,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775354620] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:13,329 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924370044] [2025-04-13 23:11:13,329 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:13,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:13,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:13,331 INFO L229 MonitoredProcess]: Starting monitored process 125 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:13,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Waiting until timeout for monitored process [2025-04-13 23:11:13,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:13,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:13,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:13,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:13,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:11:13,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:13,952 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:13,952 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:11:14,006 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:14,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:14,568 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:14,568 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:11:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:15,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924370044] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:15,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:15,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:11:15,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808629879] [2025-04-13 23:11:15,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:15,310 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:11:15,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:15,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:11:15,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=997, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:11:15,310 INFO L87 Difference]: Start difference. First operand 1600 states and 5807 transitions. Second operand has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:18,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:18,334 INFO L93 Difference]: Finished difference Result 1828 states and 6581 transitions. [2025-04-13 23:11:18,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-04-13 23:11:18,334 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:18,334 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:18,339 INFO L225 Difference]: With dead ends: 1828 [2025-04-13 23:11:18,339 INFO L226 Difference]: Without dead ends: 1817 [2025-04-13 23:11:18,339 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 826 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=359, Invalid=3423, Unknown=0, NotChecked=0, Total=3782 [2025-04-13 23:11:18,339 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 181 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3884 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 3884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:18,339 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 0 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 3884 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:11:18,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2025-04-13 23:11:18,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1613. [2025-04-13 23:11:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 3.63151364764268) internal successors, (5854), 1612 states have internal predecessors, (5854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:18,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5854 transitions. [2025-04-13 23:11:18,358 INFO L79 Accepts]: Start accepts. Automaton has 1613 states and 5854 transitions. Word has length 25 [2025-04-13 23:11:18,358 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:18,358 INFO L485 AbstractCegarLoop]: Abstraction has 1613 states and 5854 transitions. [2025-04-13 23:11:18,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 33 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:18,358 INFO L278 IsEmpty]: Start isEmpty. Operand 1613 states and 5854 transitions. [2025-04-13 23:11:18,360 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:18,360 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:18,360 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:18,367 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (125)] Ended with exit code 0 [2025-04-13 23:11:18,560 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 125 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable171 [2025-04-13 23:11:18,561 INFO L403 AbstractCegarLoop]: === Iteration 173 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:18,561 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:18,561 INFO L85 PathProgramCache]: Analyzing trace with hash 180962132, now seen corresponding path program 134 times [2025-04-13 23:11:18,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:18,561 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988077411] [2025-04-13 23:11:18,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:18,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:18,565 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:18,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:18,569 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:18,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:18,866 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:18,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:18,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988077411] [2025-04-13 23:11:18,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988077411] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:18,866 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607855338] [2025-04-13 23:11:18,866 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:18,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:18,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:18,868 INFO L229 MonitoredProcess]: Starting monitored process 126 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:18,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Waiting until timeout for monitored process [2025-04-13 23:11:18,960 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:18,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:18,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:18,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:18,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:11:18,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:19,380 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:19,380 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:11:19,645 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:19,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:20,078 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:20,078 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:11:20,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:20,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607855338] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:20,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:20,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:11:20,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305468845] [2025-04-13 23:11:20,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:20,388 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:20,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:20,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:20,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=985, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:20,388 INFO L87 Difference]: Start difference. First operand 1613 states and 5854 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:23,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:23,496 INFO L93 Difference]: Finished difference Result 1968 states and 6938 transitions. [2025-04-13 23:11:23,496 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 23:11:23,497 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:23,497 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:23,501 INFO L225 Difference]: With dead ends: 1968 [2025-04-13 23:11:23,501 INFO L226 Difference]: Without dead ends: 1957 [2025-04-13 23:11:23,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2183 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=953, Invalid=6357, Unknown=0, NotChecked=0, Total=7310 [2025-04-13 23:11:23,502 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 237 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2405 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 2405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:23,502 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 0 Invalid, 2470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 2405 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-04-13 23:11:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1957 states. [2025-04-13 23:11:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1957 to 1615. [2025-04-13 23:11:23,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1614 states have (on average 3.631350681536555) internal successors, (5861), 1614 states have internal predecessors, (5861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:23,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 5861 transitions. [2025-04-13 23:11:23,521 INFO L79 Accepts]: Start accepts. Automaton has 1615 states and 5861 transitions. Word has length 25 [2025-04-13 23:11:23,522 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:23,522 INFO L485 AbstractCegarLoop]: Abstraction has 1615 states and 5861 transitions. [2025-04-13 23:11:23,522 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:23,522 INFO L278 IsEmpty]: Start isEmpty. Operand 1615 states and 5861 transitions. [2025-04-13 23:11:23,524 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:23,524 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:23,524 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:23,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (126)] Forceful destruction successful, exit code 0 [2025-04-13 23:11:23,724 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 126 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable172 [2025-04-13 23:11:23,724 INFO L403 AbstractCegarLoop]: === Iteration 174 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:23,724 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 474584510, now seen corresponding path program 135 times [2025-04-13 23:11:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:23,724 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739838216] [2025-04-13 23:11:23,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:11:23,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:23,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:23,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:23,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:11:23,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:24,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:24,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:24,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739838216] [2025-04-13 23:11:24,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739838216] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:24,225 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133350123] [2025-04-13 23:11:24,225 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:11:24,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:24,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:24,227 INFO L229 MonitoredProcess]: Starting monitored process 127 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:24,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Waiting until timeout for monitored process [2025-04-13 23:11:24,320 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:24,334 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:24,334 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:11:24,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:24,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:11:24,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:24,857 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:11:24,858 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:11:24,862 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:24,862 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 181 treesize of output 93 [2025-04-13 23:11:25,134 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:25,134 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:25,757 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:25,757 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 251 treesize of output 115 [2025-04-13 23:11:26,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:26,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133350123] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:26,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:26,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:11:26,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68896404] [2025-04-13 23:11:26,047 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:26,047 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:26,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:26,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:26,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=1026, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:26,048 INFO L87 Difference]: Start difference. First operand 1615 states and 5861 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:28,544 INFO L93 Difference]: Finished difference Result 1874 states and 6729 transitions. [2025-04-13 23:11:28,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-04-13 23:11:28,544 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:28,544 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:28,548 INFO L225 Difference]: With dead ends: 1874 [2025-04-13 23:11:28,548 INFO L226 Difference]: Without dead ends: 1863 [2025-04-13 23:11:28,549 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1168 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=488, Invalid=3672, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 23:11:28,549 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 333 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1822 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:28,549 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 0 Invalid, 1933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1822 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:11:28,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1863 states. [2025-04-13 23:11:28,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1863 to 1635. [2025-04-13 23:11:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1634 states have (on average 3.6260709914320683) internal successors, (5925), 1634 states have internal predecessors, (5925), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:28,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 5925 transitions. [2025-04-13 23:11:28,567 INFO L79 Accepts]: Start accepts. Automaton has 1635 states and 5925 transitions. Word has length 25 [2025-04-13 23:11:28,567 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:28,567 INFO L485 AbstractCegarLoop]: Abstraction has 1635 states and 5925 transitions. [2025-04-13 23:11:28,567 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:28,568 INFO L278 IsEmpty]: Start isEmpty. Operand 1635 states and 5925 transitions. [2025-04-13 23:11:28,569 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:28,570 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:28,570 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:28,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (127)] Ended with exit code 0 [2025-04-13 23:11:28,770 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable173,127 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:28,770 INFO L403 AbstractCegarLoop]: === Iteration 175 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:28,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash -87819958, now seen corresponding path program 136 times [2025-04-13 23:11:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:28,770 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372360324] [2025-04-13 23:11:28,770 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:11:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:28,774 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:28,777 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:28,777 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:11:28,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:28,989 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:28,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:28,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372360324] [2025-04-13 23:11:28,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372360324] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:28,989 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160348785] [2025-04-13 23:11:28,989 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:11:28,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:28,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:28,991 INFO L229 MonitoredProcess]: Starting monitored process 128 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:28,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Waiting until timeout for monitored process [2025-04-13 23:11:29,086 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:29,099 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:29,099 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:11:29,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:29,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:11:29,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:29,502 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:29,503 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:11:29,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:29,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:29,978 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:29,979 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:11:31,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:31,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160348785] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:31,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:31,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 30 [2025-04-13 23:11:31,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957881453] [2025-04-13 23:11:31,527 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:31,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:11:31,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:31,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:11:31,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=841, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:11:31,528 INFO L87 Difference]: Start difference. First operand 1635 states and 5925 transitions. Second operand has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:33,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:33,651 INFO L93 Difference]: Finished difference Result 1890 states and 6682 transitions. [2025-04-13 23:11:33,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-04-13 23:11:33,651 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:33,651 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:33,655 INFO L225 Difference]: With dead ends: 1890 [2025-04-13 23:11:33,656 INFO L226 Difference]: Without dead ends: 1879 [2025-04-13 23:11:33,656 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=503, Invalid=3157, Unknown=0, NotChecked=0, Total=3660 [2025-04-13 23:11:33,656 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 173 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:33,656 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 0 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-04-13 23:11:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1879 states. [2025-04-13 23:11:33,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1879 to 1627. [2025-04-13 23:11:33,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 3.621771217712177) internal successors, (5889), 1626 states have internal predecessors, (5889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 5889 transitions. [2025-04-13 23:11:33,677 INFO L79 Accepts]: Start accepts. Automaton has 1627 states and 5889 transitions. Word has length 25 [2025-04-13 23:11:33,677 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:33,677 INFO L485 AbstractCegarLoop]: Abstraction has 1627 states and 5889 transitions. [2025-04-13 23:11:33,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.096774193548387) internal successors, (65), 31 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:33,677 INFO L278 IsEmpty]: Start isEmpty. Operand 1627 states and 5889 transitions. [2025-04-13 23:11:33,679 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:33,679 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:33,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:33,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (128)] Ended with exit code 0 [2025-04-13 23:11:33,880 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable174,128 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:33,880 INFO L403 AbstractCegarLoop]: === Iteration 176 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:33,880 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:33,880 INFO L85 PathProgramCache]: Analyzing trace with hash 672761930, now seen corresponding path program 137 times [2025-04-13 23:11:33,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:33,880 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038607693] [2025-04-13 23:11:33,880 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:33,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:33,884 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:33,889 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:33,889 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:33,889 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:34,678 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:11:34,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:34,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038607693] [2025-04-13 23:11:34,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038607693] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:34,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1505144146] [2025-04-13 23:11:34,679 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:11:34,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:34,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:34,681 INFO L229 MonitoredProcess]: Starting monitored process 129 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:34,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Waiting until timeout for monitored process [2025-04-13 23:11:34,775 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:34,788 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:34,788 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:34,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:34,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:11:34,790 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:35,336 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:11:35,339 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:35,340 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 91 [2025-04-13 23:11:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:35,541 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:36,146 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:36,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:11:36,951 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:36,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1505144146] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:36,952 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:36,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 9] total 35 [2025-04-13 23:11:36,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718543763] [2025-04-13 23:11:36,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:36,952 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-04-13 23:11:36,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:36,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-04-13 23:11:36,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1199, Unknown=0, NotChecked=0, Total=1332 [2025-04-13 23:11:36,952 INFO L87 Difference]: Start difference. First operand 1627 states and 5889 transitions. Second operand has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:40,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:40,055 INFO L93 Difference]: Finished difference Result 1914 states and 6934 transitions. [2025-04-13 23:11:40,055 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-13 23:11:40,055 INFO L79 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:40,055 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:40,060 INFO L225 Difference]: With dead ends: 1914 [2025-04-13 23:11:40,060 INFO L226 Difference]: Without dead ends: 1908 [2025-04-13 23:11:40,060 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1227 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=483, Invalid=4629, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:11:40,061 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 346 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2564 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 2564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:40,061 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 0 Invalid, 2630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 2564 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:11:40,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1908 states. [2025-04-13 23:11:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1908 to 1630. [2025-04-13 23:11:40,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1630 states, 1629 states have (on average 3.6249232658072437) internal successors, (5905), 1629 states have internal predecessors, (5905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 5905 transitions. [2025-04-13 23:11:40,080 INFO L79 Accepts]: Start accepts. Automaton has 1630 states and 5905 transitions. Word has length 25 [2025-04-13 23:11:40,080 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:40,080 INFO L485 AbstractCegarLoop]: Abstraction has 1630 states and 5905 transitions. [2025-04-13 23:11:40,080 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 1.9722222222222223) internal successors, (71), 36 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:40,081 INFO L278 IsEmpty]: Start isEmpty. Operand 1630 states and 5905 transitions. [2025-04-13 23:11:40,082 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:40,082 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:40,083 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:40,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (129)] Ended with exit code 0 [2025-04-13 23:11:40,283 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable175,129 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:40,283 INFO L403 AbstractCegarLoop]: === Iteration 177 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:40,283 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:40,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1836660204, now seen corresponding path program 138 times [2025-04-13 23:11:40,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:40,283 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845063379] [2025-04-13 23:11:40,283 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:40,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:40,287 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:40,291 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:40,291 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:11:40,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:40,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:40,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:40,582 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845063379] [2025-04-13 23:11:40,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845063379] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:40,583 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1618542812] [2025-04-13 23:11:40,583 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:11:40,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:40,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:40,584 INFO L229 MonitoredProcess]: Starting monitored process 130 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:40,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Waiting until timeout for monitored process [2025-04-13 23:11:40,679 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:40,693 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:40,693 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:11:40,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:40,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:11:40,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:41,105 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:41,105 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:11:41,340 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:41,340 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:41,798 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:41,799 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:11:42,127 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:42,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1618542812] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:42,127 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:42,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:11:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383851561] [2025-04-13 23:11:42,127 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:42,127 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:42,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:42,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:42,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=973, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:42,128 INFO L87 Difference]: Start difference. First operand 1630 states and 5905 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:44,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:44,852 INFO L93 Difference]: Finished difference Result 2041 states and 7296 transitions. [2025-04-13 23:11:44,852 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2025-04-13 23:11:44,852 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:44,852 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:44,857 INFO L225 Difference]: With dead ends: 2041 [2025-04-13 23:11:44,857 INFO L226 Difference]: Without dead ends: 2030 [2025-04-13 23:11:44,858 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1927 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1003, Invalid=5317, Unknown=0, NotChecked=0, Total=6320 [2025-04-13 23:11:44,858 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 254 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1565 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 1565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:44,858 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 0 Invalid, 1655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 1565 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 23:11:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2030 states. [2025-04-13 23:11:44,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2030 to 1640. [2025-04-13 23:11:44,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1640 states, 1639 states have (on average 3.6241610738255035) internal successors, (5940), 1639 states have internal predecessors, (5940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1640 states to 1640 states and 5940 transitions. [2025-04-13 23:11:44,878 INFO L79 Accepts]: Start accepts. Automaton has 1640 states and 5940 transitions. Word has length 25 [2025-04-13 23:11:44,878 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:44,878 INFO L485 AbstractCegarLoop]: Abstraction has 1640 states and 5940 transitions. [2025-04-13 23:11:44,878 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:44,878 INFO L278 IsEmpty]: Start isEmpty. Operand 1640 states and 5940 transitions. [2025-04-13 23:11:44,880 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:44,880 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:44,880 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:44,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (130)] Ended with exit code 0 [2025-04-13 23:11:45,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 130 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable176 [2025-04-13 23:11:45,081 INFO L403 AbstractCegarLoop]: === Iteration 178 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:45,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:45,081 INFO L85 PathProgramCache]: Analyzing trace with hash -538638678, now seen corresponding path program 139 times [2025-04-13 23:11:45,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:45,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007559667] [2025-04-13 23:11:45,081 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:45,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:45,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:45,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:45,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:45,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:45,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:45,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:45,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007559667] [2025-04-13 23:11:45,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007559667] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:45,667 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343846172] [2025-04-13 23:11:45,667 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:11:45,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:45,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:45,669 INFO L229 MonitoredProcess]: Starting monitored process 131 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:45,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Waiting until timeout for monitored process [2025-04-13 23:11:45,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:11:45,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:45,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:11:45,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:45,777 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:11:45,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:46,154 INFO L325 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2025-04-13 23:11:46,154 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:11:46,321 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:46,321 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:46,838 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:46,838 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 379 treesize of output 169 [2025-04-13 23:11:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:47,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343846172] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:47,631 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:47,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:11:47,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014592861] [2025-04-13 23:11:47,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:47,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:11:47,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:47,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:11:47,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=978, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:11:47,631 INFO L87 Difference]: Start difference. First operand 1640 states and 5940 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:50,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:50,982 INFO L93 Difference]: Finished difference Result 2002 states and 7166 transitions. [2025-04-13 23:11:50,982 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:11:50,982 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:50,982 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:50,987 INFO L225 Difference]: With dead ends: 2002 [2025-04-13 23:11:50,987 INFO L226 Difference]: Without dead ends: 1996 [2025-04-13 23:11:50,987 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1068 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=514, Invalid=3908, Unknown=0, NotChecked=0, Total=4422 [2025-04-13 23:11:50,987 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 271 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3147 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 3147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:50,988 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 0 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 3147 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-04-13 23:11:50,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2025-04-13 23:11:51,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1631. [2025-04-13 23:11:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1631 states, 1630 states have (on average 3.6276073619631903) internal successors, (5913), 1630 states have internal predecessors, (5913), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:51,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1631 states to 1631 states and 5913 transitions. [2025-04-13 23:11:51,008 INFO L79 Accepts]: Start accepts. Automaton has 1631 states and 5913 transitions. Word has length 25 [2025-04-13 23:11:51,008 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:51,008 INFO L485 AbstractCegarLoop]: Abstraction has 1631 states and 5913 transitions. [2025-04-13 23:11:51,008 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:51,008 INFO L278 IsEmpty]: Start isEmpty. Operand 1631 states and 5913 transitions. [2025-04-13 23:11:51,010 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:51,011 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:51,011 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:51,017 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (131)] Ended with exit code 0 [2025-04-13 23:11:51,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 131 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable177 [2025-04-13 23:11:51,211 INFO L403 AbstractCegarLoop]: === Iteration 179 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:51,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:51,211 INFO L85 PathProgramCache]: Analyzing trace with hash -425669510, now seen corresponding path program 140 times [2025-04-13 23:11:51,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:51,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119830045] [2025-04-13 23:11:51,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:51,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:51,215 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:51,219 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:51,219 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:51,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:51,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:51,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119830045] [2025-04-13 23:11:51,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119830045] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:51,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583558338] [2025-04-13 23:11:51,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:11:51,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:51,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:51,569 INFO L229 MonitoredProcess]: Starting monitored process 132 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:51,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Waiting until timeout for monitored process [2025-04-13 23:11:51,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:51,678 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:51,678 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:11:51,678 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:51,679 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:11:51,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:52,188 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:11:52,191 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:52,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:11:52,327 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:52,328 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:52,815 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:52,815 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:11:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583558338] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:53,117 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:53,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:11:53,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356568849] [2025-04-13 23:11:53,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:53,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:53,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:53,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1004, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:53,117 INFO L87 Difference]: Start difference. First operand 1631 states and 5913 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:11:55,523 INFO L93 Difference]: Finished difference Result 1956 states and 7045 transitions. [2025-04-13 23:11:55,523 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 23:11:55,524 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:11:55,524 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:11:55,528 INFO L225 Difference]: With dead ends: 1956 [2025-04-13 23:11:55,529 INFO L226 Difference]: Without dead ends: 1945 [2025-04-13 23:11:55,529 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1424 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=742, Invalid=4370, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:11:55,529 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 215 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1864 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:11:55,529 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 0 Invalid, 1932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1864 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-04-13 23:11:55,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1945 states. [2025-04-13 23:11:55,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1945 to 1613. [2025-04-13 23:11:55,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1613 states, 1612 states have (on average 3.627791563275434) internal successors, (5848), 1612 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:55,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1613 states to 1613 states and 5848 transitions. [2025-04-13 23:11:55,551 INFO L79 Accepts]: Start accepts. Automaton has 1613 states and 5848 transitions. Word has length 25 [2025-04-13 23:11:55,551 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:11:55,551 INFO L485 AbstractCegarLoop]: Abstraction has 1613 states and 5848 transitions. [2025-04-13 23:11:55,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:11:55,551 INFO L278 IsEmpty]: Start isEmpty. Operand 1613 states and 5848 transitions. [2025-04-13 23:11:55,554 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:11:55,554 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:11:55,554 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:11:55,560 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (132)] Ended with exit code 0 [2025-04-13 23:11:55,754 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 132 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable178 [2025-04-13 23:11:55,754 INFO L403 AbstractCegarLoop]: === Iteration 180 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:11:55,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:11:55,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1981075666, now seen corresponding path program 141 times [2025-04-13 23:11:55,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:11:55,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778331118] [2025-04-13 23:11:55,754 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:11:55,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:11:55,758 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:55,762 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:55,762 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:11:55,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:56,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:11:56,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778331118] [2025-04-13 23:11:56,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778331118] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:11:56,147 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387416417] [2025-04-13 23:11:56,147 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:11:56,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:11:56,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:11:56,149 INFO L229 MonitoredProcess]: Starting monitored process 133 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:11:56,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Waiting until timeout for monitored process [2025-04-13 23:11:56,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:11:56,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:11:56,259 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:11:56,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:11:56,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:11:56,260 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:11:56,722 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:56,723 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:11:56,886 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:11:56,886 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:11:57,636 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:11:57,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:11:57,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:11:57,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387416417] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:11:57,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:11:57,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 33 [2025-04-13 23:11:57,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100420405] [2025-04-13 23:11:57,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:11:57,936 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:11:57,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:11:57,936 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:11:57,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1035, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:11:57,936 INFO L87 Difference]: Start difference. First operand 1613 states and 5848 transitions. Second operand has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:04,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:04,066 INFO L93 Difference]: Finished difference Result 1992 states and 7305 transitions. [2025-04-13 23:12:04,066 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2025-04-13 23:12:04,066 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:04,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:04,071 INFO L225 Difference]: With dead ends: 1992 [2025-04-13 23:12:04,071 INFO L226 Difference]: Without dead ends: 1981 [2025-04-13 23:12:04,072 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2432 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=1170, Invalid=6840, Unknown=0, NotChecked=0, Total=8010 [2025-04-13 23:12:04,072 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 206 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3063 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 3063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:04,072 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 0 Invalid, 3204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 3063 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:12:04,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2025-04-13 23:12:04,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1627. [2025-04-13 23:12:04,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1627 states, 1626 states have (on average 3.627921279212792) internal successors, (5899), 1626 states have internal predecessors, (5899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:04,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1627 states to 1627 states and 5899 transitions. [2025-04-13 23:12:04,091 INFO L79 Accepts]: Start accepts. Automaton has 1627 states and 5899 transitions. Word has length 25 [2025-04-13 23:12:04,091 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:04,091 INFO L485 AbstractCegarLoop]: Abstraction has 1627 states and 5899 transitions. [2025-04-13 23:12:04,092 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 34 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:04,092 INFO L278 IsEmpty]: Start isEmpty. Operand 1627 states and 5899 transitions. [2025-04-13 23:12:04,093 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:04,094 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:04,094 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:04,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (133)] Forceful destruction successful, exit code 0 [2025-04-13 23:12:04,294 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 133 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable179 [2025-04-13 23:12:04,294 INFO L403 AbstractCegarLoop]: === Iteration 181 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:04,294 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:04,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1747674308, now seen corresponding path program 142 times [2025-04-13 23:12:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:04,294 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249678866] [2025-04-13 23:12:04,294 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:04,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:04,298 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:04,301 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:04,301 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:04,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:04,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:04,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:04,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249678866] [2025-04-13 23:12:04,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249678866] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:04,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654902502] [2025-04-13 23:12:04,517 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:04,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:04,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:04,518 INFO L229 MonitoredProcess]: Starting monitored process 134 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:04,519 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Waiting until timeout for monitored process [2025-04-13 23:12:04,615 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:04,627 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:04,627 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:04,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:04,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:12:04,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:05,042 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:05,042 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:12:05,106 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:05,106 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:05,590 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:05,590 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:12:06,446 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:06,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1654902502] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:06,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:06,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 9] total 30 [2025-04-13 23:12:06,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85585393] [2025-04-13 23:12:06,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:06,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-13 23:12:06,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:06,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-13 23:12:06,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=867, Unknown=0, NotChecked=0, Total=992 [2025-04-13 23:12:06,447 INFO L87 Difference]: Start difference. First operand 1627 states and 5899 transitions. Second operand has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:10,244 INFO L93 Difference]: Finished difference Result 2096 states and 7387 transitions. [2025-04-13 23:12:10,245 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:12:10,245 INFO L79 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:10,245 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:10,249 INFO L225 Difference]: With dead ends: 2096 [2025-04-13 23:12:10,249 INFO L226 Difference]: Without dead ends: 2080 [2025-04-13 23:12:10,250 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1937 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=780, Invalid=6360, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 23:12:10,250 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 307 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4237 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 4237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:10,250 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 0 Invalid, 4288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 4237 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-04-13 23:12:10,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2080 states. [2025-04-13 23:12:10,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2080 to 1697. [2025-04-13 23:12:10,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1696 states have (on average 3.642688679245283) internal successors, (6178), 1696 states have internal predecessors, (6178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 6178 transitions. [2025-04-13 23:12:10,276 INFO L79 Accepts]: Start accepts. Automaton has 1697 states and 6178 transitions. Word has length 25 [2025-04-13 23:12:10,276 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:10,276 INFO L485 AbstractCegarLoop]: Abstraction has 1697 states and 6178 transitions. [2025-04-13 23:12:10,276 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.032258064516129) internal successors, (63), 31 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:10,276 INFO L278 IsEmpty]: Start isEmpty. Operand 1697 states and 6178 transitions. [2025-04-13 23:12:10,278 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:10,279 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:10,279 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:10,285 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (134)] Ended with exit code 0 [2025-04-13 23:12:10,479 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable180,134 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:10,479 INFO L403 AbstractCegarLoop]: === Iteration 182 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:10,479 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:10,479 INFO L85 PathProgramCache]: Analyzing trace with hash -4266192, now seen corresponding path program 143 times [2025-04-13 23:12:10,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:10,479 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011198791] [2025-04-13 23:12:10,479 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:12:10,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:10,483 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:10,487 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:10,487 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:10,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:11,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:11,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011198791] [2025-04-13 23:12:11,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011198791] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:11,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1831685088] [2025-04-13 23:12:11,027 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:12:11,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:11,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:11,029 INFO L229 MonitoredProcess]: Starting monitored process 135 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:11,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Waiting until timeout for monitored process [2025-04-13 23:12:11,127 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:11,140 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:11,141 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:11,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:11,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:12:11,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:11,482 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:11,482 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 169 treesize of output 83 [2025-04-13 23:12:11,564 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:11,564 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:12,209 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:12,209 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:12:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1831685088] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:13,187 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:13,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:12:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404056070] [2025-04-13 23:12:13,187 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:13,187 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:12:13,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:13,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:12:13,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=993, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:12:13,188 INFO L87 Difference]: Start difference. First operand 1697 states and 6178 transitions. Second operand has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:16,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:16,563 INFO L93 Difference]: Finished difference Result 2145 states and 7757 transitions. [2025-04-13 23:12:16,563 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2025-04-13 23:12:16,564 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:16,564 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:16,569 INFO L225 Difference]: With dead ends: 2145 [2025-04-13 23:12:16,569 INFO L226 Difference]: Without dead ends: 2134 [2025-04-13 23:12:16,569 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1365 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=574, Invalid=4828, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:12:16,569 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 252 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3120 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 3120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:16,569 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 0 Invalid, 3217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 3120 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:12:16,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2025-04-13 23:12:16,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1701. [2025-04-13 23:12:16,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 3.643529411764706) internal successors, (6194), 1700 states have internal predecessors, (6194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:16,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 6194 transitions. [2025-04-13 23:12:16,592 INFO L79 Accepts]: Start accepts. Automaton has 1701 states and 6194 transitions. Word has length 25 [2025-04-13 23:12:16,593 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:16,593 INFO L485 AbstractCegarLoop]: Abstraction has 1701 states and 6194 transitions. [2025-04-13 23:12:16,593 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 33 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:16,593 INFO L278 IsEmpty]: Start isEmpty. Operand 1701 states and 6194 transitions. [2025-04-13 23:12:16,595 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:16,595 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:16,595 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:16,602 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (135)] Ended with exit code 0 [2025-04-13 23:12:16,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable181,135 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:16,796 INFO L403 AbstractCegarLoop]: === Iteration 183 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:16,796 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:16,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1243244614, now seen corresponding path program 144 times [2025-04-13 23:12:16,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:16,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959770107] [2025-04-13 23:12:16,796 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:16,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:16,800 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:16,805 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:16,805 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:16,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:17,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959770107] [2025-04-13 23:12:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959770107] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:17,191 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [537250252] [2025-04-13 23:12:17,191 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:17,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:17,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:17,193 INFO L229 MonitoredProcess]: Starting monitored process 136 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:17,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Waiting until timeout for monitored process [2025-04-13 23:12:17,292 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:17,305 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:17,305 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:17,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:17,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:12:17,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:17,779 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:17,779 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 99 [2025-04-13 23:12:17,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:17,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:18,576 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:18,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:12:18,889 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:18,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [537250252] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:18,889 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:18,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:12:18,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312233206] [2025-04-13 23:12:18,889 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:18,889 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:12:18,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:18,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:12:18,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1088, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:12:18,890 INFO L87 Difference]: Start difference. First operand 1701 states and 6194 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:23,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:23,189 INFO L93 Difference]: Finished difference Result 2113 states and 7575 transitions. [2025-04-13 23:12:23,189 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 23:12:23,189 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:23,189 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:23,194 INFO L225 Difference]: With dead ends: 2113 [2025-04-13 23:12:23,194 INFO L226 Difference]: Without dead ends: 2102 [2025-04-13 23:12:23,195 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2260 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1134, Invalid=6698, Unknown=0, NotChecked=0, Total=7832 [2025-04-13 23:12:23,195 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 240 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3150 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:23,195 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 0 Invalid, 3239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3150 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:12:23,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2102 states. [2025-04-13 23:12:23,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2102 to 1715. [2025-04-13 23:12:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 3.6406067677946323) internal successors, (6240), 1714 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:23,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 6240 transitions. [2025-04-13 23:12:23,219 INFO L79 Accepts]: Start accepts. Automaton has 1715 states and 6240 transitions. Word has length 25 [2025-04-13 23:12:23,219 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:23,219 INFO L485 AbstractCegarLoop]: Abstraction has 1715 states and 6240 transitions. [2025-04-13 23:12:23,219 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:23,219 INFO L278 IsEmpty]: Start isEmpty. Operand 1715 states and 6240 transitions. [2025-04-13 23:12:23,221 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:23,221 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:23,221 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:23,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (136)] Ended with exit code 0 [2025-04-13 23:12:23,421 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable182,136 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:23,422 INFO L403 AbstractCegarLoop]: === Iteration 184 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:23,422 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:23,422 INFO L85 PathProgramCache]: Analyzing trace with hash 301383950, now seen corresponding path program 145 times [2025-04-13 23:12:23,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:23,422 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451500356] [2025-04-13 23:12:23,422 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:12:23,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:23,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:12:23,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:12:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:23,877 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:23,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:23,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451500356] [2025-04-13 23:12:23,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451500356] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:23,878 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905928936] [2025-04-13 23:12:23,878 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:12:23,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:23,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:23,879 INFO L229 MonitoredProcess]: Starting monitored process 137 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:23,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Waiting until timeout for monitored process [2025-04-13 23:12:23,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:12:23,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:23,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:12:23,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:23,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:12:23,992 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:24,318 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:24,318 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:12:24,387 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:24,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:25,053 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:25,053 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:12:26,024 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:26,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905928936] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:26,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:26,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:12:26,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428672436] [2025-04-13 23:12:26,024 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:26,024 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:12:26,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:26,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:12:26,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=975, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:12:26,025 INFO L87 Difference]: Start difference. First operand 1715 states and 6240 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:29,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:29,033 INFO L93 Difference]: Finished difference Result 1983 states and 7183 transitions. [2025-04-13 23:12:29,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-04-13 23:12:29,033 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:29,033 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:29,038 INFO L225 Difference]: With dead ends: 1983 [2025-04-13 23:12:29,038 INFO L226 Difference]: Without dead ends: 1972 [2025-04-13 23:12:29,038 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1132 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=498, Invalid=4058, Unknown=0, NotChecked=0, Total=4556 [2025-04-13 23:12:29,039 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 242 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2422 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 2422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:29,039 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 0 Invalid, 2535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 2422 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:12:29,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2025-04-13 23:12:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1715. [2025-04-13 23:12:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1715 states, 1714 states have (on average 3.6406067677946323) internal successors, (6240), 1714 states have internal predecessors, (6240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 6240 transitions. [2025-04-13 23:12:29,060 INFO L79 Accepts]: Start accepts. Automaton has 1715 states and 6240 transitions. Word has length 25 [2025-04-13 23:12:29,060 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:29,060 INFO L485 AbstractCegarLoop]: Abstraction has 1715 states and 6240 transitions. [2025-04-13 23:12:29,060 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:29,060 INFO L278 IsEmpty]: Start isEmpty. Operand 1715 states and 6240 transitions. [2025-04-13 23:12:29,062 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:29,062 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:29,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:29,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (137)] Ended with exit code 0 [2025-04-13 23:12:29,262 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable183,137 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:29,262 INFO L403 AbstractCegarLoop]: === Iteration 185 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:29,263 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:29,263 INFO L85 PathProgramCache]: Analyzing trace with hash -742097244, now seen corresponding path program 146 times [2025-04-13 23:12:29,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:29,263 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308445208] [2025-04-13 23:12:29,263 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:29,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:29,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:29,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:29,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:29,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:29,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:29,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308445208] [2025-04-13 23:12:29,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308445208] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:29,637 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [746594512] [2025-04-13 23:12:29,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:12:29,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:29,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:29,638 INFO L229 MonitoredProcess]: Starting monitored process 138 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:29,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Waiting until timeout for monitored process [2025-04-13 23:12:29,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:29,750 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:29,750 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:29,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:29,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:12:29,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:30,140 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:30,141 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 101 [2025-04-13 23:12:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:30,444 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:31,049 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:31,049 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 287 treesize of output 127 [2025-04-13 23:12:31,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:31,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [746594512] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:31,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:31,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:12:31,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [129033184] [2025-04-13 23:12:31,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:31,352 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:12:31,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:31,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:12:31,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1060, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:12:31,353 INFO L87 Difference]: Start difference. First operand 1715 states and 6240 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:35,090 INFO L93 Difference]: Finished difference Result 2140 states and 7672 transitions. [2025-04-13 23:12:35,090 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2025-04-13 23:12:35,090 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:35,090 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:35,095 INFO L225 Difference]: With dead ends: 2140 [2025-04-13 23:12:35,096 INFO L226 Difference]: Without dead ends: 2129 [2025-04-13 23:12:35,096 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1977 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1030, Invalid=5942, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:12:35,097 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 263 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:35,097 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 0 Invalid, 2621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:12:35,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2129 states. [2025-04-13 23:12:35,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2129 to 1707. [2025-04-13 23:12:35,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 3.6412661195779603) internal successors, (6212), 1706 states have internal predecessors, (6212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:35,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 6212 transitions. [2025-04-13 23:12:35,122 INFO L79 Accepts]: Start accepts. Automaton has 1707 states and 6212 transitions. Word has length 25 [2025-04-13 23:12:35,122 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:35,122 INFO L485 AbstractCegarLoop]: Abstraction has 1707 states and 6212 transitions. [2025-04-13 23:12:35,122 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 35 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:35,122 INFO L278 IsEmpty]: Start isEmpty. Operand 1707 states and 6212 transitions. [2025-04-13 23:12:35,124 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:35,124 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:35,124 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:35,131 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (138)] Ended with exit code 0 [2025-04-13 23:12:35,325 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable184,138 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:35,325 INFO L403 AbstractCegarLoop]: === Iteration 186 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:35,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1968936814, now seen corresponding path program 147 times [2025-04-13 23:12:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:35,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038114158] [2025-04-13 23:12:35,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:12:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:35,329 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:35,333 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:35,333 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:12:35,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:35,772 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:35,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:35,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038114158] [2025-04-13 23:12:35,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038114158] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:35,772 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650492359] [2025-04-13 23:12:35,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:12:35,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:35,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:35,774 INFO L229 MonitoredProcess]: Starting monitored process 139 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:35,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Waiting until timeout for monitored process [2025-04-13 23:12:35,873 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:35,886 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:35,887 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:12:35,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:35,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:12:35,888 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:36,323 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:36,323 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 157 treesize of output 101 [2025-04-13 23:12:36,575 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:36,576 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:37,296 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:37,296 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:12:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:37,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650492359] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:37,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:37,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 32 [2025-04-13 23:12:37,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373914687] [2025-04-13 23:12:37,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:37,613 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:12:37,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:37,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:12:37,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:12:37,613 INFO L87 Difference]: Start difference. First operand 1707 states and 6212 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:43,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:43,193 INFO L93 Difference]: Finished difference Result 2191 states and 8022 transitions. [2025-04-13 23:12:43,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-13 23:12:43,193 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:43,193 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:43,198 INFO L225 Difference]: With dead ends: 2191 [2025-04-13 23:12:43,198 INFO L226 Difference]: Without dead ends: 2180 [2025-04-13 23:12:43,199 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1125, Invalid=5847, Unknown=0, NotChecked=0, Total=6972 [2025-04-13 23:12:43,199 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 175 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2449 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:43,199 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 0 Invalid, 2609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2449 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-04-13 23:12:43,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2025-04-13 23:12:43,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 1723. [2025-04-13 23:12:43,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1723 states, 1722 states have (on average 3.6515679442508713) internal successors, (6288), 1722 states have internal predecessors, (6288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:43,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 6288 transitions. [2025-04-13 23:12:43,224 INFO L79 Accepts]: Start accepts. Automaton has 1723 states and 6288 transitions. Word has length 25 [2025-04-13 23:12:43,224 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:43,224 INFO L485 AbstractCegarLoop]: Abstraction has 1723 states and 6288 transitions. [2025-04-13 23:12:43,224 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:43,224 INFO L278 IsEmpty]: Start isEmpty. Operand 1723 states and 6288 transitions. [2025-04-13 23:12:43,227 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:43,227 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:43,227 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:43,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (139)] Ended with exit code 0 [2025-04-13 23:12:43,427 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable185,139 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:43,427 INFO L403 AbstractCegarLoop]: === Iteration 187 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:43,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:43,427 INFO L85 PathProgramCache]: Analyzing trace with hash -436447102, now seen corresponding path program 148 times [2025-04-13 23:12:43,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:43,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42002953] [2025-04-13 23:12:43,428 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:43,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:43,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:43,435 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:43,435 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:43,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:43,719 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:43,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:43,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42002953] [2025-04-13 23:12:43,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42002953] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:43,720 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1080427982] [2025-04-13 23:12:43,720 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:12:43,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:43,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:43,721 INFO L229 MonitoredProcess]: Starting monitored process 140 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:43,722 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Waiting until timeout for monitored process [2025-04-13 23:12:43,823 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:43,836 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:43,836 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:12:43,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:43,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:12:43,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:44,211 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:44,211 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 85 [2025-04-13 23:12:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:12:44,278 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:44,801 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:44,801 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:12:45,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:45,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1080427982] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:45,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:45,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 9] total 31 [2025-04-13 23:12:45,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410906849] [2025-04-13 23:12:45,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:45,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:12:45,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:45,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:12:45,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=917, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:12:45,680 INFO L87 Difference]: Start difference. First operand 1723 states and 6288 transitions. Second operand has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:49,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:49,257 INFO L93 Difference]: Finished difference Result 2087 states and 7485 transitions. [2025-04-13 23:12:49,257 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2025-04-13 23:12:49,257 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:49,257 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:49,262 INFO L225 Difference]: With dead ends: 2087 [2025-04-13 23:12:49,262 INFO L226 Difference]: Without dead ends: 2076 [2025-04-13 23:12:49,263 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2194 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=846, Invalid=6810, Unknown=0, NotChecked=0, Total=7656 [2025-04-13 23:12:49,263 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3505 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 3505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:49,263 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 3587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 3505 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:12:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2076 states. [2025-04-13 23:12:49,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2076 to 1739. [2025-04-13 23:12:49,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1738 states have (on average 3.651898734177215) internal successors, (6347), 1738 states have internal predecessors, (6347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:49,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 6347 transitions. [2025-04-13 23:12:49,285 INFO L79 Accepts]: Start accepts. Automaton has 1739 states and 6347 transitions. Word has length 25 [2025-04-13 23:12:49,285 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:49,285 INFO L485 AbstractCegarLoop]: Abstraction has 1739 states and 6347 transitions. [2025-04-13 23:12:49,285 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.96875) internal successors, (63), 32 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:49,285 INFO L278 IsEmpty]: Start isEmpty. Operand 1739 states and 6347 transitions. [2025-04-13 23:12:49,287 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:49,287 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:49,287 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:49,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (140)] Ended with exit code 0 [2025-04-13 23:12:49,487 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 140 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable186 [2025-04-13 23:12:49,487 INFO L403 AbstractCegarLoop]: === Iteration 188 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:49,487 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:49,488 INFO L85 PathProgramCache]: Analyzing trace with hash 63700768, now seen corresponding path program 149 times [2025-04-13 23:12:49,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:49,488 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248967687] [2025-04-13 23:12:49,488 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:12:49,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:49,492 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:49,496 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:49,496 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:49,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:12:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:50,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248967687] [2025-04-13 23:12:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248967687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:50,127 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573375274] [2025-04-13 23:12:50,127 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:12:50,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:50,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:50,128 INFO L229 MonitoredProcess]: Starting monitored process 141 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:50,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Waiting until timeout for monitored process [2025-04-13 23:12:50,228 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:50,241 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:50,241 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:12:50,241 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:50,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:12:50,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:50,726 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:50,727 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 85 [2025-04-13 23:12:50,785 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:50,785 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:51,435 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:51,435 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 377 treesize of output 165 [2025-04-13 23:12:52,269 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:52,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573375274] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:52,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:52,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 31 [2025-04-13 23:12:52,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407371254] [2025-04-13 23:12:52,269 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:52,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:12:52,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:52,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:12:52,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=951, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:12:52,270 INFO L87 Difference]: Start difference. First operand 1739 states and 6347 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:55,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:12:55,439 INFO L93 Difference]: Finished difference Result 2118 states and 7749 transitions. [2025-04-13 23:12:55,439 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-04-13 23:12:55,439 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:12:55,439 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:12:55,444 INFO L225 Difference]: With dead ends: 2118 [2025-04-13 23:12:55,444 INFO L226 Difference]: Without dead ends: 2112 [2025-04-13 23:12:55,444 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=391, Invalid=3641, Unknown=0, NotChecked=0, Total=4032 [2025-04-13 23:12:55,445 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 243 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3112 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 3112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:12:55,445 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [243 Valid, 0 Invalid, 3201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 3112 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:12:55,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2025-04-13 23:12:55,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 1741. [2025-04-13 23:12:55,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1741 states, 1740 states have (on average 3.654022988505747) internal successors, (6358), 1740 states have internal predecessors, (6358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:55,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1741 states to 1741 states and 6358 transitions. [2025-04-13 23:12:55,486 INFO L79 Accepts]: Start accepts. Automaton has 1741 states and 6358 transitions. Word has length 25 [2025-04-13 23:12:55,487 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:12:55,487 INFO L485 AbstractCegarLoop]: Abstraction has 1741 states and 6358 transitions. [2025-04-13 23:12:55,487 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:12:55,487 INFO L278 IsEmpty]: Start isEmpty. Operand 1741 states and 6358 transitions. [2025-04-13 23:12:55,489 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:12:55,489 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:12:55,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:12:55,495 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (141)] Ended with exit code 0 [2025-04-13 23:12:55,689 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable187,141 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:55,689 INFO L403 AbstractCegarLoop]: === Iteration 189 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:12:55,690 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:12:55,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1427799308, now seen corresponding path program 150 times [2025-04-13 23:12:55,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:12:55,690 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395423555] [2025-04-13 23:12:55,690 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:55,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:12:55,694 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:55,698 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:55,698 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:55,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:56,068 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:56,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:12:56,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395423555] [2025-04-13 23:12:56,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395423555] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:12:56,068 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1538963221] [2025-04-13 23:12:56,068 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:12:56,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:12:56,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:12:56,070 INFO L229 MonitoredProcess]: Starting monitored process 142 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:12:56,071 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Waiting until timeout for monitored process [2025-04-13 23:12:56,170 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:12:56,183 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:12:56,183 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:12:56,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:12:56,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:12:56,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:12:56,689 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:56,689 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:12:56,963 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:56,964 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:12:57,487 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:12:57,488 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:12:57,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:12:57,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1538963221] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:12:57,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:12:57,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:12:57,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358932380] [2025-04-13 23:12:57,818 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:12:57,818 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:12:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:12:57,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:12:57,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1012, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:12:57,818 INFO L87 Difference]: Start difference. First operand 1741 states and 6358 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:01,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:01,729 INFO L93 Difference]: Finished difference Result 2269 states and 8039 transitions. [2025-04-13 23:13:01,729 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2025-04-13 23:13:01,730 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:13:01,730 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:01,735 INFO L225 Difference]: With dead ends: 2269 [2025-04-13 23:13:01,735 INFO L226 Difference]: Without dead ends: 2253 [2025-04-13 23:13:01,735 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1934 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1039, Invalid=5603, Unknown=0, NotChecked=0, Total=6642 [2025-04-13 23:13:01,735 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 279 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2286 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 2286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:01,735 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 0 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 2286 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:13:01,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2253 states. [2025-04-13 23:13:01,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2253 to 1747. [2025-04-13 23:13:01,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1746 states have (on average 3.6557846506300113) internal successors, (6383), 1746 states have internal predecessors, (6383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:01,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 6383 transitions. [2025-04-13 23:13:01,758 INFO L79 Accepts]: Start accepts. Automaton has 1747 states and 6383 transitions. Word has length 25 [2025-04-13 23:13:01,759 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:01,759 INFO L485 AbstractCegarLoop]: Abstraction has 1747 states and 6383 transitions. [2025-04-13 23:13:01,759 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:01,759 INFO L278 IsEmpty]: Start isEmpty. Operand 1747 states and 6383 transitions. [2025-04-13 23:13:01,761 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:01,761 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:01,761 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:01,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (142)] Ended with exit code 0 [2025-04-13 23:13:01,961 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable188,142 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:01,961 INFO L403 AbstractCegarLoop]: === Iteration 190 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:01,961 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 163984530, now seen corresponding path program 151 times [2025-04-13 23:13:01,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:01,962 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133201196] [2025-04-13 23:13:01,962 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:13:01,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:01,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:13:01,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:01,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:01,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:02,570 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:02,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:02,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133201196] [2025-04-13 23:13:02,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133201196] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:02,571 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918454075] [2025-04-13 23:13:02,571 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-13 23:13:02,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:02,572 INFO L229 MonitoredProcess]: Starting monitored process 143 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:02,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Waiting until timeout for monitored process [2025-04-13 23:13:02,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-13 23:13:02,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:02,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:13:02,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:02,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:13:02,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:03,080 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:03,081 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 167 treesize of output 85 [2025-04-13 23:13:03,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:03,151 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:03,856 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:03,857 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:13:04,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:04,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918454075] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:04,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:04,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9] total 32 [2025-04-13 23:13:04,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850951692] [2025-04-13 23:13:04,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:04,879 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-04-13 23:13:04,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:04,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-04-13 23:13:04,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=995, Unknown=0, NotChecked=0, Total=1122 [2025-04-13 23:13:04,879 INFO L87 Difference]: Start difference. First operand 1747 states and 6383 transitions. Second operand has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:09,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:09,241 INFO L93 Difference]: Finished difference Result 2038 states and 7402 transitions. [2025-04-13 23:13:09,242 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 23:13:09,242 INFO L79 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:13:09,242 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:09,246 INFO L225 Difference]: With dead ends: 2038 [2025-04-13 23:13:09,247 INFO L226 Difference]: Without dead ends: 2027 [2025-04-13 23:13:09,247 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1592 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=668, Invalid=5494, Unknown=0, NotChecked=0, Total=6162 [2025-04-13 23:13:09,247 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 284 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3274 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 3274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:09,247 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 0 Invalid, 3396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 3274 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-04-13 23:13:09,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2027 states. [2025-04-13 23:13:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2027 to 1755. [2025-04-13 23:13:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 3.6573546180159635) internal successors, (6415), 1754 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 6415 transitions. [2025-04-13 23:13:09,270 INFO L79 Accepts]: Start accepts. Automaton has 1755 states and 6415 transitions. Word has length 25 [2025-04-13 23:13:09,270 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:09,270 INFO L485 AbstractCegarLoop]: Abstraction has 1755 states and 6415 transitions. [2025-04-13 23:13:09,270 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.090909090909091) internal successors, (69), 33 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:09,270 INFO L278 IsEmpty]: Start isEmpty. Operand 1755 states and 6415 transitions. [2025-04-13 23:13:09,272 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:09,272 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:09,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:09,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (143)] Ended with exit code 0 [2025-04-13 23:13:09,473 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 143 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable189 [2025-04-13 23:13:09,473 INFO L403 AbstractCegarLoop]: === Iteration 191 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:09,473 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:09,473 INFO L85 PathProgramCache]: Analyzing trace with hash 604838274, now seen corresponding path program 152 times [2025-04-13 23:13:09,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:09,473 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493311257] [2025-04-13 23:13:09,473 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:09,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:09,478 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:09,481 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:09,481 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:09,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:09,882 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:09,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:09,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493311257] [2025-04-13 23:13:09,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493311257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:09,882 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981848261] [2025-04-13 23:13:09,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:13:09,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:09,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:09,884 INFO L229 MonitoredProcess]: Starting monitored process 144 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:09,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Waiting until timeout for monitored process [2025-04-13 23:13:09,986 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:09,999 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:09,999 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:09,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:10,000 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:13:10,001 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:10,628 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:13:10,631 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:10,631 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 175 treesize of output 91 [2025-04-13 23:13:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:10,777 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:11,324 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:11,324 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:13:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:11,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981848261] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:11,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:11,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:13:11,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131344557] [2025-04-13 23:13:11,657 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:11,657 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:13:11,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:11,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:13:11,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:13:11,658 INFO L87 Difference]: Start difference. First operand 1755 states and 6415 transitions. Second operand has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:14,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:14,853 INFO L93 Difference]: Finished difference Result 2227 states and 7936 transitions. [2025-04-13 23:13:14,853 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-04-13 23:13:14,853 INFO L79 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:13:14,853 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:14,858 INFO L225 Difference]: With dead ends: 2227 [2025-04-13 23:13:14,858 INFO L226 Difference]: Without dead ends: 2216 [2025-04-13 23:13:14,859 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1355 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=751, Invalid=4361, Unknown=0, NotChecked=0, Total=5112 [2025-04-13 23:13:14,859 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 244 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2426 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 2426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:14,859 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 0 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 2426 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-04-13 23:13:14,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2216 states. [2025-04-13 23:13:14,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2216 to 1755. [2025-04-13 23:13:14,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1755 states, 1754 states have (on average 3.6573546180159635) internal successors, (6415), 1754 states have internal predecessors, (6415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1755 states to 1755 states and 6415 transitions. [2025-04-13 23:13:14,895 INFO L79 Accepts]: Start accepts. Automaton has 1755 states and 6415 transitions. Word has length 25 [2025-04-13 23:13:14,895 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:14,895 INFO L485 AbstractCegarLoop]: Abstraction has 1755 states and 6415 transitions. [2025-04-13 23:13:14,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8529411764705883) internal successors, (63), 34 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:14,895 INFO L278 IsEmpty]: Start isEmpty. Operand 1755 states and 6415 transitions. [2025-04-13 23:13:14,898 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:14,898 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:14,898 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:14,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (144)] Forceful destruction successful, exit code 0 [2025-04-13 23:13:15,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 144 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable190 [2025-04-13 23:13:15,098 INFO L403 AbstractCegarLoop]: === Iteration 192 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:15,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:15,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1050212776, now seen corresponding path program 153 times [2025-04-13 23:13:15,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:15,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397037360] [2025-04-13 23:13:15,099 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:15,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:15,103 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:15,107 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:15,107 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:13:15,107 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:15,567 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:15,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:15,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397037360] [2025-04-13 23:13:15,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397037360] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:15,567 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091232101] [2025-04-13 23:13:15,567 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:13:15,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:15,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:15,569 INFO L229 MonitoredProcess]: Starting monitored process 145 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:15,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Waiting until timeout for monitored process [2025-04-13 23:13:15,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:15,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:15,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-13 23:13:15,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:15,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-04-13 23:13:15,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:16,082 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:13:16,088 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:16,088 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 167 treesize of output 99 [2025-04-13 23:13:16,467 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:16,467 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:17,233 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:17,234 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 230 treesize of output 110 [2025-04-13 23:13:17,513 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:17,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091232101] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:17,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:17,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 11] total 34 [2025-04-13 23:13:17,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533853287] [2025-04-13 23:13:17,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:17,514 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:13:17,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:17,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:13:17,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=1081, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:13:17,514 INFO L87 Difference]: Start difference. First operand 1755 states and 6415 transitions. Second operand has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:24,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:24,737 INFO L93 Difference]: Finished difference Result 2242 states and 8154 transitions. [2025-04-13 23:13:24,737 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2025-04-13 23:13:24,737 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:13:24,737 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:24,742 INFO L225 Difference]: With dead ends: 2242 [2025-04-13 23:13:24,742 INFO L226 Difference]: Without dead ends: 2231 [2025-04-13 23:13:24,743 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2955 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1366, Invalid=8140, Unknown=0, NotChecked=0, Total=9506 [2025-04-13 23:13:24,743 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 273 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3022 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 3022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:24,743 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 0 Invalid, 3201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 3022 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:13:24,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2025-04-13 23:13:24,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1771. [2025-04-13 23:13:24,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1770 states have (on average 3.6740112994350285) internal successors, (6503), 1770 states have internal predecessors, (6503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:24,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 6503 transitions. [2025-04-13 23:13:24,765 INFO L79 Accepts]: Start accepts. Automaton has 1771 states and 6503 transitions. Word has length 25 [2025-04-13 23:13:24,766 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:24,766 INFO L485 AbstractCegarLoop]: Abstraction has 1771 states and 6503 transitions. [2025-04-13 23:13:24,766 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8285714285714285) internal successors, (64), 35 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:24,766 INFO L278 IsEmpty]: Start isEmpty. Operand 1771 states and 6503 transitions. [2025-04-13 23:13:24,768 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:24,768 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:24,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:24,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (145)] Ended with exit code 0 [2025-04-13 23:13:24,968 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 145 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable191 [2025-04-13 23:13:24,968 INFO L403 AbstractCegarLoop]: === Iteration 193 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:24,969 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:24,969 INFO L85 PathProgramCache]: Analyzing trace with hash -1968756822, now seen corresponding path program 154 times [2025-04-13 23:13:24,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:24,969 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925183744] [2025-04-13 23:13:24,969 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:24,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:24,973 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:24,976 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:24,976 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:24,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:25,328 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:25,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:25,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925183744] [2025-04-13 23:13:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925183744] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:25,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325858802] [2025-04-13 23:13:25,329 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:13:25,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:25,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:25,330 INFO L229 MonitoredProcess]: Starting monitored process 146 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:25,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Waiting until timeout for monitored process [2025-04-13 23:13:25,432 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:25,444 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:25,445 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:13:25,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:25,445 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:13:25,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:25,996 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:25,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 151 treesize of output 83 [2025-04-13 23:13:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:26,053 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:26,548 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:26,548 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 381 treesize of output 169 [2025-04-13 23:13:27,389 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:27,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325858802] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:27,389 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:27,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 9] total 31 [2025-04-13 23:13:27,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598215937] [2025-04-13 23:13:27,390 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:27,390 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-13 23:13:27,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:27,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-13 23:13:27,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2025-04-13 23:13:27,390 INFO L87 Difference]: Start difference. First operand 1771 states and 6503 transitions. Second operand has 33 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:31,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:31,034 INFO L93 Difference]: Finished difference Result 2194 states and 7717 transitions. [2025-04-13 23:13:31,034 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-04-13 23:13:31,034 INFO L79 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:13:31,034 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:31,039 INFO L225 Difference]: With dead ends: 2194 [2025-04-13 23:13:31,039 INFO L226 Difference]: Without dead ends: 2178 [2025-04-13 23:13:31,039 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=509, Invalid=5041, Unknown=0, NotChecked=0, Total=5550 [2025-04-13 23:13:31,040 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 264 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4531 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 4569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 4531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:31,040 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [264 Valid, 0 Invalid, 4569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 4531 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-04-13 23:13:31,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2178 states. [2025-04-13 23:13:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2178 to 1780. [2025-04-13 23:13:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1779 states have (on average 3.6767847105115234) internal successors, (6541), 1779 states have internal predecessors, (6541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:31,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 6541 transitions. [2025-04-13 23:13:31,063 INFO L79 Accepts]: Start accepts. Automaton has 1780 states and 6541 transitions. Word has length 25 [2025-04-13 23:13:31,063 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:31,063 INFO L485 AbstractCegarLoop]: Abstraction has 1780 states and 6541 transitions. [2025-04-13 23:13:31,063 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.0625) internal successors, (66), 32 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:31,063 INFO L278 IsEmpty]: Start isEmpty. Operand 1780 states and 6541 transitions. [2025-04-13 23:13:31,065 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:31,065 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:31,065 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:31,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (146)] Ended with exit code 0 [2025-04-13 23:13:31,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable192,146 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:31,266 INFO L403 AbstractCegarLoop]: === Iteration 194 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:31,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:31,266 INFO L85 PathProgramCache]: Analyzing trace with hash 781430686, now seen corresponding path program 155 times [2025-04-13 23:13:31,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:31,266 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876520341] [2025-04-13 23:13:31,266 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:13:31,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:31,270 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:31,274 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:31,274 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:31,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:13:31,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:31,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876520341] [2025-04-13 23:13:31,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876520341] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:31,961 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772304309] [2025-04-13 23:13:31,961 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-13 23:13:31,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:31,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:31,963 INFO L229 MonitoredProcess]: Starting monitored process 147 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:31,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Waiting until timeout for monitored process [2025-04-13 23:13:32,065 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:32,078 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:32,078 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:13:32,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:32,078 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-13 23:13:32,079 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:32,449 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-13 23:13:32,452 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:32,452 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 161 treesize of output 91 [2025-04-13 23:13:32,630 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:13:32,631 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:33,319 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:33,319 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 369 treesize of output 169 [2025-04-13 23:13:34,249 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:34,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1772304309] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:34,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:34,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 9] total 34 [2025-04-13 23:13:34,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350591772] [2025-04-13 23:13:34,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:34,250 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-04-13 23:13:34,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:34,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-04-13 23:13:34,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2025-04-13 23:13:34,250 INFO L87 Difference]: Start difference. First operand 1780 states and 6541 transitions. Second operand has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:37,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 23:13:37,988 INFO L93 Difference]: Finished difference Result 2233 states and 8092 transitions. [2025-04-13 23:13:37,988 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-04-13 23:13:37,988 INFO L79 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-04-13 23:13:37,988 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 23:13:38,003 INFO L225 Difference]: With dead ends: 2233 [2025-04-13 23:13:38,003 INFO L226 Difference]: Without dead ends: 2227 [2025-04-13 23:13:38,004 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1290 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=579, Invalid=4823, Unknown=0, NotChecked=0, Total=5402 [2025-04-13 23:13:38,004 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 288 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 3672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:38,004 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 0 Invalid, 3672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-04-13 23:13:38,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2025-04-13 23:13:38,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 1786. [2025-04-13 23:13:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1786 states, 1785 states have (on average 3.676190476190476) internal successors, (6562), 1785 states have internal predecessors, (6562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:38,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 6562 transitions. [2025-04-13 23:13:38,026 INFO L79 Accepts]: Start accepts. Automaton has 1786 states and 6562 transitions. Word has length 25 [2025-04-13 23:13:38,026 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 23:13:38,026 INFO L485 AbstractCegarLoop]: Abstraction has 1786 states and 6562 transitions. [2025-04-13 23:13:38,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.9714285714285715) internal successors, (69), 35 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 23:13:38,026 INFO L278 IsEmpty]: Start isEmpty. Operand 1786 states and 6562 transitions. [2025-04-13 23:13:38,028 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-04-13 23:13:38,028 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 23:13:38,028 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:13:38,034 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (147)] Ended with exit code 0 [2025-04-13 23:13:38,228 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable193,147 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:38,229 INFO L403 AbstractCegarLoop]: === Iteration 195 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-13 23:13:38,229 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:13:38,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1700838628, now seen corresponding path program 156 times [2025-04-13 23:13:38,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:13:38,229 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499118779] [2025-04-13 23:13:38,229 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:13:38,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:13:38,233 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:38,237 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:38,237 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:13:38,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:38,591 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:38,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:13:38,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499118779] [2025-04-13 23:13:38,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499118779] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:13:38,592 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1193841650] [2025-04-13 23:13:38,592 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-13 23:13:38,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:38,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:13:38,593 INFO L229 MonitoredProcess]: Starting monitored process 148 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-13 23:13:38,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Waiting until timeout for monitored process [2025-04-13 23:13:38,696 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 25 statements into 2 equivalence classes. [2025-04-13 23:13:38,709 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-13 23:13:38,709 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-13 23:13:38,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:13:38,709 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:13:38,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:13:39,107 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:39,107 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 163 treesize of output 99 [2025-04-13 23:13:39,388 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:39,389 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:13:39,992 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-13 23:13:39,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 295 treesize of output 127 [2025-04-13 23:13:40,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:13:40,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1193841650] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:13:40,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:13:40,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 11] total 33 [2025-04-13 23:13:40,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858162246] [2025-04-13 23:13:40,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:13:40,291 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:13:40,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:13:40,291 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:13:40,291 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=991, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:13:40,291 INFO L87 Difference]: Start difference. First operand 1786 states and 6562 transitions. Second operand has 35 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 34 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2025-04-13 23:13:41,197 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:13:41,203 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:13:41,203 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=334, Invalid=1646, Unknown=0, NotChecked=0, Total=1980 [2025-04-13 23:13:41,203 INFO L437 NwaCegarLoop]: 0 mSDtfsCounter, 76 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 980 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 980 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-04-13 23:13:41,203 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 0 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 980 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-04-13 23:13:41,204 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-13 23:13:41,209 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 23:13:41,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (148)] Ended with exit code 0 [2025-04-13 23:13:41,409 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable194,148 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:13:41,409 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (1786states) and FLOYD_HOARE automaton (currently 19 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-3-4-2-2-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-2-2-1 context. [2025-04-13 23:13:41,410 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-13 23:13:41,410 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-13 23:13:41,411 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-13 23:13:41,412 INFO L422 BasicCegarLoop]: Path program histogram: [156, 28, 7, 1, 1, 1, 1] [2025-04-13 23:13:41,414 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 23:13:41,414 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 23:13:41,416 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 11:13:41 BasicIcfg [2025-04-13 23:13:41,416 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 23:13:41,416 INFO L158 Benchmark]: Toolchain (without parser) took 834369.64ms. Allocated memory was 125.8MB in the beginning and 687.9MB in the end (delta: 562.0MB). Free memory was 87.8MB in the beginning and 487.6MB in the end (delta: -399.7MB). Peak memory consumption was 161.4MB. Max. memory is 8.0GB. [2025-04-13 23:13:41,416 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:13:41,416 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.42ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 72.6MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-13 23:13:41,416 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.26ms. Allocated memory is still 125.8MB. Free memory was 72.6MB in the beginning and 70.9MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 23:13:41,416 INFO L158 Benchmark]: Boogie Preprocessor took 37.98ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 69.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 23:13:41,416 INFO L158 Benchmark]: IcfgBuilder took 589.39ms. Allocated memory is still 125.8MB. Free memory was 69.1MB in the beginning and 23.8MB in the end (delta: 45.2MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-13 23:13:41,416 INFO L158 Benchmark]: TraceAbstraction took 833443.62ms. Allocated memory was 125.8MB in the beginning and 687.9MB in the end (delta: 562.0MB). Free memory was 23.0MB in the beginning and 487.6MB in the end (delta: -464.6MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. [2025-04-13 23:13:41,417 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 87.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 262.42ms. Allocated memory is still 125.8MB. Free memory was 87.8MB in the beginning and 72.6MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.26ms. Allocated memory is still 125.8MB. Free memory was 72.6MB in the beginning and 70.9MB in the end (delta: 1.7MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.98ms. Allocated memory is still 125.8MB. Free memory was 70.9MB in the beginning and 69.1MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 589.39ms. Allocated memory is still 125.8MB. Free memory was 69.1MB in the beginning and 23.8MB in the end (delta: 45.2MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 833443.62ms. Allocated memory was 125.8MB in the beginning and 687.9MB in the end (delta: 562.0MB). Free memory was 23.0MB in the beginning and 487.6MB in the end (delta: -464.6MB). Peak memory consumption was 98.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 100]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (1786states) and FLOYD_HOARE automaton (currently 19 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-3-4-2-2-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-2-2-1 context. - TimeoutResultAtElement [Line: 94]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1786states) and FLOYD_HOARE automaton (currently 19 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-3-4-2-2-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-2-2-1 context. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1786states) and FLOYD_HOARE automaton (currently 19 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-3-4-2-2-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-2-2-1 context. - TimeoutResultAtElement [Line: 93]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (1786states) and FLOYD_HOARE automaton (currently 19 states, 35 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDA2 was simplifying a ∧-3-4-2-2-2-2-2-2-1 term,while SimplifyDDA2 was simplifying 2 xjuncts wrt. a ∨-2-2-2-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 41 locations, 53 edges, 4 error locations. Started 1 CEGAR loops. OverallTime: 833.3s, OverallIterations: 195, TraceHistogramMax: 2, PathProgramHistogramMax: 156, EmptinessCheckTime: 0.3s, AutomataDifference: 489.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 36151 SdHoareTripleChecker+Valid, 169.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 36151 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 148.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 10385 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 355565 IncrementalHoareTripleChecker+Invalid, 365950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10385 mSolverCounterUnsat, 0 mSDtfsCounter, 355565 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14986 GetRequests, 4163 SyntacticMatches, 20 SemanticMatches, 10802 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229159 ImplicationChecksByTransitivity, 400.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1786occurred in iteration=194, InterpolantAutomatonStates: 8231, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.5s AutomataMinimizationTime, 194 MinimizatonAttempts, 47558 StatesRemovedByMinimization, 190 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.2s SsaConstructionTime, 2.9s SatisfiabilityAnalysisTime, 297.1s InterpolantComputationTime, 8318 NumberOfCodeBlocks, 8254 NumberOfCodeBlocksAsserted, 578 NumberOfCheckSat, 11235 ConstructedInterpolants, 0 QuantifiedInterpolants, 452363 SizeOfPredicates, 2187 NumberOfNonLiveVariables, 27402 ConjunctsInSsa, 3690 ConjunctsInUnsatCore, 480 InterpolantComputations, 71 PerfectInterpolantSequences, 1052/1795 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown