/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 16:53:46,241 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 16:53:46,283 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 16:53:46,286 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 16:53:46,286 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 16:53:46,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 16:53:46,304 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 16:53:46,304 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 16:53:46,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 16:53:46,305 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 16:53:46,305 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 16:53:46,305 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 16:53:46,306 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 16:53:46,306 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 16:53:46,306 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 16:53:46,306 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 16:53:46,306 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 16:53:46,306 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 16:53:46,306 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 16:53:46,306 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 16:53:46,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:46,307 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:46,307 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:46,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 16:53:46,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 16:53:46,308 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 [2025-04-13 16:53:46,517 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 16:53:46,524 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 16:53:46,525 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 16:53:46,527 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 16:53:46,528 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 16:53:46,530 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/fib_unsafe-7.i [2025-04-13 16:53:47,775 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de6d7f74/f4f1cfdd5d8a4916934811cde47ac7db/FLAG242848a1b [2025-04-13 16:53:48,036 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 16:53:48,036 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i [2025-04-13 16:53:48,049 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de6d7f74/f4f1cfdd5d8a4916934811cde47ac7db/FLAG242848a1b [2025-04-13 16:53:48,775 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2de6d7f74/f4f1cfdd5d8a4916934811cde47ac7db [2025-04-13 16:53:48,777 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 16:53:48,778 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 16:53:48,779 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:48,779 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 16:53:48,782 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 16:53:48,782 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:48" (1/1) ... [2025-04-13 16:53:48,783 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@650ca1a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:48, skipping insertion in model container [2025-04-13 16:53:48,783 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 04:53:48" (1/1) ... [2025-04-13 16:53:48,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 16:53:49,021 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2025-04-13 16:53:49,041 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:49,048 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 16:53:49,088 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/fib_unsafe-7.i[30243,30256] [2025-04-13 16:53:49,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 16:53:49,121 INFO L204 MainTranslator]: Completed translation [2025-04-13 16:53:49,122 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49 WrapperNode [2025-04-13 16:53:49,122 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 16:53:49,122 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:49,122 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 16:53:49,122 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 16:53:49,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,135 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,147 INFO L138 Inliner]: procedures = 164, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 63 [2025-04-13 16:53:49,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 16:53:49,148 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 16:53:49,148 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 16:53:49,148 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 16:53:49,153 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,156 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,172 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-04-13 16:53:49,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,172 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,175 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,175 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,177 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,178 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,178 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 16:53:49,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-13 16:53:49,181 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-13 16:53:49,181 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-13 16:53:49,182 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (1/1) ... [2025-04-13 16:53:49,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 16:53:49,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:49,209 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 16:53:49,213 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 16:53:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 16:53:49,228 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 16:53:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 16:53:49,228 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 16:53:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-13 16:53:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 16:53:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 16:53:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-13 16:53:49,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 16:53:49,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 16:53:49,229 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 16:53:49,320 INFO L234 CfgBuilder]: Building ICFG [2025-04-13 16:53:49,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 16:53:49,439 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 16:53:49,439 INFO L289 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 16:53:49,440 INFO L294 CfgBuilder]: Performing block encoding [2025-04-13 16:53:49,527 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:49,529 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 16:53:49,533 INFO L313 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 16:53:49,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:49 BoogieIcfgContainer [2025-04-13 16:53:49,534 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-13 16:53:49,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 16:53:49,536 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 16:53:49,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 16:53:49,540 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 04:53:48" (1/3) ... [2025-04-13 16:53:49,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326a48a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:49, skipping insertion in model container [2025-04-13 16:53:49,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 04:53:49" (2/3) ... [2025-04-13 16:53:49,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@326a48a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 04:53:49, skipping insertion in model container [2025-04-13 16:53:49,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 04:53:49" (3/3) ... [2025-04-13 16:53:49,542 INFO L128 eAbstractionObserver]: Analyzing ICFG fib_unsafe-7.i [2025-04-13 16:53:49,555 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 16:53:49,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG fib_unsafe-7.i that has 3 procedures, 21 locations, 23 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-13 16:53:49,556 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 16:53:49,599 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-13 16:53:49,621 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 25 transitions, 58 flow [2025-04-13 16:53:49,639 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:49,659 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 16:53:49,668 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;@8dd2938, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 16:53:49,668 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-13 16:53:49,670 INFO L278 IsEmpty]: Start isEmpty. Operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:49,673 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-04-13 16:53:49,673 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:49,674 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:49,674 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:49,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1561770242, now seen corresponding path program 1 times [2025-04-13 16:53:49,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:49,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076954208] [2025-04-13 16:53:49,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:49,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:49,752 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 16:53:49,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 16:53:49,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:49,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:49,868 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 16:53:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:49,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076954208] [2025-04-13 16:53:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2076954208] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 16:53:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 16:53:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 16:53:49,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067638442] [2025-04-13 16:53:49,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 16:53:49,873 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 16:53:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:49,884 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 16:53:49,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 16:53:49,886 INFO L87 Difference]: Start difference. First operand has 93 states, 92 states have (on average 3.2934782608695654) internal successors, (303), 92 states have internal predecessors, (303), 0 states have call successors, (0), 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 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:49,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:49,948 INFO L93 Difference]: Finished difference Result 173 states and 570 transitions. [2025-04-13 16:53:49,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 16:53:49,950 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2025-04-13 16:53:49,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:49,956 INFO L225 Difference]: With dead ends: 173 [2025-04-13 16:53:49,956 INFO L226 Difference]: Without dead ends: 109 [2025-04-13 16:53:49,960 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 16:53:49,963 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:49,964 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 8 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-13 16:53:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-04-13 16:53:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2025-04-13 16:53:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 2.861111111111111) internal successors, (309), 108 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 309 transitions. [2025-04-13 16:53:49,993 INFO L79 Accepts]: Start accepts. Automaton has 109 states and 309 transitions. Word has length 11 [2025-04-13 16:53:49,993 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:49,993 INFO L485 AbstractCegarLoop]: Abstraction has 109 states and 309 transitions. [2025-04-13 16:53:49,993 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:49,994 INFO L278 IsEmpty]: Start isEmpty. Operand 109 states and 309 transitions. [2025-04-13 16:53:49,994 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-04-13 16:53:49,994 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:49,994 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:49,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 16:53:49,994 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:49,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:49,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1170211856, now seen corresponding path program 1 times [2025-04-13 16:53:49,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:49,995 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538008992] [2025-04-13 16:53:49,995 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:49,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:50,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 16:53:50,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 16:53:50,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:50,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,086 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 16:53:50,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:50,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538008992] [2025-04-13 16:53:50,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538008992] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:50,087 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310840619] [2025-04-13 16:53:50,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:53:50,087 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:50,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:50,089 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 16:53:50,092 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 16:53:50,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-13 16:53:50,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-13 16:53:50,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:53:50,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-13 16:53:50,160 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:50,183 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 16:53:50,184 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:50,204 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 16:53:50,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310840619] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:50,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:50,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-13 16:53:50,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574921981] [2025-04-13 16:53:50,205 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:50,205 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-13 16:53:50,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:50,206 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-13 16:53:50,206 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:53:50,206 INFO L87 Difference]: Start difference. First operand 109 states and 309 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 16:53:50,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:50,280 INFO L93 Difference]: Finished difference Result 205 states and 629 transitions. [2025-04-13 16:53:50,280 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-13 16:53:50,280 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 12 [2025-04-13 16:53:50,280 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:50,282 INFO L225 Difference]: With dead ends: 205 [2025-04-13 16:53:50,282 INFO L226 Difference]: Without dead ends: 157 [2025-04-13 16:53:50,282 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-13 16:53:50,283 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 74 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:50,283 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 15 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:50,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-04-13 16:53:50,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-04-13 16:53:50,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 2.9038461538461537) internal successors, (453), 156 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 453 transitions. [2025-04-13 16:53:50,295 INFO L79 Accepts]: Start accepts. Automaton has 157 states and 453 transitions. Word has length 12 [2025-04-13 16:53:50,295 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:50,295 INFO L485 AbstractCegarLoop]: Abstraction has 157 states and 453 transitions. [2025-04-13 16:53:50,295 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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 16:53:50,295 INFO L278 IsEmpty]: Start isEmpty. Operand 157 states and 453 transitions. [2025-04-13 16:53:50,296 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-13 16:53:50,296 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:50,296 INFO L218 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:50,302 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 16:53:50,496 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:50,497 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:50,497 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:50,497 INFO L85 PathProgramCache]: Analyzing trace with hash 493351806, now seen corresponding path program 2 times [2025-04-13 16:53:50,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:50,497 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805753849] [2025-04-13 16:53:50,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:53:50,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:50,509 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 16:53:50,524 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:53:50,524 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:53:50,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:50,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:50,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805753849] [2025-04-13 16:53:50,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805753849] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:50,626 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543729116] [2025-04-13 16:53:50,626 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:53:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:50,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:50,628 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 16:53:50,629 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 16:53:50,668 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-04-13 16:53:50,685 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 16:53:50,685 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:53:50,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:50,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-13 16:53:50,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:50,725 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:50,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:50,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:50,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543729116] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:50,776 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:50,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-04-13 16:53:50,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445710061] [2025-04-13 16:53:50,776 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:50,776 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 16:53:50,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:50,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 16:53:50,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:53:50,777 INFO L87 Difference]: Start difference. First operand 157 states and 453 transitions. Second operand has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 16:53:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:50,897 INFO L93 Difference]: Finished difference Result 301 states and 965 transitions. [2025-04-13 16:53:50,897 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-13 16:53:50,898 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 15 [2025-04-13 16:53:50,898 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:50,900 INFO L225 Difference]: With dead ends: 301 [2025-04-13 16:53:50,900 INFO L226 Difference]: Without dead ends: 253 [2025-04-13 16:53:50,900 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-04-13 16:53:50,900 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 196 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:50,901 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 28 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:50,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-04-13 16:53:50,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-04-13 16:53:50,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 252 states have (on average 2.9404761904761907) internal successors, (741), 252 states have internal predecessors, (741), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:50,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 741 transitions. [2025-04-13 16:53:50,915 INFO L79 Accepts]: Start accepts. Automaton has 253 states and 741 transitions. Word has length 15 [2025-04-13 16:53:50,915 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:50,915 INFO L485 AbstractCegarLoop]: Abstraction has 253 states and 741 transitions. [2025-04-13 16:53:50,915 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.7692307692307692) internal successors, (23), 13 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 16:53:50,915 INFO L278 IsEmpty]: Start isEmpty. Operand 253 states and 741 transitions. [2025-04-13 16:53:50,916 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-04-13 16:53:50,916 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:50,916 INFO L218 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:50,922 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 16:53:51,117 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,SelfDestructingSolverStorable2 [2025-04-13 16:53:51,117 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:51,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:51,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1439646146, now seen corresponding path program 3 times [2025-04-13 16:53:51,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:51,117 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294211694] [2025-04-13 16:53:51,117 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:53:51,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:51,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 16:53:51,155 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 16:53:51,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:53:51,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:51,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:51,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294211694] [2025-04-13 16:53:51,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294211694] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:51,305 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106628464] [2025-04-13 16:53:51,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 16:53:51,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:51,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:51,307 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 16:53:51,309 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 16:53:51,346 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 6 equivalence classes. [2025-04-13 16:53:51,367 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 16:53:51,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-04-13 16:53:51,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:51,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 16:53:51,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:51,395 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:51,395 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:51,531 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:51,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106628464] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:51,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:51,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 19 [2025-04-13 16:53:51,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078924535] [2025-04-13 16:53:51,531 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:51,532 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 16:53:51,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:51,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 16:53:51,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-04-13 16:53:51,532 INFO L87 Difference]: Start difference. First operand 253 states and 741 transitions. Second operand has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:51,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:53:51,692 INFO L93 Difference]: Finished difference Result 397 states and 1253 transitions. [2025-04-13 16:53:51,693 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 16:53:51,693 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 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 16:53:51,693 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:53:51,695 INFO L225 Difference]: With dead ends: 397 [2025-04-13 16:53:51,695 INFO L226 Difference]: Without dead ends: 349 [2025-04-13 16:53:51,696 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 30 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2025-04-13 16:53:51,696 INFO L437 NwaCegarLoop]: 5 mSDtfsCounter, 244 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-13 16:53:51,698 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 44 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-13 16:53:51,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2025-04-13 16:53:51,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2025-04-13 16:53:51,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 2.956896551724138) internal successors, (1029), 348 states have internal predecessors, (1029), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:51,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 1029 transitions. [2025-04-13 16:53:51,726 INFO L79 Accepts]: Start accepts. Automaton has 349 states and 1029 transitions. Word has length 21 [2025-04-13 16:53:51,727 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:53:51,727 INFO L485 AbstractCegarLoop]: Abstraction has 349 states and 1029 transitions. [2025-04-13 16:53:51,727 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.5789473684210527) internal successors, (30), 19 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:53:51,727 INFO L278 IsEmpty]: Start isEmpty. Operand 349 states and 1029 transitions. [2025-04-13 16:53:51,729 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-04-13 16:53:51,730 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:53:51,730 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:53:51,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 16:53:51,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:51,930 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:53:51,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:53:51,931 INFO L85 PathProgramCache]: Analyzing trace with hash -664372994, now seen corresponding path program 4 times [2025-04-13 16:53:51,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:53:51,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013796017] [2025-04-13 16:53:51,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:53:51,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:53:51,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 16:53:51,952 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 16:53:51,952 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:53:51,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:52,954 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:53:52,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013796017] [2025-04-13 16:53:52,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013796017] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:53:52,955 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432894402] [2025-04-13 16:53:52,955 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 16:53:52,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:53:52,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:53:52,957 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 16:53:52,959 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 16:53:52,999 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-13 16:53:53,023 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 16:53:53,023 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 16:53:53,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:53:53,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-04-13 16:53:53,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:53:53,970 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 105 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:53,971 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:53:54,964 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:53:54,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432894402] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:53:54,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:53:54,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 63 [2025-04-13 16:53:54,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285361832] [2025-04-13 16:53:54,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:53:54,965 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-04-13 16:53:54,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:53:54,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-04-13 16:53:54,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=691, Invalid=3469, Unknown=0, NotChecked=0, Total=4160 [2025-04-13 16:53:54,967 INFO L87 Difference]: Start difference. First operand 349 states and 1029 transitions. Second operand has 65 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:55,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:54:55,353 INFO L93 Difference]: Finished difference Result 25209 states and 75775 transitions. [2025-04-13 16:54:55,353 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 562 states. [2025-04-13 16:54:55,354 INFO L79 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 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 27 [2025-04-13 16:54:55,354 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:54:55,472 INFO L225 Difference]: With dead ends: 25209 [2025-04-13 16:54:55,473 INFO L226 Difference]: Without dead ends: 22891 [2025-04-13 16:54:55,511 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 615 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 605 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173989 ImplicationChecksByTransitivity, 53.3s TimeCoverageRelationStatistics Valid=72271, Invalid=295571, Unknown=0, NotChecked=0, Total=367842 [2025-04-13 16:54:55,512 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 3775 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7992 mSolverCounterSat, 808 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3775 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 8800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 808 IncrementalHoareTripleChecker+Valid, 7992 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-04-13 16:54:55,512 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3775 Valid, 6 Invalid, 8800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [808 Valid, 7992 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-04-13 16:54:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22891 states. [2025-04-13 16:54:56,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22891 to 8881. [2025-04-13 16:54:56,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8881 states, 8880 states have (on average 3.0954954954954954) internal successors, (27488), 8880 states have internal predecessors, (27488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:56,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8881 states to 8881 states and 27488 transitions. [2025-04-13 16:54:56,897 INFO L79 Accepts]: Start accepts. Automaton has 8881 states and 27488 transitions. Word has length 27 [2025-04-13 16:54:56,898 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:54:56,898 INFO L485 AbstractCegarLoop]: Abstraction has 8881 states and 27488 transitions. [2025-04-13 16:54:56,898 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 1.265625) internal successors, (81), 64 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:54:56,898 INFO L278 IsEmpty]: Start isEmpty. Operand 8881 states and 27488 transitions. [2025-04-13 16:54:56,909 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 16:54:56,909 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:54:56,909 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:54:56,915 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-13 16:54:57,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:54:57,110 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:54:57,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:54:57,111 INFO L85 PathProgramCache]: Analyzing trace with hash 1484212888, now seen corresponding path program 1 times [2025-04-13 16:54:57,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:54:57,111 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135183643] [2025-04-13 16:54:57,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:57,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:54:57,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 16:54:57,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 16:54:57,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:57,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:58,054 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:58,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:54:58,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135183643] [2025-04-13 16:54:58,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135183643] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:54:58,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772611990] [2025-04-13 16:54:58,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:54:58,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:54:58,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:54:58,057 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 16:54:58,058 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 16:54:58,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 16:54:58,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 16:54:58,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:54:58,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:54:58,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 16:54:58,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:54:58,930 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 105 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:58,931 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:54:59,827 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:54:59,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772611990] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:54:59,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:54:59,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 68 [2025-04-13 16:54:59,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157931310] [2025-04-13 16:54:59,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:54:59,828 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2025-04-13 16:54:59,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:54:59,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2025-04-13 16:54:59,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=655, Invalid=4175, Unknown=0, NotChecked=0, Total=4830 [2025-04-13 16:54:59,829 INFO L87 Difference]: Start difference. First operand 8881 states and 27488 transitions. Second operand has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:55:31,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:55:31,520 INFO L93 Difference]: Finished difference Result 50787 states and 156693 transitions. [2025-04-13 16:55:31,520 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 271 states. [2025-04-13 16:55:31,521 INFO L79 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 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 31 [2025-04-13 16:55:31,521 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:55:31,738 INFO L225 Difference]: With dead ends: 50787 [2025-04-13 16:55:31,738 INFO L226 Difference]: Without dead ends: 50437 [2025-04-13 16:55:31,762 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44893 ImplicationChecksByTransitivity, 17.3s TimeCoverageRelationStatistics Valid=23403, Invalid=87153, Unknown=0, NotChecked=0, Total=110556 [2025-04-13 16:55:31,763 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 2556 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 6927 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2556 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 7540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 6927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-04-13 16:55:31,763 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [2556 Valid, 8 Invalid, 7540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 6927 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-04-13 16:55:31,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50437 states. [2025-04-13 16:55:39,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50437 to 34897. [2025-04-13 16:55:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34897 states, 34896 states have (on average 3.4025103163686383) internal successors, (118734), 34896 states have internal predecessors, (118734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:55:39,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34897 states to 34897 states and 118734 transitions. [2025-04-13 16:55:39,989 INFO L79 Accepts]: Start accepts. Automaton has 34897 states and 118734 transitions. Word has length 31 [2025-04-13 16:55:39,989 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:55:39,989 INFO L485 AbstractCegarLoop]: Abstraction has 34897 states and 118734 transitions. [2025-04-13 16:55:39,989 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 69 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:55:39,990 INFO L278 IsEmpty]: Start isEmpty. Operand 34897 states and 118734 transitions. [2025-04-13 16:55:40,026 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 16:55:40,027 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:55:40,027 INFO L218 NwaCegarLoop]: trace histogram [16, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:55:40,033 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-13 16:55:40,227 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:55:40,227 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:55:40,228 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:55:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1591509873, now seen corresponding path program 1 times [2025-04-13 16:55:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:55:40,228 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17649326] [2025-04-13 16:55:40,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:55:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:55:40,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 16:55:40,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 16:55:40,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:55:40,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:40,974 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:40,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:55:40,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17649326] [2025-04-13 16:55:40,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17649326] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:55:40,975 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1890348923] [2025-04-13 16:55:40,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 16:55:40,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:55:40,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:55:40,977 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 16:55:40,977 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 16:55:41,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-13 16:55:41,030 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 16:55:41,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 16:55:41,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:55:41,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 16:55:41,039 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:55:41,669 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 105 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:41,669 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:55:42,449 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:55:42,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1890348923] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:55:42,450 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:55:42,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2025-04-13 16:55:42,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384600813] [2025-04-13 16:55:42,450 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:55:42,450 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-04-13 16:55:42,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:55:42,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-04-13 16:55:42,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=4310, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 16:55:42,451 INFO L87 Difference]: Start difference. First operand 34897 states and 118734 transitions. Second operand has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:57:22,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 16:57:22,336 INFO L93 Difference]: Finished difference Result 152096 states and 524827 transitions. [2025-04-13 16:57:22,339 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 410 states. [2025-04-13 16:57:22,340 INFO L79 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 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 31 [2025-04-13 16:57:22,340 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 16:57:22,985 INFO L225 Difference]: With dead ends: 152096 [2025-04-13 16:57:22,985 INFO L226 Difference]: Without dead ends: 151095 [2025-04-13 16:57:23,056 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 485 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 471 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97344 ImplicationChecksByTransitivity, 41.2s TimeCoverageRelationStatistics Valid=41774, Invalid=181482, Unknown=0, NotChecked=0, Total=223256 [2025-04-13 16:57:23,056 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 4158 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 7929 mSolverCounterSat, 956 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4158 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 8885 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 956 IncrementalHoareTripleChecker+Valid, 7929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2025-04-13 16:57:23,057 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4158 Valid, 4 Invalid, 8885 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [956 Valid, 7929 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2025-04-13 16:57:23,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151095 states. [2025-04-13 16:58:00,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151095 to 120054. [2025-04-13 16:58:00,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120054 states, 120053 states have (on average 3.618193631146244) internal successors, (434375), 120053 states have internal predecessors, (434375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:58:01,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120054 states to 120054 states and 434375 transitions. [2025-04-13 16:58:01,158 INFO L79 Accepts]: Start accepts. Automaton has 120054 states and 434375 transitions. Word has length 31 [2025-04-13 16:58:01,158 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 16:58:01,158 INFO L485 AbstractCegarLoop]: Abstraction has 120054 states and 434375 transitions. [2025-04-13 16:58:01,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 16:58:01,159 INFO L278 IsEmpty]: Start isEmpty. Operand 120054 states and 434375 transitions. [2025-04-13 16:58:01,224 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 16:58:01,224 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 16:58:01,224 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 16:58:01,230 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 16:58:01,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:58:01,426 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 16:58:01,426 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 16:58:01,426 INFO L85 PathProgramCache]: Analyzing trace with hash 1499925238, now seen corresponding path program 2 times [2025-04-13 16:58:01,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 16:58:01,426 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1368441476] [2025-04-13 16:58:01,426 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:58:01,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 16:58:01,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 16:58:01,438 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 16:58:01,438 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:58:01,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:58:02,029 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:58:02,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 16:58:02,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1368441476] [2025-04-13 16:58:02,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1368441476] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 16:58:02,029 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [279499503] [2025-04-13 16:58:02,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 16:58:02,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 16:58:02,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 16:58:02,032 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 16:58:02,033 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 16:58:02,064 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 31 statements into 2 equivalence classes. [2025-04-13 16:58:02,083 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 16:58:02,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 16:58:02,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 16:58:02,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 16:58:02,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 16:58:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:58:02,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 16:58:03,676 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 16:58:03,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [279499503] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 16:58:03,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 16:58:03,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2025-04-13 16:58:03,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709635887] [2025-04-13 16:58:03,676 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 16:58:03,677 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-04-13 16:58:03,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 16:58:03,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-04-13 16:58:03,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=671, Invalid=4299, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 16:58:03,678 INFO L87 Difference]: Start difference. First operand 120054 states and 434375 transitions. Second operand has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:02:49,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-13 17:02:49,238 INFO L93 Difference]: Finished difference Result 604448 states and 2285949 transitions. [2025-04-13 17:02:49,238 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 381 states. [2025-04-13 17:02:49,239 INFO L79 Accepts]: Start accepts. Automaton has has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 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 31 [2025-04-13 17:02:49,239 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-13 17:02:54,160 INFO L225 Difference]: With dead ends: 604448 [2025-04-13 17:02:54,160 INFO L226 Difference]: Without dead ends: 603322 [2025-04-13 17:02:54,476 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 442 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82501 ImplicationChecksByTransitivity, 28.2s TimeCoverageRelationStatistics Valid=39533, Invalid=157159, Unknown=0, NotChecked=0, Total=196692 [2025-04-13 17:02:54,477 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 3059 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 7884 mSolverCounterSat, 623 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3059 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 8507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 623 IncrementalHoareTripleChecker+Valid, 7884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-04-13 17:02:54,477 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3059 Valid, 6 Invalid, 8507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [623 Valid, 7884 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-04-13 17:02:55,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603322 states. [2025-04-13 17:06:13,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603322 to 558143. [2025-04-13 17:06:15,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558143 states, 558142 states have (on average 3.8593422462384126) internal successors, (2154061), 558142 states have internal predecessors, (2154061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:20,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558143 states to 558143 states and 2154061 transitions. [2025-04-13 17:06:21,884 INFO L79 Accepts]: Start accepts. Automaton has 558143 states and 2154061 transitions. Word has length 31 [2025-04-13 17:06:21,894 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-13 17:06:21,895 INFO L485 AbstractCegarLoop]: Abstraction has 558143 states and 2154061 transitions. [2025-04-13 17:06:21,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-13 17:06:21,896 INFO L278 IsEmpty]: Start isEmpty. Operand 558143 states and 2154061 transitions. [2025-04-13 17:06:22,391 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-04-13 17:06:22,391 INFO L210 NwaCegarLoop]: Found error trace [2025-04-13 17:06:22,391 INFO L218 NwaCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 17:06:22,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:22,593 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:22,597 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-13 17:06:22,598 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 17:06:22,599 INFO L85 PathProgramCache]: Analyzing trace with hash -1561538038, now seen corresponding path program 3 times [2025-04-13 17:06:22,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 17:06:22,599 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828988135] [2025-04-13 17:06:22,599 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:22,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 17:06:22,641 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 9 equivalence classes. [2025-04-13 17:06:22,832 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 17:06:22,832 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-13 17:06:22,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:24,589 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:24,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 17:06:24,589 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828988135] [2025-04-13 17:06:24,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828988135] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 17:06:24,590 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617418685] [2025-04-13 17:06:24,590 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 17:06:24,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 17:06:24,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 17:06:24,598 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 17:06:24,600 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 17:06:24,672 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 9 equivalence classes. [2025-04-13 17:06:24,719 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 31 of 31 statements. [2025-04-13 17:06:24,720 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-04-13 17:06:24,720 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 17:06:24,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-04-13 17:06:24,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 17:06:26,155 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 105 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:26,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 17:06:27,680 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 17:06:27,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617418685] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 17:06:27,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 17:06:27,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 69 [2025-04-13 17:06:27,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11610580] [2025-04-13 17:06:27,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 17:06:27,681 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2025-04-13 17:06:27,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 17:06:27,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2025-04-13 17:06:27,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=4312, Unknown=0, NotChecked=0, Total=4970 [2025-04-13 17:06:27,690 INFO L87 Difference]: Start difference. First operand 558143 states and 2154061 transitions. Second operand has 71 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 70 states have internal predecessors, (93), 0 states have call successors, (0), 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 17:06:29,596 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 17:06:29,597 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-13 17:06:29,607 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-04-13 17:06:29,607 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1909 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1008, Invalid=6132, Unknown=0, NotChecked=0, Total=7140 [2025-04-13 17:06:29,608 INFO L437 NwaCegarLoop]: 2 mSDtfsCounter, 355 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1062 mSolverCounterSat, 139 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 1201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 139 IncrementalHoareTripleChecker+Valid, 1062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-13 17:06:29,608 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 8 Invalid, 1201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [139 Valid, 1062 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-13 17:06:29,610 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-13 17:06:29,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-13 17:06:29,821 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,SelfDestructingSolverStorable8 [2025-04-13 17:06:29,822 WARN L610 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (558143states) and FLOYD_HOARE automaton (currently 18 states, 71 states before enhancement),while ReachableStatesComputation was computing reachable states (96 states constructed, input type IntersectNwa). [2025-04-13 17:06:29,824 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-13 17:06:29,829 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-13 17:06:29,837 INFO L422 BasicCegarLoop]: Path program histogram: [4, 3, 1, 1] [2025-04-13 17:06:29,852 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-13 17:06:29,853 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-13 17:06:29,865 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:06:29 BasicIcfg [2025-04-13 17:06:29,865 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-13 17:06:29,866 INFO L158 Benchmark]: Toolchain (without parser) took 761087.03ms. Allocated memory was 125.8MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 85.6MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.1GB. Max. memory is 8.0GB. [2025-04-13 17:06:29,866 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:29,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 63.7MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-13 17:06:29,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.22ms. Allocated memory is still 125.8MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:29,866 INFO L158 Benchmark]: Boogie Preprocessor took 32.69ms. Allocated memory is still 125.8MB. Free memory was 61.1MB in the beginning and 59.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-13 17:06:29,867 INFO L158 Benchmark]: RCFGBuilder took 353.36ms. Allocated memory is still 125.8MB. Free memory was 59.5MB in the beginning and 34.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-13 17:06:29,867 INFO L158 Benchmark]: TraceAbstraction took 760328.54ms. Allocated memory was 125.8MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 33.4MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.0GB. Max. memory is 8.0GB. [2025-04-13 17:06:29,872 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.23ms. Allocated memory is still 159.4MB. Free memory is still 85.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 342.88ms. Allocated memory is still 125.8MB. Free memory was 85.6MB in the beginning and 63.7MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 25.22ms. Allocated memory is still 125.8MB. Free memory was 63.7MB in the beginning and 61.1MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.69ms. Allocated memory is still 125.8MB. Free memory was 61.1MB in the beginning and 59.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 353.36ms. Allocated memory is still 125.8MB. Free memory was 59.5MB in the beginning and 34.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 760328.54ms. Allocated memory was 125.8MB in the beginning and 7.5GB in the end (delta: 7.4GB). Free memory was 33.4MB in the beginning and 3.4GB in the end (delta: -3.3GB). Peak memory consumption was 4.0GB. 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: 681]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while NwaCegarLoop was constructing difference of abstraction (558143states) and FLOYD_HOARE automaton (currently 18 states, 71 states before enhancement),while ReachableStatesComputation was computing reachable states (96 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 720]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (558143states) and FLOYD_HOARE automaton (currently 18 states, 71 states before enhancement),while ReachableStatesComputation was computing reachable states (96 states constructed, input type IntersectNwa). - TimeoutResultAtElement [Line: 721]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while NwaCegarLoop was constructing difference of abstraction (558143states) and FLOYD_HOARE automaton (currently 18 states, 71 states before enhancement),while ReachableStatesComputation was computing reachable states (96 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 31 locations, 37 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 760.2s, OverallIterations: 9, TraceHistogramMax: 16, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.6s, AutomataDifference: 486.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14431 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14431 mSDsluCounter, 127 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 3153 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32100 IncrementalHoareTripleChecker+Invalid, 35253 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3153 mSolverCounterUnsat, 30 mSDtfsCounter, 32100 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2116 GetRequests, 144 SyntacticMatches, 6 SemanticMatches, 1966 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 400741 ImplicationChecksByTransitivity, 143.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=558143occurred in iteration=8, InterpolantAutomatonStates: 1663, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 253.8s AutomataMinimizationTime, 8 MinimizatonAttempts, 105770 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.3s InterpolantComputationTime, 409 NumberOfCodeBlocks, 409 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 583 ConstructedInterpolants, 0 QuantifiedInterpolants, 7368 SizeOfPredicates, 100 NumberOfNonLiveVariables, 1659 ConjunctsInSsa, 324 ConjunctsInUnsatCore, 25 InterpolantComputations, 1 PerfectInterpolantSequences, 525/2151 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