/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/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf -i ../../../trunk/examples/svcomp/pthread-theta/exponential-nondet.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 13:38:11,019 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 13:38:11,069 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-14 13:38:11,073 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 13:38:11,073 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 13:38:11,087 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 13:38:11,087 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 13:38:11,087 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 13:38:11,087 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 13:38:11,087 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 13:38:11,088 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 13:38:11,088 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 13:38:11,088 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 13:38:11,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:38:11,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:38:11,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 13:38:11,089 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 13:38:11,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 13:38:11,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 13:38:11,090 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 13:38:11,090 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 13:38:11,090 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 13:38:11,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 13:38:11,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 13:38:11,326 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 13:38:11,327 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 13:38:11,327 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 13:38:11,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-theta/exponential-nondet.i [2025-04-14 13:38:12,654 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31749ae74/5b9260d9293d4dc89abf1f9089bcf5c3/FLAG34bb14812 [2025-04-14 13:38:12,947 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 13:38:12,947 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-theta/exponential-nondet.i [2025-04-14 13:38:12,961 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31749ae74/5b9260d9293d4dc89abf1f9089bcf5c3/FLAG34bb14812 [2025-04-14 13:38:13,705 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31749ae74/5b9260d9293d4dc89abf1f9089bcf5c3 [2025-04-14 13:38:13,707 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 13:38:13,708 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 13:38:13,709 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 13:38:13,709 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 13:38:13,712 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 13:38:13,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:38:13" (1/1) ... [2025-04-14 13:38:13,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476f697d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:13, skipping insertion in model container [2025-04-14 13:38:13,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:38:13" (1/1) ... [2025-04-14 13:38:13,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 13:38:14,047 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-theta/exponential-nondet.i[33030,33043] [2025-04-14 13:38:14,072 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:38:14,084 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 13:38:14,132 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-theta/exponential-nondet.i[33030,33043] [2025-04-14 13:38:14,136 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 13:38:14,163 INFO L204 MainTranslator]: Completed translation [2025-04-14 13:38:14,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14 WrapperNode [2025-04-14 13:38:14,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 13:38:14,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 13:38:14,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 13:38:14,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 13:38:14,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,186 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,202 INFO L138 Inliner]: procedures = 169, calls = 10, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 58 [2025-04-14 13:38:14,203 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 13:38:14,203 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 13:38:14,203 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 13:38:14,203 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 13:38:14,207 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,207 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,212 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,212 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,215 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,216 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,221 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,222 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,222 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,228 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 13:38:14,229 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-14 13:38:14,229 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-14 13:38:14,229 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-14 13:38:14,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (1/1) ... [2025-04-14 13:38:14,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 13:38:14,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:14,264 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-14 13:38:14,267 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-14 13:38:14,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 13:38:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure f1 [2025-04-14 13:38:14,285 INFO L138 BoogieDeclarations]: Found implementation of procedure f1 [2025-04-14 13:38:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure f2 [2025-04-14 13:38:14,285 INFO L138 BoogieDeclarations]: Found implementation of procedure f2 [2025-04-14 13:38:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 13:38:14,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 13:38:14,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 13:38:14,286 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 13:38:14,380 INFO L234 CfgBuilder]: Building ICFG [2025-04-14 13:38:14,381 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 13:38:14,494 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 13:38:14,494 INFO L283 CfgBuilder]: Performing block encoding [2025-04-14 13:38:14,585 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 13:38:14,585 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 13:38:14,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:38:14 BoogieIcfgContainer [2025-04-14 13:38:14,585 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-14 13:38:14,590 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 13:38:14,590 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 13:38:14,593 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 13:38:14,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:38:13" (1/3) ... [2025-04-14 13:38:14,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c08c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:38:14, skipping insertion in model container [2025-04-14 13:38:14,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:38:14" (2/3) ... [2025-04-14 13:38:14,594 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66c08c35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:38:14, skipping insertion in model container [2025-04-14 13:38:14,594 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 01:38:14" (3/3) ... [2025-04-14 13:38:14,595 INFO L128 eAbstractionObserver]: Analyzing ICFG exponential-nondet.i [2025-04-14 13:38:14,604 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 13:38:14,606 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG exponential-nondet.i that has 3 procedures, 20 locations, 20 edges, 1 initial locations, 2 loop locations, and 1 error locations. [2025-04-14 13:38:14,606 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 13:38:14,635 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:38:14,667 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:14,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 13:38:14,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:14,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-14 13:38:14,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-14 13:38:14,733 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:38:14,746 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:38:14,753 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=PARTIAL_ORDER_FA, 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;@57ede6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:14,753 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:38:14,767 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-14 13:38:14,767 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:14,767 INFO L139 ounterexampleChecker]: Examining path program with hash 360556677, occurence #1 [2025-04-14 13:38:14,767 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:14,767 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:14,770 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:14,771 INFO L85 PathProgramCache]: Analyzing trace with hash 192583799, now seen corresponding path program 1 times [2025-04-14 13:38:14,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:14,777 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542936427] [2025-04-14 13:38:14,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:14,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:14,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:14,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:14,862 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:14,862 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:14,866 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827444299] [2025-04-14 13:38:14,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:14,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:14,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:14,869 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-14 13:38:14,871 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-14 13:38:14,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:14,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:14,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:14,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:14,924 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 13:38:14,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:14,976 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-14 13:38:14,976 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:38:14,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:14,976 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542936427] [2025-04-14 13:38:14,977 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:14,978 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827444299] [2025-04-14 13:38:14,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827444299] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:14,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:14,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:38:14,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476435378] [2025-04-14 13:38:14,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:14,985 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:14,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:14,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:15,000 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:38:15,000 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:15,001 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:15,002 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:15,002 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:15,196 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:15,203 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-14 13:38:15,401 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,SelfDestructingSolverStorable0 [2025-04-14 13:38:15,401 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-14 13:38:15,401 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:15,401 INFO L139 ounterexampleChecker]: Examining path program with hash 172926364, occurence #1 [2025-04-14 13:38:15,401 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:15,401 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:15,402 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:15,402 INFO L85 PathProgramCache]: Analyzing trace with hash -419454214, now seen corresponding path program 1 times [2025-04-14 13:38:15,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:15,402 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331065395] [2025-04-14 13:38:15,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:15,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:15,412 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:38:15,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:38:15,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:15,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:15,598 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-14 13:38:15,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:15,598 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331065395] [2025-04-14 13:38:15,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331065395] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:15,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:15,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:38:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688820156] [2025-04-14 13:38:15,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:15,599 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:38:15,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:15,599 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:38:15,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:38:15,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:15,600 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:15,600 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:15,600 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:15,600 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:15,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:15,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:15,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 13:38:15,638 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-14 13:38:15,638 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:15,638 INFO L139 ounterexampleChecker]: Examining path program with hash 172926364, occurence #2 [2025-04-14 13:38:15,639 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:38:15,639 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:38:15,639 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:15,639 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 13:38:15,639 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:15,640 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:38:15,640 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:15,640 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 13:38:15,640 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:15,640 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 13:38:15,640 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:15,640 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 13:38:15,640 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:15,640 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:38:15,640 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:15,640 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:15,640 INFO L85 PathProgramCache]: Analyzing trace with hash -118204922, now seen corresponding path program 1 times [2025-04-14 13:38:15,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:15,640 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073380032] [2025-04-14 13:38:15,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:15,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:15,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:15,676 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:15,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:15,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:15,681 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1096004295] [2025-04-14 13:38:15,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:15,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:15,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:15,684 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-14 13:38:15,686 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-14 13:38:15,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:15,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:15,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:15,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:15,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:38:15,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:15,833 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-14 13:38:15,833 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:38:15,900 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:38:15,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:15,900 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073380032] [2025-04-14 13:38:15,901 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:15,901 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1096004295] [2025-04-14 13:38:15,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1096004295] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 13:38:15,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:38:15,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-14 13:38:15,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410083322] [2025-04-14 13:38:15,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:15,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:15,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:15,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:15,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:38:15,902 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:15,902 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:15,902 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-14 13:38:15,902 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:15,902 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:15,902 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:15,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:15,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:15,950 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:15,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 13:38:16,152 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:16,152 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:38:16,152 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:16,152 INFO L139 ounterexampleChecker]: Examining path program with hash 599064450, occurence #1 [2025-04-14 13:38:16,152 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:16,152 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:16,153 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1153507773, now seen corresponding path program 1 times [2025-04-14 13:38:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:16,153 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104872877] [2025-04-14 13:38:16,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:16,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 13:38:16,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 13:38:16,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:16,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:16,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:38:16,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 13:38:16,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 13:38:16,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:16,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:16,207 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:38:16,207 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:38:16,208 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 13:38:16,209 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 13:38:16,209 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:38:16,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 13:38:16,213 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 13:38:16,214 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:38:16,214 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 13:38:16,229 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:38:16,233 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:16,239 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:38:16,239 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:38:16,240 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=PARTIAL_ORDER_FA, 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;@57ede6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:16,240 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:38:16,241 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-14 13:38:16,243 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:16,243 INFO L139 ounterexampleChecker]: Examining path program with hash 924450608, occurence #1 [2025-04-14 13:38:16,243 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:16,243 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:16,244 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:16,244 INFO L85 PathProgramCache]: Analyzing trace with hash 234573219, now seen corresponding path program 1 times [2025-04-14 13:38:16,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:16,244 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506317405] [2025-04-14 13:38:16,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:16,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:16,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:16,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:16,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:16,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:16,256 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [531532828] [2025-04-14 13:38:16,256 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:16,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:16,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:16,260 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-14 13:38:16,261 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-14 13:38:16,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:16,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:16,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:16,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:16,306 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 13:38:16,306 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:16,321 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-14 13:38:16,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:38:16,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:16,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506317405] [2025-04-14 13:38:16,321 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:16,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [531532828] [2025-04-14 13:38:16,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [531532828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:16,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:16,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:38:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774492556] [2025-04-14 13:38:16,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:16,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:16,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:16,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:16,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:38:16,322 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:16,322 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:16,322 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:16,322 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:16,515 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:16,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-14 13:38:16,716 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-14 13:38:16,716 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-14 13:38:16,716 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:16,716 INFO L139 ounterexampleChecker]: Examining path program with hash -1976252611, occurence #1 [2025-04-14 13:38:16,716 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:16,717 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:16,717 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:16,717 INFO L85 PathProgramCache]: Analyzing trace with hash 312553110, now seen corresponding path program 1 times [2025-04-14 13:38:16,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:16,717 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900991854] [2025-04-14 13:38:16,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:16,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:16,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:38:16,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:38:16,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:16,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:16,793 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-14 13:38:16,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:16,793 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900991854] [2025-04-14 13:38:16,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900991854] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:16,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:16,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:38:16,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10599834] [2025-04-14 13:38:16,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:16,794 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:38:16,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:16,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:38:16,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:38:16,794 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:16,794 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:16,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:16,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:16,795 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:16,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:16,832 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:16,833 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 13:38:16,833 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-14 13:38:16,833 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:16,833 INFO L139 ounterexampleChecker]: Examining path program with hash -1976252611, occurence #2 [2025-04-14 13:38:16,833 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:38:16,833 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:38:16,833 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:16,833 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 13:38:16,833 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:16,833 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:38:16,833 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:16,833 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 13:38:16,833 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:16,833 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 13:38:16,833 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:16,833 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 13:38:16,833 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:16,833 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:38:16,834 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:16,834 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:16,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1099185686, now seen corresponding path program 1 times [2025-04-14 13:38:16,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:16,834 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694526855] [2025-04-14 13:38:16,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:16,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:16,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:16,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:16,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:16,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:16,860 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1694051811] [2025-04-14 13:38:16,860 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:16,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:16,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:16,863 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-14 13:38:16,864 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-14 13:38:16,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:16,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:16,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:16,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:16,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:38:16,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:16,967 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-14 13:38:16,967 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:38:17,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:38:17,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:17,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694526855] [2025-04-14 13:38:17,011 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:17,011 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1694051811] [2025-04-14 13:38:17,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1694051811] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 13:38:17,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:38:17,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-14 13:38:17,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755805968] [2025-04-14 13:38:17,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:17,011 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:17,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:17,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:17,012 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:38:17,012 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:17,012 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:17,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-14 13:38:17,012 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:17,012 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:17,012 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:17,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:17,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:17,156 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:17,162 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-14 13:38:17,359 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:17,359 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:38:17,359 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:17,359 INFO L139 ounterexampleChecker]: Examining path program with hash 690514773, occurence #1 [2025-04-14 13:38:17,359 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:17,359 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:17,360 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:17,360 INFO L85 PathProgramCache]: Analyzing trace with hash -899054957, now seen corresponding path program 1 times [2025-04-14 13:38:17,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:17,360 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526526557] [2025-04-14 13:38:17,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:17,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:17,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 13:38:17,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 13:38:17,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:17,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:17,398 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:38:17,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-14 13:38:17,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 13:38:17,438 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:17,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:17,446 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:38:17,446 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:38:17,446 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 13:38:17,446 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 13:38:17,446 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:38:17,446 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 13:38:17,447 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 13:38:17,447 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:38:17,447 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-14 13:38:17,461 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:38:17,463 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:17,471 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:38:17,473 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:38:17,473 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=PARTIAL_ORDER_FA, 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;@57ede6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:17,473 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:38:17,477 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-14 13:38:17,477 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:17,478 INFO L139 ounterexampleChecker]: Examining path program with hash -1720831514, occurence #1 [2025-04-14 13:38:17,478 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:17,478 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:17,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:17,478 INFO L85 PathProgramCache]: Analyzing trace with hash 305191789, now seen corresponding path program 1 times [2025-04-14 13:38:17,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:17,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926859651] [2025-04-14 13:38:17,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:17,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:17,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:17,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:17,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:17,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:17,486 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1662071151] [2025-04-14 13:38:17,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:17,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:17,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:17,488 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-14 13:38:17,490 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-14 13:38:17,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:17,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:17,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:17,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:17,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 13:38:17,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:17,545 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-14 13:38:17,546 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:38:17,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:17,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926859651] [2025-04-14 13:38:17,546 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:17,546 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662071151] [2025-04-14 13:38:17,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662071151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:17,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:17,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:38:17,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597956845] [2025-04-14 13:38:17,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:17,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:17,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:17,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:17,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:38:17,547 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:17,547 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:17,547 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:17,547 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:17,753 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:17,760 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-14 13:38:17,954 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:17,954 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-14 13:38:17,954 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:17,954 INFO L139 ounterexampleChecker]: Examining path program with hash 1386484452, occurence #1 [2025-04-14 13:38:17,954 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:17,954 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:17,955 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:17,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1392930251, now seen corresponding path program 1 times [2025-04-14 13:38:17,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:17,955 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936340742] [2025-04-14 13:38:17,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:17,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:17,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:38:17,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:38:17,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:17,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:18,028 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-14 13:38:18,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:18,028 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936340742] [2025-04-14 13:38:18,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936340742] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:18,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:18,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:38:18,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492885490] [2025-04-14 13:38:18,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:18,029 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:38:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:18,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:38:18,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:38:18,029 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:18,029 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:18,030 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:18,030 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:18,030 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:18,056 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:18,057 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:18,057 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 13:38:18,057 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-14 13:38:18,057 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:18,057 INFO L139 ounterexampleChecker]: Examining path program with hash 1386484452, occurence #2 [2025-04-14 13:38:18,057 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:38:18,057 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:38:18,057 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:18,057 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 13:38:18,057 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:18,057 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:38:18,058 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:18,058 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 13:38:18,058 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:18,058 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 13:38:18,058 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:18,058 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 13:38:18,058 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:18,058 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:38:18,058 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:18,058 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:18,058 INFO L85 PathProgramCache]: Analyzing trace with hash -231190879, now seen corresponding path program 1 times [2025-04-14 13:38:18,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:18,058 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925870267] [2025-04-14 13:38:18,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:18,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:18,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:18,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:18,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:18,069 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1563503060] [2025-04-14 13:38:18,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:18,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:18,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:18,071 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-14 13:38:18,072 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-14 13:38:18,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:18,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:18,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:18,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:18,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:38:18,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:18,167 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-14 13:38:18,167 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:38:18,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:38:18,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:18,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925870267] [2025-04-14 13:38:18,206 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:18,206 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1563503060] [2025-04-14 13:38:18,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1563503060] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 13:38:18,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:38:18,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-14 13:38:18,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128242163] [2025-04-14 13:38:18,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:18,207 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:18,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:18,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:18,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:38:18,207 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:18,207 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:18,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-14 13:38:18,207 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:18,207 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:18,207 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:18,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:18,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:18,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:18,429 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-14 13:38:18,623 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:18,623 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:38:18,623 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:18,624 INFO L139 ounterexampleChecker]: Examining path program with hash -655465693, occurence #1 [2025-04-14 13:38:18,624 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:18,624 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:18,624 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:18,624 INFO L85 PathProgramCache]: Analyzing trace with hash -1568264075, now seen corresponding path program 1 times [2025-04-14 13:38:18,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:18,624 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569821192] [2025-04-14 13:38:18,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:18,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:18,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 13:38:18,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 13:38:18,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:18,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:18,735 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:38:18,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-14 13:38:18,840 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 13:38:18,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:18,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:18,848 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:38:18,848 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:38:18,848 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 13:38:18,848 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 13:38:18,848 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:38:18,848 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 13:38:18,850 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 13:38:18,850 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:38:18,850 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-14 13:38:18,873 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:38:18,876 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:18,886 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:38:18,886 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:38:18,887 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=PARTIAL_ORDER_FA, 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;@57ede6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:18,887 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:38:18,888 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-14 13:38:18,888 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:18,888 INFO L139 ounterexampleChecker]: Examining path program with hash -1309313715, occurence #1 [2025-04-14 13:38:18,888 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:18,888 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:18,888 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:18,888 INFO L85 PathProgramCache]: Analyzing trace with hash 412073949, now seen corresponding path program 1 times [2025-04-14 13:38:18,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:18,888 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116751112] [2025-04-14 13:38:18,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:18,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:18,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:18,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:18,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:18,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1713924564] [2025-04-14 13:38:18,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:18,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:18,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:18,898 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-14 13:38:18,900 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-14 13:38:18,941 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:18,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:18,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:18,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:18,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 13:38:18,946 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:18,955 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-14 13:38:18,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:38:18,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:18,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116751112] [2025-04-14 13:38:18,956 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:18,956 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1713924564] [2025-04-14 13:38:18,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1713924564] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:18,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:18,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:38:18,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539975967] [2025-04-14 13:38:18,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:18,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:18,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:18,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:18,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:38:18,956 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:18,956 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:18,956 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:18,957 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:19,150 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:19,159 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-14 13:38:19,350 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,SelfDestructingSolverStorable12 [2025-04-14 13:38:19,351 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-14 13:38:19,351 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:19,351 INFO L139 ounterexampleChecker]: Examining path program with hash 1631299053, occurence #1 [2025-04-14 13:38:19,351 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:19,351 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:19,351 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:19,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1781083781, now seen corresponding path program 1 times [2025-04-14 13:38:19,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:19,351 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749725629] [2025-04-14 13:38:19,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:19,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:19,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:38:19,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:38:19,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:19,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:19,404 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-14 13:38:19,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:19,405 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749725629] [2025-04-14 13:38:19,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749725629] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:19,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:19,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:38:19,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101655510] [2025-04-14 13:38:19,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:19,405 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:38:19,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:19,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:38:19,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:38:19,406 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:19,406 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:19,406 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:19,406 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:19,406 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:19,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:19,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:19,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-14 13:38:19,433 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-14 13:38:19,433 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:19,434 INFO L139 ounterexampleChecker]: Examining path program with hash 1631299053, occurence #2 [2025-04-14 13:38:19,434 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:38:19,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:38:19,434 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:19,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 13:38:19,434 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:19,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:38:19,434 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:19,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 13:38:19,434 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:19,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 13:38:19,434 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:19,434 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 13:38:19,434 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:19,434 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:38:19,434 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:19,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:19,434 INFO L85 PathProgramCache]: Analyzing trace with hash -621003583, now seen corresponding path program 1 times [2025-04-14 13:38:19,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:19,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897655642] [2025-04-14 13:38:19,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:19,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:19,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:19,443 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:19,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:19,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:19,444 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1061865555] [2025-04-14 13:38:19,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:19,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:19,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:19,446 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:38:19,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 13:38:19,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:19,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:19,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:19,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:19,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:38:19,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:19,548 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-14 13:38:19,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:38:19,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:38:19,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:19,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897655642] [2025-04-14 13:38:19,578 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:19,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1061865555] [2025-04-14 13:38:19,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1061865555] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 13:38:19,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:38:19,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-14 13:38:19,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084049398] [2025-04-14 13:38:19,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:19,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:19,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:19,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:19,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:38:19,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:19,579 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:19,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-14 13:38:19,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:19,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:19,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:19,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:19,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:19,882 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:19,888 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 13:38:20,087 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-14 13:38:20,087 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:38:20,087 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:20,087 INFO L139 ounterexampleChecker]: Examining path program with hash -1405303493, occurence #1 [2025-04-14 13:38:20,087 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:20,087 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:20,088 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:20,088 INFO L85 PathProgramCache]: Analyzing trace with hash -596753439, now seen corresponding path program 1 times [2025-04-14 13:38:20,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:20,088 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386984017] [2025-04-14 13:38:20,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:20,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:20,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 13:38:22,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 13:38:22,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:22,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:22,643 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:38:22,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-14 13:38:24,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-14 13:38:24,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:24,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:38:24,948 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:38:24,948 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:38:24,948 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 13:38:24,949 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 13:38:24,949 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:38:24,949 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-14 13:38:24,950 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 13:38:24,950 WARN L247 ceAbstractionStarter]: 4 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:38:24,950 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 5 thread instances. [2025-04-14 13:38:24,965 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:38:24,966 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:24,979 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:38:24,979 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:38:24,980 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=PARTIAL_ORDER_FA, 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;@57ede6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:38:24,980 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:38:24,980 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-14 13:38:24,981 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:24,981 INFO L139 ounterexampleChecker]: Examining path program with hash -481446239, occurence #1 [2025-04-14 13:38:24,981 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:24,981 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:24,981 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:24,981 INFO L85 PathProgramCache]: Analyzing trace with hash 562854139, now seen corresponding path program 1 times [2025-04-14 13:38:24,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:24,981 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487252781] [2025-04-14 13:38:24,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:24,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:24,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:24,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:24,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:24,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:24,987 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247808658] [2025-04-14 13:38:24,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:24,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:24,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:24,988 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:38:24,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 13:38:25,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:38:25,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:38:25,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:25,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:25,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 13:38:25,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:25,052 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-14 13:38:25,052 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:38:25,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:25,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487252781] [2025-04-14 13:38:25,053 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:25,053 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247808658] [2025-04-14 13:38:25,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247808658] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:25,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:25,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:38:25,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420786464] [2025-04-14 13:38:25,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:25,053 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:25,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:25,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:25,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:38:25,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:25,054 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:25,054 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:25,054 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:25,251 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:25,256 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-14 13:38:25,451 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 13:38:25,451 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-14 13:38:25,452 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:25,452 INFO L139 ounterexampleChecker]: Examining path program with hash -391054865, occurence #1 [2025-04-14 13:38:25,452 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:25,452 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:25,452 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:25,452 INFO L85 PathProgramCache]: Analyzing trace with hash 537831908, now seen corresponding path program 1 times [2025-04-14 13:38:25,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:25,452 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626643369] [2025-04-14 13:38:25,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:25,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:25,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:38:25,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:38:25,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:25,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:25,506 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-14 13:38:25,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:25,506 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626643369] [2025-04-14 13:38:25,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626643369] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:38:25,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:38:25,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:38:25,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217748776] [2025-04-14 13:38:25,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:25,507 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:38:25,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:25,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:38:25,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:38:25,507 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:25,507 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:25,507 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:38:25,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:25,507 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:25,528 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:25,529 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:25,529 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-14 13:38:25,529 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-14 13:38:25,529 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:25,529 INFO L139 ounterexampleChecker]: Examining path program with hash -391054865, occurence #2 [2025-04-14 13:38:25,529 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:38:25,529 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:38:25,529 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:25,529 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 13:38:25,529 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:25,529 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:38:25,529 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:38:25,529 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 13:38:25,530 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:25,530 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 13:38:25,530 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:25,530 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 13:38:25,530 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:38:25,530 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:38:25,530 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:25,530 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:25,530 INFO L85 PathProgramCache]: Analyzing trace with hash -507105824, now seen corresponding path program 1 times [2025-04-14 13:38:25,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:25,530 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446402152] [2025-04-14 13:38:25,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:25,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:25,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:25,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:25,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:25,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:38:25,538 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1018173434] [2025-04-14 13:38:25,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:25,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:25,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:38:25,540 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:38:25,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 13:38:25,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:38:25,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:38:25,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:38:25,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:38:25,595 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:38:25,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:38:25,641 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-14 13:38:25,641 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:38:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:38:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:38:25,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446402152] [2025-04-14 13:38:25,668 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:38:25,668 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018173434] [2025-04-14 13:38:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018173434] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 13:38:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:38:25,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-14 13:38:25,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911832167] [2025-04-14 13:38:25,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:38:25,668 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:38:25,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:38:25,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:38:25,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:38:25,669 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:25,669 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:38:25,669 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-14 13:38:25,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:25,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:25,669 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:38:26,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:26,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:38:26,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:38:26,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-04-14 13:38:26,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:38:26,260 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:38:26,260 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:38:26,260 INFO L139 ounterexampleChecker]: Examining path program with hash -314687305, occurence #1 [2025-04-14 13:38:26,260 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:38:26,260 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:38:26,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:38:26,260 INFO L85 PathProgramCache]: Analyzing trace with hash 132820329, now seen corresponding path program 1 times [2025-04-14 13:38:26,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:38:26,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129531942] [2025-04-14 13:38:26,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:38:26,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:38:26,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-14 13:40:02,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-14 13:40:02,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:02,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:02,044 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:40:02,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-14 13:40:48,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-14 13:40:48,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:40:48,056 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:40:48,056 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:40:48,056 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 13:40:48,056 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 13:40:48,056 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:40:48,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-14 13:40:48,057 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 13:40:48,057 WARN L247 ceAbstractionStarter]: 5 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:40:48,057 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 6 thread instances. [2025-04-14 13:40:48,073 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:40:48,074 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,087 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:40:48,087 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:40:48,088 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=PARTIAL_ORDER_FA, 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;@57ede6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:40:48,088 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:40:48,089 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-14 13:40:48,089 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,089 INFO L139 ounterexampleChecker]: Examining path program with hash 248923938, occurence #1 [2025-04-14 13:40:48,089 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:48,089 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,089 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash 765166799, now seen corresponding path program 1 times [2025-04-14 13:40:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,089 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481469706] [2025-04-14 13:40:48,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:40:48,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:40:48,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:40:48,094 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1904383934] [2025-04-14 13:40:48,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,094 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:48,094 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:48,096 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:48,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 13:40:48,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:40:48,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:40:48,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 13:40:48,157 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:48,167 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-14 13:40:48,168 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:40:48,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481469706] [2025-04-14 13:40:48,168 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:40:48,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904383934] [2025-04-14 13:40:48,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904383934] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:48,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:48,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:40:48,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589473439] [2025-04-14 13:40:48,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,168 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:40:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:40:48,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:40:48,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,169 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,169 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:40:48,169 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,393 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 13:40:48,594 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-14 13:40:48,594 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-14 13:40:48,594 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,594 INFO L139 ounterexampleChecker]: Examining path program with hash -1626383179, occurence #1 [2025-04-14 13:40:48,594 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:48,594 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,595 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1563906897, now seen corresponding path program 1 times [2025-04-14 13:40:48,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,595 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207005674] [2025-04-14 13:40:48,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:40:48,601 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:40:48,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,639 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-14 13:40:48,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,640 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207005674] [2025-04-14 13:40:48,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207005674] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:40:48,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:40:48,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:40:48,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801559074] [2025-04-14 13:40:48,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:40:48,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:40:48,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:40:48,641 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,641 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,641 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:40:48,641 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,641 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:48,672 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-14 13:40:48,672 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-14 13:40:48,672 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:48,672 INFO L139 ounterexampleChecker]: Examining path program with hash -1626383179, occurence #2 [2025-04-14 13:40:48,672 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:40:48,672 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:40:48,672 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:40:48,673 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 13:40:48,673 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:48,673 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:40:48,673 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:40:48,673 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 13:40:48,673 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:40:48,673 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 13:40:48,673 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:40:48,673 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 13:40:48,673 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:40:48,673 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:40:48,673 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:48,673 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:48,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1236499127, now seen corresponding path program 1 times [2025-04-14 13:40:48,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:48,673 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957103836] [2025-04-14 13:40:48,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:48,677 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:48,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:48,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:40:48,682 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1931249108] [2025-04-14 13:40:48,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:48,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:40:48,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:40:48,683 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:40:48,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-14 13:40:48,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:40:48,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:40:48,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:40:48,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:40:48,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:40:48,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:40:48,783 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-14 13:40:48,783 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:40:48,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:40:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:40:48,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957103836] [2025-04-14 13:40:48,806 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:40:48,806 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931249108] [2025-04-14 13:40:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931249108] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 13:40:48,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:40:48,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-14 13:40:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492624610] [2025-04-14 13:40:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:40:48,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:40:48,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:40:48,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:40:48,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:40:48,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:48,807 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:40:48,807 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-14 13:40:48,807 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:48,807 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:48,808 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:40:49,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:49,275 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:40:49,276 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:40:49,283 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-04-14 13:40:49,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-04-14 13:40:49,477 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:40:49,477 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:40:49,477 INFO L139 ounterexampleChecker]: Examining path program with hash 724354532, occurence #1 [2025-04-14 13:40:49,477 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:40:49,477 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:40:49,477 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:40:49,478 INFO L85 PathProgramCache]: Analyzing trace with hash -836927, now seen corresponding path program 1 times [2025-04-14 13:40:49,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:40:49,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865406754] [2025-04-14 13:40:49,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:40:49,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:40:49,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-14 13:43:38,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-14 13:43:38,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:43:38,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:43:38,836 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 13:43:38,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-04-14 13:47:56,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-04-14 13:47:56,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:47:56,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 13:47:56,745 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 13:47:56,745 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 13:47:56,745 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 13:47:56,745 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 13:47:56,745 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:47:56,745 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-14 13:47:56,746 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 13:47:56,746 WARN L247 ceAbstractionStarter]: 6 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 13:47:56,746 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 7 thread instances. [2025-04-14 13:47:56,764 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-14 13:47:56,765 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:47:56,784 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 13:47:56,785 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 13:47:56,785 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=PARTIAL_ORDER_FA, 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;@57ede6d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 13:47:56,785 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 13:47:56,786 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-14 13:47:56,786 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:47:56,786 INFO L139 ounterexampleChecker]: Examining path program with hash 1362425123, occurence #1 [2025-04-14 13:47:56,786 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:47:56,786 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:47:56,786 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:47:56,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1026646369, now seen corresponding path program 1 times [2025-04-14 13:47:56,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:47:56,786 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241247636] [2025-04-14 13:47:56,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:47:56,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:47:56,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:47:56,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:47:56,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:47:56,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:47:56,790 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1049447107] [2025-04-14 13:47:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:47:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:47:56,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:47:56,792 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:47:56,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-14 13:47:56,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 13:47:56,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 13:47:56,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:47:56,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:47:56,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-14 13:47:56,853 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:47:56,860 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-14 13:47:56,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 13:47:56,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:47:56,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241247636] [2025-04-14 13:47:56,860 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:47:56,860 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049447107] [2025-04-14 13:47:56,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049447107] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:47:56,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:47:56,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 13:47:56,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313919438] [2025-04-14 13:47:56,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:47:56,861 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:47:56,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:47:56,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:47:56,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 13:47:56,861 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:47:56,861 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:47:56,861 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:47:56,861 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:47:57,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:47:57,066 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-14 13:47:57,259 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:47:57,260 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-14 13:47:57,260 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:47:57,260 INFO L139 ounterexampleChecker]: Examining path program with hash -417864878, occurence #1 [2025-04-14 13:47:57,260 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:47:57,260 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:47:57,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:47:57,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1861517656, now seen corresponding path program 1 times [2025-04-14 13:47:57,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:47:57,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286835984] [2025-04-14 13:47:57,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:47:57,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:47:57,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 13:47:57,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 13:47:57,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:47:57,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:47:57,298 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-14 13:47:57,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:47:57,298 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286835984] [2025-04-14 13:47:57,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286835984] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 13:47:57,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 13:47:57,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 13:47:57,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449422268] [2025-04-14 13:47:57,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:47:57,299 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 13:47:57,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:47:57,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 13:47:57,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-14 13:47:57,299 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:47:57,299 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:47:57,299 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 13:47:57,299 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:47:57,299 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:47:57,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:47:57,324 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:47:57,324 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-14 13:47:57,324 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-14 13:47:57,324 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:47:57,324 INFO L139 ounterexampleChecker]: Examining path program with hash -417864878, occurence #2 [2025-04-14 13:47:57,324 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 13:47:57,324 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 0 [2025-04-14 13:47:57,324 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:47:57,324 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 2 [2025-04-14 13:47:57,324 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:47:57,324 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 13:47:57,324 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 13:47:57,324 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 13:47:57,324 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:47:57,325 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 12 [2025-04-14 13:47:57,325 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:47:57,325 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 14 [2025-04-14 13:47:57,325 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 13:47:57,325 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 13:47:57,325 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:47:57,325 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:47:57,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1872497790, now seen corresponding path program 1 times [2025-04-14 13:47:57,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:47:57,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821285653] [2025-04-14 13:47:57,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:47:57,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:47:57,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:47:57,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:47:57,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:47:57,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:47:57,331 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1414860127] [2025-04-14 13:47:57,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:47:57,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 13:47:57,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 13:47:57,333 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 13:47:57,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-14 13:47:57,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 13:47:57,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 13:47:57,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:47:57,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 13:47:57,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 13:47:57,401 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 13:47:57,435 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-14 13:47:57,435 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 13:47:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 13:47:57,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 13:47:57,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821285653] [2025-04-14 13:47:57,456 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 13:47:57,456 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414860127] [2025-04-14 13:47:57,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414860127] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 13:47:57,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 13:47:57,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-04-14 13:47:57,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699496540] [2025-04-14 13:47:57,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 13:47:57,457 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 13:47:57,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 13:47:57,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 13:47:57,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-04-14 13:47:57,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:47:57,457 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 13:47:57,457 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 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-14 13:47:57,457 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:47:57,457 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:47:57,457 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 13:47:57,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:47:57,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 13:47:57,965 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 13:47:57,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-14 13:47:58,166 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2025-04-14 13:47:58,166 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 13:47:58,166 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 13:47:58,166 INFO L139 ounterexampleChecker]: Examining path program with hash -2137635891, occurence #1 [2025-04-14 13:47:58,166 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 13:47:58,166 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 13:47:58,166 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 13:47:58,167 INFO L85 PathProgramCache]: Analyzing trace with hash 763599131, now seen corresponding path program 1 times [2025-04-14 13:47:58,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 13:47:58,167 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043097512] [2025-04-14 13:47:58,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 13:47:58,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 13:47:58,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. Received shutdown request... [2025-04-14 13:52:52,117 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-14 13:52:52,119 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 13:52:52,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-14 13:52:52,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 13:52:52,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 13:52:52,397 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 3 remaining) [2025-04-14 13:52:52,397 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-14 13:52:52,398 WARN L610 AbstractCegarLoop]: Verification canceled: while PartialOrderCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleSmtInterpolCraig [2043097512] and IpTcStrategyModuleZ3 [1270591983]. [2025-04-14 13:52:52,398 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2025-04-14 13:52:52,398 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 13:52:52,398 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 13:52:52,399 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 7 thread instances [2025-04-14 13:52:52,399 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 13:52:52,409 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 13:52:52,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:52:52 BasicIcfg [2025-04-14 13:52:52,409 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 13:52:52,410 INFO L158 Benchmark]: Toolchain (without parser) took 878701.81ms. Allocated memory was 167.8MB in the beginning and 788.5MB in the end (delta: 620.8MB). Free memory was 118.2MB in the beginning and 241.8MB in the end (delta: -123.6MB). Peak memory consumption was 552.1MB. Max. memory is 8.0GB. [2025-04-14 13:52:52,410 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:52:52,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 455.64ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 94.9MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 13:52:52,410 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.82ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 13:52:52,410 INFO L158 Benchmark]: Boogie Preprocessor took 25.30ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 91.9MB in the end (delta: 780.4kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 13:52:52,410 INFO L158 Benchmark]: RCFGBuilder took 356.40ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 71.0MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. [2025-04-14 13:52:52,411 INFO L158 Benchmark]: TraceAbstraction took 877819.13ms. Allocated memory was 167.8MB in the beginning and 788.5MB in the end (delta: 620.8MB). Free memory was 70.6MB in the beginning and 241.8MB in the end (delta: -171.2MB). Peak memory consumption was 506.0MB. Max. memory is 8.0GB. [2025-04-14 13:52:52,411 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 163.6MB. Free memory is still 90.8MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 455.64ms. Allocated memory is still 167.8MB. Free memory was 118.2MB in the beginning and 94.9MB in the end (delta: 23.2MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 37.82ms. Allocated memory is still 167.8MB. Free memory was 94.9MB in the beginning and 92.7MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.30ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 91.9MB in the end (delta: 780.4kB). There was no memory consumed. Max. memory is 8.0GB. * RCFGBuilder took 356.40ms. Allocated memory is still 167.8MB. Free memory was 91.5MB in the beginning and 71.0MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 8.0GB. * TraceAbstraction took 877819.13ms. Allocated memory was 167.8MB in the beginning and 788.5MB in the end (delta: 620.8MB). Free memory was 70.6MB in the beginning and 241.8MB in the end (delta: -171.2MB). Peak memory consumption was 506.0MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 154, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 21, dependent conditional: 18, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 136, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 110, unknown conditional: 0, unknown unconditional: 110] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0, Independence queries for same thread: 18, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 20, Number of trivial persistent sets: 20, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 116, independent: 113, independent conditional: 0, independent unconditional: 113, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 154, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 21, dependent conditional: 18, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 20, independent unconditional: 113, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 136, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 136, independent: 133, independent conditional: 0, independent unconditional: 133, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 110, independent: 107, independent conditional: 0, independent unconditional: 107, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 110, independent: 103, independent conditional: 0, independent unconditional: 103, dependent: 7, dependent conditional: 0, dependent unconditional: 7, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 7, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 3, dependent conditional: 0, dependent unconditional: 3, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 116, independent: 57, independent conditional: 0, independent unconditional: 57, dependent: 59, dependent conditional: 0, dependent unconditional: 59, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 136, independent: 26, independent conditional: 0, independent unconditional: 26, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 110, unknown conditional: 0, unknown unconditional: 110] , Statistics on independence cache: Total cache size (in pairs): 110, Positive cache size: 107, Positive conditional cache size: 0, Positive unconditional cache size: 107, Negative cache size: 3, Negative conditional cache size: 0, Negative unconditional cache size: 3, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 20, Maximal queried relation: 0, Independence queries for same thread: 18 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 360, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 28, dependent conditional: 20, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 340, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 293, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 293, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 340, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 293, unknown conditional: 0, unknown unconditional: 293] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 392, Positive conditional cache size: 0, Positive unconditional cache size: 392, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0, Independence queries for same thread: 20, Persistent sets #1 benchmarks: Persistent set computation time: 0.2s, Number of persistent set computation: 33, Number of trivial persistent sets: 33, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 314, independent: 306, independent conditional: 0, independent unconditional: 306, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 360, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 28, dependent conditional: 20, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 26, independent unconditional: 306, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 340, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 340, independent: 332, independent conditional: 0, independent unconditional: 332, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 293, independent: 285, independent conditional: 0, independent unconditional: 285, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 293, independent: 275, independent conditional: 0, independent unconditional: 275, dependent: 18, dependent conditional: 0, dependent unconditional: 18, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 18, independent: 10, independent conditional: 0, independent unconditional: 10, dependent: 8, dependent conditional: 0, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 193, independent: 110, independent conditional: 0, independent unconditional: 110, dependent: 83, dependent conditional: 0, dependent unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 340, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 293, unknown conditional: 0, unknown unconditional: 293] , Statistics on independence cache: Total cache size (in pairs): 403, Positive cache size: 392, Positive conditional cache size: 0, Positive unconditional cache size: 392, Negative cache size: 11, Negative conditional cache size: 0, Negative unconditional cache size: 11, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 26, Maximal queried relation: 0, Independence queries for same thread: 20 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 640, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 37, dependent conditional: 22, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 618, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 546, independent: 531, independent conditional: 0, independent unconditional: 531, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 546, independent: 513, independent conditional: 0, independent unconditional: 513, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 251, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 618, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 546, unknown conditional: 0, unknown unconditional: 546] , Statistics on independence cache: Total cache size (in pairs): 949, Positive cache size: 923, Positive conditional cache size: 0, Positive unconditional cache size: 923, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0, Independence queries for same thread: 22, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 46, Number of trivial persistent sets: 46, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 586, independent: 571, independent conditional: 0, independent unconditional: 571, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 640, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 37, dependent conditional: 22, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 32, independent unconditional: 571, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 618, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 618, independent: 603, independent conditional: 0, independent unconditional: 603, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 546, independent: 531, independent conditional: 0, independent unconditional: 531, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 546, independent: 513, independent conditional: 0, independent unconditional: 513, dependent: 33, dependent conditional: 0, dependent unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 33, independent: 18, independent conditional: 0, independent unconditional: 18, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 251, independent: 140, independent conditional: 0, independent unconditional: 140, dependent: 111, dependent conditional: 0, dependent unconditional: 111, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 618, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 546, unknown conditional: 0, unknown unconditional: 546] , Statistics on independence cache: Total cache size (in pairs): 949, Positive cache size: 923, Positive conditional cache size: 0, Positive unconditional cache size: 923, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 32, Maximal queried relation: 0, Independence queries for same thread: 22 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 994, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 48, dependent conditional: 24, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 970, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 869, independent: 845, independent conditional: 0, independent unconditional: 845, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 869, independent: 817, independent conditional: 0, independent unconditional: 817, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 293, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 970, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 869, unknown conditional: 0, unknown unconditional: 869] , Statistics on independence cache: Total cache size (in pairs): 1818, Positive cache size: 1768, Positive conditional cache size: 0, Positive unconditional cache size: 1768, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0, Independence queries for same thread: 24, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 59, Number of trivial persistent sets: 59, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 932, independent: 908, independent conditional: 0, independent unconditional: 908, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 994, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 48, dependent conditional: 24, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 38, independent unconditional: 908, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 970, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 970, independent: 946, independent conditional: 0, independent unconditional: 946, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 869, independent: 845, independent conditional: 0, independent unconditional: 845, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 869, independent: 817, independent conditional: 0, independent unconditional: 817, dependent: 52, dependent conditional: 0, dependent unconditional: 52, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 52, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 52, independent: 28, independent conditional: 0, independent unconditional: 28, dependent: 24, dependent conditional: 0, dependent unconditional: 24, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 293, independent: 154, independent conditional: 0, independent unconditional: 154, dependent: 140, dependent conditional: 0, dependent unconditional: 140, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 970, independent: 101, independent conditional: 0, independent unconditional: 101, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 869, unknown conditional: 0, unknown unconditional: 869] , Statistics on independence cache: Total cache size (in pairs): 1818, Positive cache size: 1768, Positive conditional cache size: 0, Positive unconditional cache size: 1768, Negative cache size: 50, Negative conditional cache size: 0, Negative unconditional cache size: 50, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 38, Maximal queried relation: 0, Independence queries for same thread: 24 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1422, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 61, dependent conditional: 26, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 0, independent unconditional: 1361, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 0, independent unconditional: 1361, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1262, independent: 1227, independent conditional: 0, independent unconditional: 1227, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1262, independent: 1187, independent conditional: 0, independent unconditional: 1187, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 365, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1396, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1262, unknown conditional: 0, unknown unconditional: 1262] , Statistics on independence cache: Total cache size (in pairs): 3080, Positive cache size: 2995, Positive conditional cache size: 0, Positive unconditional cache size: 2995, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0, Independence queries for same thread: 26, Persistent sets #1 benchmarks: Persistent set computation time: 0.4s, Number of persistent set computation: 72, Number of trivial persistent sets: 72, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1352, independent: 1317, independent conditional: 0, independent unconditional: 1317, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1422, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 61, dependent conditional: 26, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 44, independent unconditional: 1317, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 0, independent unconditional: 1361, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1396, independent: 1361, independent conditional: 0, independent unconditional: 1361, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1262, independent: 1227, independent conditional: 0, independent unconditional: 1227, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1262, independent: 1187, independent conditional: 0, independent unconditional: 1187, dependent: 75, dependent conditional: 0, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 75, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 75, independent: 40, independent conditional: 0, independent unconditional: 40, dependent: 35, dependent conditional: 0, dependent unconditional: 35, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 365, independent: 185, independent conditional: 0, independent unconditional: 185, dependent: 179, dependent conditional: 0, dependent unconditional: 179, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1396, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1262, unknown conditional: 0, unknown unconditional: 1262] , Statistics on independence cache: Total cache size (in pairs): 3080, Positive cache size: 2995, Positive conditional cache size: 0, Positive unconditional cache size: 2995, Negative cache size: 85, Negative conditional cache size: 0, Negative unconditional cache size: 85, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 44, Maximal queried relation: 0, Independence queries for same thread: 26 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1924, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 76, dependent conditional: 28, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 0, independent unconditional: 1848, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 0, independent unconditional: 1848, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1725, independent: 1677, independent conditional: 0, independent unconditional: 1677, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1725, independent: 1623, independent conditional: 0, independent unconditional: 1623, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 102, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 102, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 448, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1896, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1725, unknown conditional: 0, unknown unconditional: 1725] , Statistics on independence cache: Total cache size (in pairs): 4805, Positive cache size: 4672, Positive conditional cache size: 0, Positive unconditional cache size: 4672, Negative cache size: 133, Negative conditional cache size: 0, Negative unconditional cache size: 133, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0, Independence queries for same thread: 28, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 85, Number of trivial persistent sets: 85, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1846, independent: 1798, independent conditional: 0, independent unconditional: 1798, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 1924, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 76, dependent conditional: 28, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 50, independent unconditional: 1798, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 0, independent unconditional: 1848, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1896, independent: 1848, independent conditional: 0, independent unconditional: 1848, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1725, independent: 1677, independent conditional: 0, independent unconditional: 1677, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1725, independent: 1623, independent conditional: 0, independent unconditional: 1623, dependent: 102, dependent conditional: 0, dependent unconditional: 102, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 102, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 102, independent: 54, independent conditional: 0, independent unconditional: 54, dependent: 48, dependent conditional: 0, dependent unconditional: 48, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 448, independent: 232, independent conditional: 0, independent unconditional: 232, dependent: 217, dependent conditional: 0, dependent unconditional: 217, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1896, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 1725, unknown conditional: 0, unknown unconditional: 1725] , Statistics on independence cache: Total cache size (in pairs): 4805, Positive cache size: 4672, Positive conditional cache size: 0, Positive unconditional cache size: 4672, Negative cache size: 133, Negative conditional cache size: 0, Negative unconditional cache size: 133, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 50, Maximal queried relation: 0, Independence queries for same thread: 28 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2500, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 93, dependent conditional: 30, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 0, independent unconditional: 2407, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 0, independent unconditional: 2407, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2258, independent: 2195, independent conditional: 0, independent unconditional: 2195, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2258, independent: 2125, independent conditional: 0, independent unconditional: 2125, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 133, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 133, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 470, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2470, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2258, unknown conditional: 0, unknown unconditional: 2258] , Statistics on independence cache: Total cache size (in pairs): 7063, Positive cache size: 6867, Positive conditional cache size: 0, Positive unconditional cache size: 6867, Negative cache size: 196, Negative conditional cache size: 0, Negative unconditional cache size: 196, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0, Independence queries for same thread: 30, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 98, Number of trivial persistent sets: 98, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2414, independent: 2351, independent conditional: 0, independent unconditional: 2351, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 2500, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 93, dependent conditional: 30, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 56, independent unconditional: 2351, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 0, independent unconditional: 2407, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 2470, independent: 2407, independent conditional: 0, independent unconditional: 2407, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2258, independent: 2195, independent conditional: 0, independent unconditional: 2195, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2258, independent: 2125, independent conditional: 0, independent unconditional: 2125, dependent: 133, dependent conditional: 0, dependent unconditional: 133, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 133, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 133, independent: 70, independent conditional: 0, independent unconditional: 70, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 470, independent: 235, independent conditional: 0, independent unconditional: 235, dependent: 236, dependent conditional: 0, dependent unconditional: 236, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 2470, independent: 212, independent conditional: 0, independent unconditional: 212, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 2258, unknown conditional: 0, unknown unconditional: 2258] , Statistics on independence cache: Total cache size (in pairs): 7063, Positive cache size: 6867, Positive conditional cache size: 0, Positive unconditional cache size: 6867, Negative cache size: 196, Negative conditional cache size: 0, Negative unconditional cache size: 196, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 56, Maximal queried relation: 0, Independence queries for same thread: 30 - TimeoutResultAtElement [Line: 770]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleSmtInterpolCraig [2043097512] and IpTcStrategyModuleZ3 [1270591983]. - TimeoutResultAtElement [Line: 753]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while PartialOrderCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleSmtInterpolCraig [2043097512] and IpTcStrategyModuleZ3 [1270591983]. - TimeoutResultAtElement [Line: 771]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while PartialOrderCegarLoop was analyzing trace of length 81 with TraceHistMax 8,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleSmtInterpolCraig [2043097512] and IpTcStrategyModuleZ3 [1270591983]. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 30 locations, 30 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 2 thread instances CFG has 7 procedures, 38 locations, 38 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.4s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 3 thread instances CFG has 9 procedures, 46 locations, 46 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 96 NumberOfCodeBlocks, 96 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 4 thread instances CFG has 11 procedures, 54 locations, 54 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 107 NumberOfCodeBlocks, 107 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 5 thread instances CFG has 13 procedures, 62 locations, 62 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 143.1s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.6s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 95.8s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 6 thread instances CFG has 15 procedures, 70 locations, 70 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 428.7s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 169.4s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 7 thread instances CFG has 17 procedures, 78 locations, 78 edges, 3 error locations. Started 1 CEGAR loops. OverallTime: 295.6s, OverallIterations: 4, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 60 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 51 ConstructedInterpolants, 0 QuantifiedInterpolants, 189 SizeOfPredicates, 6 NumberOfNonLiveVariables, 131 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 1/2 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 4, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown