/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/gemcutter/svcomp-Reach-32bit-GemCutter_Default.epf --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 16:06:44,601 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 16:06:44,646 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 16:06:44,649 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 16:06:44,649 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 16:06:44,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 16:06:44,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 16:06:44,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 16:06:44,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 16:06:44,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 16:06:44,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 16:06:44,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 16:06:44,667 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 16:06:44,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 16:06:44,668 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:06:44,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:06:44,669 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:06:44,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 16:06:44,669 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 16:06:44,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 16:06:44,671 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 16:06:44,671 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 16:06:44,671 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 16:06:44,671 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 16:06:44,895 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 16:06:44,904 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 16:06:44,906 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 16:06:44,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 16:06:44,909 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 16:06:44,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-14 16:06:46,209 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609fc9a06/d27516be5784449290471ad401d40fa6/FLAGd01833129 [2025-04-14 16:06:46,397 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 16:06:46,397 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c [2025-04-14 16:06:46,411 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609fc9a06/d27516be5784449290471ad401d40fa6/FLAGd01833129 [2025-04-14 16:06:47,259 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/609fc9a06/d27516be5784449290471ad401d40fa6 [2025-04-14 16:06:47,261 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 16:06:47,262 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 16:06:47,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 16:06:47,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 16:06:47,270 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 16:06:47,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@596e5a03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47, skipping insertion in model container [2025-04-14 16:06:47,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,285 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 16:06:47,427 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-04-14 16:06:47,437 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:06:47,443 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 16:06:47,465 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-bad-counter-queue.wvr.c[2142,2155] [2025-04-14 16:06:47,474 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 16:06:47,483 INFO L204 MainTranslator]: Completed translation [2025-04-14 16:06:47,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47 WrapperNode [2025-04-14 16:06:47,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 16:06:47,486 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 16:06:47,486 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 16:06:47,486 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 16:06:47,490 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,529 INFO L138 Inliner]: procedures = 23, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 125 [2025-04-14 16:06:47,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 16:06:47,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 16:06:47,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 16:06:47,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 16:06:47,537 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,538 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,539 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,539 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,547 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,547 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,548 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,553 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,556 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 16:06:47,556 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 16:06:47,560 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 16:06:47,561 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 16:06:47,561 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (1/1) ... [2025-04-14 16:06:47,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 16:06:47,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:47,595 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 16:06:47,598 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 16:06:47,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 16:06:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 16:06:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 16:06:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 16:06:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 16:06:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 16:06:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-14 16:06:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 16:06:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 16:06:47,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 16:06:47,616 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-14 16:06:47,617 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 16:06:47,700 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 16:06:47,702 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 16:06:47,897 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 16:06:47,897 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 16:06:48,050 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 16:06:48,050 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 16:06:48,051 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:06:48 BoogieIcfgContainer [2025-04-14 16:06:48,051 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 16:06:48,053 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 16:06:48,053 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 16:06:48,057 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 16:06:48,057 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:06:47" (1/3) ... [2025-04-14 16:06:48,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb0e67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:06:48, skipping insertion in model container [2025-04-14 16:06:48,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:06:47" (2/3) ... [2025-04-14 16:06:48,058 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fb0e67c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:06:48, skipping insertion in model container [2025-04-14 16:06:48,058 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 04:06:48" (3/3) ... [2025-04-14 16:06:48,059 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-bad-counter-queue.wvr.c [2025-04-14 16:06:48,071 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 16:06:48,073 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-bad-counter-queue.wvr.c that has 3 procedures, 22 locations, 22 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 16:06:48,073 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 16:06:48,114 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 16:06:48,140 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:06:48,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 16:06:48,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:48,143 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 16:06:48,144 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 16:06:48,205 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 16:06:48,217 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 16:06:48,225 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;@2626b21a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 16:06:48,226 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 16:06:48,445 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 16:06:48,445 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:48,445 INFO L139 ounterexampleChecker]: Examining path program with hash -1307821777, occurence #1 [2025-04-14 16:06:48,445 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:06:48,445 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:48,448 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:48,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1533824577, now seen corresponding path program 1 times [2025-04-14 16:06:48,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:48,453 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29833586] [2025-04-14 16:06:48,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:48,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:48,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-14 16:06:48,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-14 16:06:48,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:48,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:48,633 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 16:06:48,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:48,633 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29833586] [2025-04-14 16:06:48,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29833586] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:06:48,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:06:48,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 16:06:48,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612887201] [2025-04-14 16:06:48,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:06:48,638 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 16:06:48,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:48,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 16:06:48,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 16:06:48,654 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:48,655 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:48,657 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states 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 16:06:48,657 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:48,703 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:48,703 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 16:06:48,703 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 16:06:48,704 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:48,704 INFO L139 ounterexampleChecker]: Examining path program with hash 1788912032, occurence #1 [2025-04-14 16:06:48,704 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:06:48,704 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:48,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:48,704 INFO L85 PathProgramCache]: Analyzing trace with hash 720661657, now seen corresponding path program 1 times [2025-04-14 16:06:48,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:48,704 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891302151] [2025-04-14 16:06:48,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:48,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:48,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-14 16:06:48,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-14 16:06:48,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:48,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:48,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:48,864 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891302151] [2025-04-14 16:06:48,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891302151] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:06:48,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:06:48,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 16:06:48,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835817985] [2025-04-14 16:06:48,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:06:48,865 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 16:06:48,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:48,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 16:06:48,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 16:06:48,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:48,866 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:48,868 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) 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 16:06:48,868 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:48,868 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:48,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:48,925 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:48,926 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 16:06:48,926 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 16:06:48,926 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:48,926 INFO L139 ounterexampleChecker]: Examining path program with hash 1788912032, occurence #2 [2025-04-14 16:06:48,926 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:48,926 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 3 [2025-04-14 16:06:48,939 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:48,939 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:06:48,940 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:48,940 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 13 [2025-04-14 16:06:48,940 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:48,940 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 15 [2025-04-14 16:06:48,940 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:48,940 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 16 [2025-04-14 16:06:48,940 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:48,940 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:48,940 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:48,940 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1708260541, now seen corresponding path program 1 times [2025-04-14 16:06:48,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:48,941 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309488202] [2025-04-14 16:06:48,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:48,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 16:06:48,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 16:06:48,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:48,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:49,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:49,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:49,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309488202] [2025-04-14 16:06:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309488202] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:49,077 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955134804] [2025-04-14 16:06:49,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:49,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:49,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:49,081 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 16:06:49,082 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 16:06:49,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 16:06:49,155 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 16:06:49,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:49,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:49,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 16:06:49,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:49,224 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:49,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:49,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955134804] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:49,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:06:49,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-14 16:06:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565138817] [2025-04-14 16:06:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:06:49,268 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 16:06:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:49,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 16:06:49,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 16:06:49,286 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:49,286 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:49,286 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 16:06:49,286 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:49,286 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:49,286 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:49,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:49,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:49,435 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:49,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 16:06:49,638 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-04-14 16:06:49,638 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:49,638 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:49,638 INFO L139 ounterexampleChecker]: Examining path program with hash 816977524, occurence #1 [2025-04-14 16:06:49,638 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:06:49,638 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:49,639 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:49,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1386524642, now seen corresponding path program 1 times [2025-04-14 16:06:49,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:49,639 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671234264] [2025-04-14 16:06:49,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:49,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 16:06:49,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 16:06:49,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:49,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:49,709 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 16:06:49,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:49,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671234264] [2025-04-14 16:06:49,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671234264] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:49,709 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360654970] [2025-04-14 16:06:49,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:49,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:49,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:49,711 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 16:06:49,712 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 16:06:49,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-14 16:06:49,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-14 16:06:49,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:49,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:49,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 16:06:49,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:49,799 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 16:06:49,800 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:49,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:49,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360654970] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:49,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 16:06:49,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2025-04-14 16:06:49,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615169475] [2025-04-14 16:06:49,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:06:49,832 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 16:06:49,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:49,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 16:06:49,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-04-14 16:06:49,833 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:49,833 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:49,833 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states 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 16:06:49,833 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:49,833 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:49,833 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:49,833 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:49,971 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:49,972 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:49,978 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-14 16:06:50,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:50,173 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:50,173 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:50,173 INFO L139 ounterexampleChecker]: Examining path program with hash -1294017690, occurence #1 [2025-04-14 16:06:50,173 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:06:50,173 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:50,173 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:50,173 INFO L85 PathProgramCache]: Analyzing trace with hash -833689382, now seen corresponding path program 1 times [2025-04-14 16:06:50,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:50,174 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987180120] [2025-04-14 16:06:50,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:50,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:50,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 16:06:50,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 16:06:50,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:50,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:50,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:50,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:50,460 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987180120] [2025-04-14 16:06:50,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987180120] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:50,461 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [433083018] [2025-04-14 16:06:50,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:06:50,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:50,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:50,462 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 16:06:50,464 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 16:06:50,498 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 16:06:50,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 16:06:50,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:50,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:50,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 16:06:50,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:50,594 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:50,594 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:50,636 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:06:50,637 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 14 [2025-04-14 16:06:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:50,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [433083018] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:50,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:50,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 16 [2025-04-14 16:06:50,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919451201] [2025-04-14 16:06:50,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:50,672 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 16:06:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:50,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 16:06:50,672 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2025-04-14 16:06:50,672 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:50,673 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:50,673 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 0 states have call successors, (0), 0 states 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 16:06:50,673 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:50,673 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:50,673 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:50,673 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:50,673 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:50,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:50,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:50,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:50,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:50,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:50,958 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 16:06:51,153 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 16:06:51,153 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:51,153 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:51,153 INFO L139 ounterexampleChecker]: Examining path program with hash 1802716119, occurence #1 [2025-04-14 16:06:51,153 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:06:51,153 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:51,154 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2087066526, now seen corresponding path program 2 times [2025-04-14 16:06:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:51,154 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451924396] [2025-04-14 16:06:51,154 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:06:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:51,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 16:06:51,168 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 16:06:51,168 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:06:51,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:51,234 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:51,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:51,234 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451924396] [2025-04-14 16:06:51,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451924396] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:51,235 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356999728] [2025-04-14 16:06:51,235 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:06:51,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:51,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:51,237 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 16:06:51,238 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 16:06:51,277 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-04-14 16:06:51,293 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 16:06:51,293 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:06:51,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:51,294 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 16:06:51,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:51,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:51,435 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:51,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356999728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:51,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:51,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 15 [2025-04-14 16:06:51,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086026105] [2025-04-14 16:06:51,435 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:51,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 16:06:51,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:51,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 16:06:51,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=162, Unknown=0, NotChecked=0, Total=210 [2025-04-14 16:06:51,436 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:51,436 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:51,436 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.6) internal successors, (54), 15 states have internal predecessors, (54), 0 states have call successors, (0), 0 states 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 16:06:51,436 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:51,436 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:51,436 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:51,436 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:51,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:51,437 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:51,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:51,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:51,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:51,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:51,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:51,702 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:51,711 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 16:06:51,902 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:51,903 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:51,903 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:51,903 INFO L139 ounterexampleChecker]: Examining path program with hash -1084712987, occurence #1 [2025-04-14 16:06:51,903 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:06:51,903 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:51,903 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:51,903 INFO L85 PathProgramCache]: Analyzing trace with hash 705486479, now seen corresponding path program 3 times [2025-04-14 16:06:51,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:51,904 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278232771] [2025-04-14 16:06:51,904 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:06:51,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:51,912 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 16:06:51,918 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 16:06:51,919 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 16:06:51,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:51,999 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:51,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:51,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278232771] [2025-04-14 16:06:51,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278232771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:51,999 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884078219] [2025-04-14 16:06:51,999 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:06:51,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:51,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:52,002 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 16:06:52,004 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 16:06:52,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 2 equivalence classes. [2025-04-14 16:06:52,058 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 25 of 25 statements. [2025-04-14 16:06:52,058 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 16:06:52,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:52,059 INFO L256 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 16:06:52,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:52,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:52,139 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:52,191 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:52,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [884078219] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:52,192 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:52,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2025-04-14 16:06:52,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68332206] [2025-04-14 16:06:52,192 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:52,192 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 16:06:52,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:52,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 16:06:52,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2025-04-14 16:06:52,193 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:52,193 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:52,193 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.466666666666667) internal successors, (52), 14 states have internal predecessors, (52), 0 states have call successors, (0), 0 states 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 16:06:52,193 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:52,193 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:52,193 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:52,193 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:52,193 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:52,193 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:52,193 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:52,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:52,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:52,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:52,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:52,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:52,394 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:52,395 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:52,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 16:06:52,595 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:52,595 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:52,596 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:52,596 INFO L139 ounterexampleChecker]: Examining path program with hash -1294017690, occurence #2 [2025-04-14 16:06:52,596 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:52,596 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 16:06:52,596 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:52,596 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 16:06:52,596 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:52,596 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 25 [2025-04-14 16:06:52,596 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:52,596 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 16:06:52,596 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:52,596 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:52,596 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:52,596 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:52,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2000815927, now seen corresponding path program 4 times [2025-04-14 16:06:52,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:52,597 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155325286] [2025-04-14 16:06:52,597 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:06:52,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:52,610 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 16:06:52,645 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 16:06:52,646 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 16:06:52,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:53,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 16:06:53,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:53,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155325286] [2025-04-14 16:06:53,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155325286] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:53,174 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36186411] [2025-04-14 16:06:53,174 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:06:53,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:53,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:53,176 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 16:06:53,177 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 16:06:53,212 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 28 statements into 2 equivalence classes. [2025-04-14 16:06:53,230 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 16:06:53,230 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 16:06:53,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:53,231 INFO L256 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 16:06:53,233 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:53,461 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 16:06:53,461 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:53,682 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 16:06:53,682 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 45 [2025-04-14 16:06:53,766 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-14 16:06:53,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36186411] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:53,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:53,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 34 [2025-04-14 16:06:53,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384148002] [2025-04-14 16:06:53,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:53,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-14 16:06:53,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:53,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-14 16:06:53,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1066, Unknown=0, NotChecked=0, Total=1190 [2025-04-14 16:06:53,768 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:53,768 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:53,768 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:53,768 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:54,593 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 16:06:54,599 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 16:06:54,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:54,794 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:54,794 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:54,794 INFO L139 ounterexampleChecker]: Examining path program with hash 1802716119, occurence #2 [2025-04-14 16:06:54,794 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:54,794 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 4 [2025-04-14 16:06:54,794 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:54,795 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 7 [2025-04-14 16:06:54,795 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:54,795 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 26 [2025-04-14 16:06:54,795 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:54,795 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 16:06:54,795 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:54,795 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 16:06:54,795 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:54,795 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:54,795 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:54,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:54,795 INFO L85 PathProgramCache]: Analyzing trace with hash -19574449, now seen corresponding path program 5 times [2025-04-14 16:06:54,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:54,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139716545] [2025-04-14 16:06:54,795 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 16:06:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:54,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 3 equivalence classes. [2025-04-14 16:06:54,820 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 16:06:54,820 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 16:06:54,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:54,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:54,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139716545] [2025-04-14 16:06:54,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139716545] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:54,925 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1810733856] [2025-04-14 16:06:54,925 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 16:06:54,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:54,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:54,927 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 16:06:54,929 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 16:06:54,972 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 31 statements into 3 equivalence classes. [2025-04-14 16:06:54,993 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 31 of 31 statements. [2025-04-14 16:06:54,993 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-04-14 16:06:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:54,995 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 16:06:54,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:55,117 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:55,117 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:55,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1810733856] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:55,181 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:55,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 17 [2025-04-14 16:06:55,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837222666] [2025-04-14 16:06:55,182 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:55,182 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-04-14 16:06:55,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:55,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-04-14 16:06:55,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2025-04-14 16:06:55,183 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:55,183 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:55,183 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.111111111111111) internal successors, (56), 17 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2025-04-14 16:06:55,183 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-14 16:06:55,244 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:55,250 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 16:06:55,445 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-14 16:06:55,445 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:55,445 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:55,445 INFO L139 ounterexampleChecker]: Examining path program with hash 1802716119, occurence #3 [2025-04-14 16:06:55,445 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:55,445 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 16:06:55,445 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:55,445 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 16:06:55,445 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:55,446 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 27 [2025-04-14 16:06:55,446 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:55,446 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 29 [2025-04-14 16:06:55,446 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:55,446 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-14 16:06:55,446 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:55,446 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:55,446 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:55,446 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:55,446 INFO L85 PathProgramCache]: Analyzing trace with hash 306509433, now seen corresponding path program 6 times [2025-04-14 16:06:55,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:55,446 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179710265] [2025-04-14 16:06:55,446 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 16:06:55,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:55,456 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 3 equivalence classes. [2025-04-14 16:06:55,470 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 16:06:55,470 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 16:06:55,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:55,579 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:55,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:55,579 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179710265] [2025-04-14 16:06:55,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179710265] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:55,580 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630128810] [2025-04-14 16:06:55,580 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 16:06:55,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:55,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:55,582 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 16:06:55,583 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 16:06:55,622 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 32 statements into 3 equivalence classes. [2025-04-14 16:06:55,642 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 16:06:55,642 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 16:06:55,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:55,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 16:06:55,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:55,743 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:55,829 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:55,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630128810] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:55,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:55,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-14 16:06:55,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948994489] [2025-04-14 16:06:55,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:55,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 16:06:55,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:55,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 16:06:55,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-04-14 16:06:55,830 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:55,830 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:55,830 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 26 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:55,831 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:56,130 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:56,131 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:56,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-14 16:06:56,331 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,SelfDestructingSolverStorable9 [2025-04-14 16:06:56,332 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:56,332 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:56,332 INFO L139 ounterexampleChecker]: Examining path program with hash -1084712987, occurence #2 [2025-04-14 16:06:56,332 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:56,332 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 16:06:56,332 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:56,332 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 16:06:56,332 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:56,332 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 28 [2025-04-14 16:06:56,332 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:56,332 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 30 [2025-04-14 16:06:56,332 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:56,332 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:56,332 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:56,332 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:56,332 INFO L85 PathProgramCache]: Analyzing trace with hash 628245332, now seen corresponding path program 7 times [2025-04-14 16:06:56,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:56,333 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607240343] [2025-04-14 16:06:56,333 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 16:06:56,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:56,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 16:06:56,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 16:06:56,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:56,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:56,442 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:56,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607240343] [2025-04-14 16:06:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607240343] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:56,443 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056847557] [2025-04-14 16:06:56,443 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 16:06:56,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:56,443 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:56,445 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 16:06:56,447 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 16:06:56,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-14 16:06:56,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 16:06:56,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:06:56,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:56,503 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-14 16:06:56,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:56,616 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:56,691 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:56,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056847557] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:56,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:56,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 19 [2025-04-14 16:06:56,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745675411] [2025-04-14 16:06:56,691 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:56,692 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-14 16:06:56,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:56,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-14 16:06:56,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2025-04-14 16:06:56,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:56,692 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:56,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.35) internal successors, (67), 19 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:06:56,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:56,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:56,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:56,692 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:56,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:56,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:56,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:56,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:56,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:56,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:56,693 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:56,966 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:56,973 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 16:06:57,167 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,SelfDestructingSolverStorable10 [2025-04-14 16:06:57,167 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:57,167 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:57,167 INFO L139 ounterexampleChecker]: Examining path program with hash 1802716119, occurence #4 [2025-04-14 16:06:57,167 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:57,168 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 5 [2025-04-14 16:06:57,168 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:57,168 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 16:06:57,168 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:57,168 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 33 [2025-04-14 16:06:57,168 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:57,168 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 16:06:57,168 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:57,168 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 36 [2025-04-14 16:06:57,168 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:57,168 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:57,168 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:57,168 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:57,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1093972396, now seen corresponding path program 8 times [2025-04-14 16:06:57,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:57,168 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531762547] [2025-04-14 16:06:57,168 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:06:57,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:57,174 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 16:06:57,179 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 16:06:57,179 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:06:57,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:57,288 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 9 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:57,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:57,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531762547] [2025-04-14 16:06:57,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531762547] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:57,289 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449154254] [2025-04-14 16:06:57,289 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 16:06:57,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:57,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:57,291 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 16:06:57,293 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 16:06:57,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-04-14 16:06:57,362 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 16:06:57,363 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 16:06:57,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:57,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 16:06:57,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:57,490 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:57,490 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:57,578 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:57,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449154254] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:57,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:57,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-04-14 16:06:57,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993585961] [2025-04-14 16:06:57,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:57,578 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 16:06:57,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:57,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 16:06:57,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=406, Unknown=0, NotChecked=0, Total=552 [2025-04-14 16:06:57,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:57,579 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:57,579 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.2916666666666665) internal successors, (79), 23 states have internal predecessors, (79), 0 states have call successors, (0), 0 states 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 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:57,579 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:57,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:57,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:57,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:57,580 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:57,637 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:57,638 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:06:57,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 16:06:57,842 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-04-14 16:06:57,842 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:57,842 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:57,842 INFO L139 ounterexampleChecker]: Examining path program with hash 1802716119, occurence #5 [2025-04-14 16:06:57,842 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:57,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:06:57,842 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:57,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:06:57,842 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:57,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 34 [2025-04-14 16:06:57,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:57,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 36 [2025-04-14 16:06:57,842 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:57,842 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 16:06:57,842 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:57,843 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:57,843 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:57,843 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:57,843 INFO L85 PathProgramCache]: Analyzing trace with hash -312908310, now seen corresponding path program 9 times [2025-04-14 16:06:57,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:57,843 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134024484] [2025-04-14 16:06:57,843 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:06:57,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:57,851 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-14 16:06:57,885 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 16:06:57,885 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 16:06:57,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:58,008 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:58,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:58,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134024484] [2025-04-14 16:06:58,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134024484] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:58,009 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874689819] [2025-04-14 16:06:58,009 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 16:06:58,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:58,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:58,011 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 16:06:58,012 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 16:06:58,054 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 4 equivalence classes. [2025-04-14 16:06:58,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 16:06:58,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-14 16:06:58,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:58,084 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 16:06:58,085 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 25 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:58,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:58,303 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 16:06:58,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874689819] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:58,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:58,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2025-04-14 16:06:58,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573952003] [2025-04-14 16:06:58,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:58,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-04-14 16:06:58,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:58,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-04-14 16:06:58,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=400, Unknown=0, NotChecked=0, Total=552 [2025-04-14 16:06:58,304 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:58,304 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:58,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.375) internal successors, (81), 23 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:06:58,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:58,572 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:06:58,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:58,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-04-14 16:06:58,773 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,SelfDestructingSolverStorable12 [2025-04-14 16:06:58,773 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:58,773 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:58,773 INFO L139 ounterexampleChecker]: Examining path program with hash -1084712987, occurence #3 [2025-04-14 16:06:58,773 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:58,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:06:58,774 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:58,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:06:58,774 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:58,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 35 [2025-04-14 16:06:58,774 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:58,774 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 37 [2025-04-14 16:06:58,774 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:58,774 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:58,774 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:58,774 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:58,774 INFO L85 PathProgramCache]: Analyzing trace with hash 8827589, now seen corresponding path program 10 times [2025-04-14 16:06:58,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:58,774 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58083895] [2025-04-14 16:06:58,774 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:06:58,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:58,780 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-14 16:06:58,784 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 16:06:58,784 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 16:06:58,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:58,844 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-04-14 16:06:58,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:58,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58083895] [2025-04-14 16:06:58,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58083895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:06:58,844 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [352196139] [2025-04-14 16:06:58,844 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 16:06:58,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:06:58,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:06:58,846 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 16:06:58,848 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 16:06:58,888 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 39 statements into 2 equivalence classes. [2025-04-14 16:06:58,909 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 39 of 39 statements. [2025-04-14 16:06:58,910 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 16:06:58,910 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:58,911 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-14 16:06:58,912 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:06:59,034 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 6 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:59,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:06:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 10 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:06:59,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [352196139] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:06:59,143 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:06:59,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 22 [2025-04-14 16:06:59,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748609719] [2025-04-14 16:06:59,143 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:06:59,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-04-14 16:06:59,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:59,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-04-14 16:06:59,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=352, Unknown=0, NotChecked=0, Total=462 [2025-04-14 16:06:59,144 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:59,144 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:59,144 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8181818181818183) internal successors, (84), 22 states have internal predecessors, (84), 0 states have call successors, (0), 0 states 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 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,144 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:59,551 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,552 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-14 16:06:59,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-14 16:06:59,752 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,SelfDestructingSolverStorable13 [2025-04-14 16:06:59,753 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:06:59,753 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:06:59,753 INFO L139 ounterexampleChecker]: Examining path program with hash 1802716119, occurence #6 [2025-04-14 16:06:59,753 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:06:59,753 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 6 [2025-04-14 16:06:59,753 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:59,753 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 9 [2025-04-14 16:06:59,753 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:59,753 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 40 [2025-04-14 16:06:59,753 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:59,753 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 42 [2025-04-14 16:06:59,753 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:06:59,753 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 43 [2025-04-14 16:06:59,753 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:06:59,753 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:06:59,753 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:06:59,754 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:06:59,754 INFO L85 PathProgramCache]: Analyzing trace with hash 674276613, now seen corresponding path program 11 times [2025-04-14 16:06:59,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:06:59,754 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526729188] [2025-04-14 16:06:59,754 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 16:06:59,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:06:59,759 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 45 statements into 5 equivalence classes. [2025-04-14 16:06:59,771 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 16:06:59,771 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-04-14 16:06:59,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:06:59,848 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-04-14 16:06:59,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:06:59,849 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526729188] [2025-04-14 16:06:59,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526729188] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 16:06:59,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 16:06:59,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 16:06:59,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15086652] [2025-04-14 16:06:59,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 16:06:59,850 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 16:06:59,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:06:59,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 16:06:59,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 16:06:59,850 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:06:59,850 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:06:59,850 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 30 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:06:59,850 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:06:59,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 25 states. [2025-04-14 16:06:59,851 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:07:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:07:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:07:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:07:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:07:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,136 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 16:07:00,137 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:07:00,137 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-14 16:07:00,137 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:07:00,137 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:07:00,138 INFO L139 ounterexampleChecker]: Examining path program with hash -398377205, occurence #1 [2025-04-14 16:07:00,138 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 16:07:00,138 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:07:00,138 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:07:00,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1940312965, now seen corresponding path program 12 times [2025-04-14 16:07:00,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:07:00,138 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912035274] [2025-04-14 16:07:00,138 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 16:07:00,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:07:00,144 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 7 equivalence classes. [2025-04-14 16:07:00,195 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 16:07:00,195 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-04-14 16:07:00,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:07:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:07:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 16:07:00,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912035274] [2025-04-14 16:07:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912035274] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 16:07:00,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246026967] [2025-04-14 16:07:00,378 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 16:07:00,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:07:00,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 16:07:00,380 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 16:07:00,382 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 16:07:00,432 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 54 statements into 7 equivalence classes. [2025-04-14 16:07:00,467 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 54 of 54 statements. [2025-04-14 16:07:00,467 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-04-14 16:07:00,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 16:07:00,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-04-14 16:07:00,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 16:07:00,689 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 85 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:07:00,689 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 16:07:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 85 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 16:07:00,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246026967] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 16:07:00,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 16:07:00,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2025-04-14 16:07:00,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010311362] [2025-04-14 16:07:00,857 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 16:07:00,857 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-04-14 16:07:00,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 16:07:00,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-04-14 16:07:00,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=784, Unknown=0, NotChecked=0, Total=1056 [2025-04-14 16:07:00,858 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:07:00,858 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 16:07:00,858 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 3.606060606060606) internal successors, (119), 32 states have internal predecessors, (119), 0 states have call successors, (0), 0 states 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 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 31 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 27 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:07:00,858 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-04-14 16:07:00,953 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 16:07:00,955 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-14 16:07:00,962 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-04-14 16:07:01,156 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 16:07:01,157 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 16:07:01,157 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 16:07:01,157 INFO L139 ounterexampleChecker]: Examining path program with hash -398377205, occurence #2 [2025-04-14 16:07:01,157 INFO L145 ounterexampleChecker]: Trying to synthesize and prove commutativity condition. [2025-04-14 16:07:01,158 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 8 [2025-04-14 16:07:01,158 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:07:01,158 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 11 [2025-04-14 16:07:01,158 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:07:01,158 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 42 [2025-04-14 16:07:01,174 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:07:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -163065042, now seen corresponding path program 1 times [2025-04-14 16:07:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy SMTINTERPOL [2025-04-14 16:07:01,175 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916996926] [2025-04-14 16:07:01,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 16:07:01,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:07:01,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-14 16:07:01,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-14 16:07:01,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:07:01,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:07:01,201 INFO L130 FreeRefinementEngine]: Strategy SMTINTERPOL found a feasible trace [2025-04-14 16:07:01,201 INFO L180 ounterexampleChecker]: Commutativity condition check vielded CONDITION_NOT_SATISFIED. Marking as hopeless. [2025-04-14 16:07:01,201 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 53 [2025-04-14 16:07:01,201 WARN L190 ounterexampleChecker]: Statements were already independent. [2025-04-14 16:07:01,201 INFO L166 ounterexampleChecker]: Performing commutativity condition check at non-minimality point 54 [2025-04-14 16:07:01,201 INFO L209 ounterexampleChecker]: No commutativity condition found. [2025-04-14 16:07:01,201 WARN L214 ounterexampleChecker]: Failed to synthesize and prove commutativity condition. [2025-04-14 16:07:01,201 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 16:07:01,201 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 16:07:01,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1386307781, now seen corresponding path program 13 times [2025-04-14 16:07:01,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 16:07:01,202 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26758986] [2025-04-14 16:07:01,202 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 16:07:01,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 16:07:01,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-14 16:07:01,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 16:07:01,242 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:07:01,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:07:01,242 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 16:07:01,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-14 16:07:01,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-14 16:07:01,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 16:07:01,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 16:07:01,289 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 16:07:01,290 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 16:07:01,290 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 16:07:01,292 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 16:07:01,292 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 16:07:01,292 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,SelfDestructingSolverStorable17 [2025-04-14 16:07:01,297 INFO L422 BasicCegarLoop]: Path program histogram: [13, 1, 1, 1, 1] [2025-04-14 16:07:01,374 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 16:07:01,374 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 16:07:01,383 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-14 16:07:01,383 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:07:01 BasicIcfg [2025-04-14 16:07:01,383 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 16:07:01,384 INFO L158 Benchmark]: Toolchain (without parser) took 14121.30ms. Allocated memory was 155.2MB in the beginning and 352.3MB in the end (delta: 197.1MB). Free memory was 111.1MB in the beginning and 120.5MB in the end (delta: -9.4MB). Peak memory consumption was 185.5MB. Max. memory is 8.0GB. [2025-04-14 16:07:01,384 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:07:01,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.94ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 95.9MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 16:07:01,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.85ms. Allocated memory is still 155.2MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 16:07:01,385 INFO L158 Benchmark]: Boogie Preprocessor took 25.74ms. Allocated memory is still 155.2MB. Free memory was 93.9MB in the beginning and 92.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 16:07:01,385 INFO L158 Benchmark]: IcfgBuilder took 495.27ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 53.4MB in the end (delta: 39.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. [2025-04-14 16:07:01,386 INFO L158 Benchmark]: TraceAbstraction took 13329.83ms. Allocated memory was 155.2MB in the beginning and 352.3MB in the end (delta: 197.1MB). Free memory was 53.1MB in the beginning and 120.5MB in the end (delta: -67.4MB). Peak memory consumption was 131.0MB. Max. memory is 8.0GB. [2025-04-14 16:07:01,386 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 159.4MB. Free memory is still 87.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 221.94ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 95.9MB in the end (delta: 15.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.85ms. Allocated memory is still 155.2MB. Free memory was 95.9MB in the beginning and 93.9MB in the end (delta: 1.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 25.74ms. Allocated memory is still 155.2MB. Free memory was 93.9MB in the beginning and 92.8MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 495.27ms. Allocated memory is still 155.2MB. Free memory was 92.8MB in the beginning and 53.4MB in the end (delta: 39.4MB). Peak memory consumption was 37.7MB. Max. memory is 8.0GB. * TraceAbstraction took 13329.83ms. Allocated memory was 155.2MB in the beginning and 352.3MB in the end (delta: 197.1MB). Free memory was 53.1MB in the beginning and 120.5MB in the end (delta: -67.4MB). Peak memory consumption was 131.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: 1400, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 614, dependent conditional: 606, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 873, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 87, dependent conditional: 79, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 873, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 87, dependent conditional: 79, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1465, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 679, dependent conditional: 671, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1465, independent: 786, independent conditional: 0, independent unconditional: 786, dependent: 679, dependent conditional: 576, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1465, independent: 786, independent conditional: 0, independent unconditional: 786, dependent: 679, dependent conditional: 576, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 210, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 71, dependent conditional: 63, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 210, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 71, dependent conditional: 63, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 71, dependent conditional: 63, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1339, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 1292, dependent conditional: 1090, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1465, independent: 647, independent conditional: 0, independent unconditional: 647, dependent: 608, dependent conditional: 513, dependent unconditional: 95, unknown: 210, unknown conditional: 63, unknown unconditional: 147] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 140, Positive conditional cache size: 1, Positive unconditional cache size: 139, Negative cache size: 71, Negative conditional cache size: 63, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 737, Maximal queried relation: 12, Independence queries for same thread: 527, Persistent sets #1 benchmarks: Persistent set computation time: 0.3s, Number of persistent set computation: 29, Number of trivial persistent sets: 23, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 152, independent: 144, independent conditional: 0, independent unconditional: 144, 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: 1400, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 614, dependent conditional: 606, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 873, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 87, dependent conditional: 79, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 873, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 87, dependent conditional: 79, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 1465, independent: 786, independent conditional: 642, independent unconditional: 144, dependent: 679, dependent conditional: 671, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 1465, independent: 786, independent conditional: 0, independent unconditional: 786, dependent: 679, dependent conditional: 576, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 1465, independent: 786, independent conditional: 0, independent unconditional: 786, dependent: 679, dependent conditional: 576, dependent unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 210, independent: 139, independent conditional: 0, independent unconditional: 139, dependent: 71, dependent conditional: 63, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 210, independent: 137, independent conditional: 0, independent unconditional: 137, dependent: 73, dependent conditional: 0, dependent unconditional: 73, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 73, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 71, dependent conditional: 63, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 73, independent: 2, independent conditional: 0, independent unconditional: 2, dependent: 71, dependent conditional: 63, dependent unconditional: 8, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1339, independent: 47, independent conditional: 0, independent unconditional: 47, dependent: 1292, dependent conditional: 1090, dependent unconditional: 202, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 1, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 1465, independent: 647, independent conditional: 0, independent unconditional: 647, dependent: 608, dependent conditional: 513, dependent unconditional: 95, unknown: 210, unknown conditional: 63, unknown unconditional: 147] , Statistics on independence cache: Total cache size (in pairs): 211, Positive cache size: 140, Positive conditional cache size: 1, Positive unconditional cache size: 139, Negative cache size: 71, Negative conditional cache size: 63, Negative unconditional cache size: 8, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 737, Maximal queried relation: 12, Independence queries for same thread: 527 - CounterExampleResult [Line: 78]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L39] 0 int* A; [L40] 0 _Atomic int counter; [L41] 0 int N; [L66] 0 pthread_t t1, t2; [L68] 0 N = __VERIFIER_nondet_int() [L69] CALL, EXPR 0 create_fresh_int_array(N) [L84] CALL 0 assume_abort_if_not(size >= 0) [L36] COND FALSE 0 !(!cond) [L84] RET 0 assume_abort_if_not(size >= 0) [L85] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L36] COND FALSE 0 !(!cond) [L85] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L87] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L88] 0 int i = 0; VAL [A={0:0}, N=6, \at(size, Pre)=6, arr={-3:0}, counter=0, i=0, size=6] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=6, \at(size, Pre)=6, arr={-3:0}, counter=0, i=1, size=6] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=6, \at(size, Pre)=6, arr={-3:0}, counter=0, i=2, size=6] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=6, \at(size, Pre)=6, arr={-3:0}, counter=0, i=3, size=6] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=6, \at(size, Pre)=6, arr={-3:0}, counter=0, i=4, size=6] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=6, \at(size, Pre)=6, arr={-3:0}, counter=0, i=5, size=6] [L88] COND TRUE 0 i < size [L89] 0 arr[i] = __VERIFIER_nondet_int() [L88] 0 i++ VAL [A={0:0}, N=6, \at(size, Pre)=6, arr={-3:0}, counter=0, i=6, size=6] [L88] COND FALSE 0 !(i < size) [L91] 0 return arr; [L69] RET, EXPR 0 create_fresh_int_array(N) [L69] 0 A = create_fresh_int_array(N) [L72] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [A={-3:0}, N=6, counter=0, t1=-1] [L48] 1 int i=0; VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0] [L73] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [A={-3:0}, N=6, counter=0, t1=-1, t2=0] [L57] 2 int i=0; VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=3, i=0, tmp=3] [L48] 1 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=3, i=1] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=0, tmp=0] [L57] 2 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=1] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=7, i=1, tmp=7] [L48] 1 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=7, i=2] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=1, tmp=0] [L57] 2 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=2] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=5, i=2, tmp=5] [L48] 1 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=5, i=3] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=2, tmp=0] [L57] 2 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=3] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=10, i=3, tmp=10] [L48] 1 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=10, i=4] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=3, tmp=0] [L57] 2 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=4] [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L50] 1 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=6, i=4, tmp=6] [L48] 1 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=6, i=5] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L48] COND TRUE 1 i= 0 || a >= -2147483648 - b) [L36] COND FALSE 1 !(!cond) [L101] RET 1 assume_abort_if_not(b >= 0 || a >= -2147483648 - b) [L102] CALL 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L36] COND FALSE 1 !(!cond) [L102] RET 1 assume_abort_if_not(b <= 0 || a <= 2147483647 - b) [L103] 1 return a + b; [L49] RET, EXPR 1 plus(counter, A[i]) [L49] 1 int tmp = plus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=4, tmp=0] [L57] 2 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=0, i=5] [L50] 1 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=4, i=5, tmp=4] [L48] 1 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=4, i=6] [L57] COND TRUE 2 i= b - 2147483648) [L36] COND FALSE 2 !(!cond) [L95] RET 2 assume_abort_if_not(b <= 0 || a >= b - 2147483648) [L96] CALL 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L36] COND FALSE 2 !(!cond) [L96] RET 2 assume_abort_if_not(b >= 0 || a <= b + 2147483647) [L97] 2 return a - b; [L58] RET, EXPR 2 minus(counter, A[i]) [L58] 2 int tmp = minus(counter, A[i]); [L59] 2 counter = tmp VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=6, i=5, tmp=6] [L57] 2 i++ VAL [A={-3:0}, N=6, \at(_argptr, Pre)={0:0}, _argptr={0:0}, counter=6, i=6] [L48] COND FALSE 1 !(i