/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/parallel-barrier-loop.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-dev-4cc0a57-m [2025-04-14 15:56:07,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 15:56:07,269 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 15:56:07,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 15:56:07,275 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 15:56:07,295 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 15:56:07,296 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 15:56:07,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 15:56:07,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 15:56:07,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 15:56:07,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 15:56:07,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 15:56:07,296 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 15:56:07,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 15:56:07,297 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 15:56:07,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 15:56:07,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:56:07,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:56:07,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:56:07,300 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:56:07,300 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 15:56:07,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-14 15:56:07,301 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-14 15:56:07,301 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-14 15:56:07,301 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 15:56:07,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 15:56:07,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 15:56:07,517 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 15:56:07,517 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 15:56:07,517 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 15:56:07,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2025-04-14 15:56:08,814 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a8a0ec7/bb61f2bf48654b0bbe2431696264a6cf/FLAGbe843e5db [2025-04-14 15:56:09,006 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 15:56:09,007 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/parallel-barrier-loop.wvr.c [2025-04-14 15:56:09,012 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a8a0ec7/bb61f2bf48654b0bbe2431696264a6cf/FLAGbe843e5db [2025-04-14 15:56:09,864 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a8a0ec7/bb61f2bf48654b0bbe2431696264a6cf [2025-04-14 15:56:09,866 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 15:56:09,867 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 15:56:09,868 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 15:56:09,868 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 15:56:09,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 15:56:09,871 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:56:09" (1/1) ... [2025-04-14 15:56:09,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c01de96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:09, skipping insertion in model container [2025-04-14 15:56:09,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:56:09" (1/1) ... [2025-04-14 15:56:09,882 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 15:56:10,055 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/parallel-barrier-loop.wvr.c[3922,3935] [2025-04-14 15:56:10,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:56:10,068 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 15:56:10,106 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/parallel-barrier-loop.wvr.c[3922,3935] [2025-04-14 15:56:10,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 15:56:10,118 INFO L204 MainTranslator]: Completed translation [2025-04-14 15:56:10,119 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10 WrapperNode [2025-04-14 15:56:10,120 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 15:56:10,120 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 15:56:10,120 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 15:56:10,120 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 15:56:10,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,132 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,159 INFO L138 Inliner]: procedures = 22, calls = 22, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 223 [2025-04-14 15:56:10,160 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 15:56:10,160 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 15:56:10,160 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 15:56:10,160 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 15:56:10,166 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,173 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,174 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,177 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,178 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,179 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,179 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,186 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 15:56:10,187 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 15:56:10,187 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 15:56:10,187 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 15:56:10,188 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (1/1) ... [2025-04-14 15:56:10,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 15:56:10,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:56:10,211 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 15:56:10,212 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 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 15:56:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 15:56:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 15:56:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-04-14 15:56:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-04-14 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-14 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread5 [2025-04-14 15:56:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure thread5 [2025-04-14 15:56:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure thread6 [2025-04-14 15:56:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure thread6 [2025-04-14 15:56:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 15:56:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 15:56:10,229 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 15:56:10,308 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 15:56:10,310 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 15:56:10,585 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 15:56:10,585 INFO L307 CfgBuilder]: Performing block encoding [2025-04-14 15:56:10,716 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 15:56:10,718 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 15:56:10,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:56:10 BoogieIcfgContainer [2025-04-14 15:56:10,719 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 15:56:10,721 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 15:56:10,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 15:56:10,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 15:56:10,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:56:09" (1/3) ... [2025-04-14 15:56:10,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f003ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:56:10, skipping insertion in model container [2025-04-14 15:56:10,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:56:10" (2/3) ... [2025-04-14 15:56:10,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f003ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:56:10, skipping insertion in model container [2025-04-14 15:56:10,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 03:56:10" (3/3) ... [2025-04-14 15:56:10,728 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-barrier-loop.wvr.c [2025-04-14 15:56:10,740 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 15:56:10,742 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-barrier-loop.wvr.c that has 7 procedures, 95 locations, 96 edges, 1 initial locations, 4 loop locations, and 1 error locations. [2025-04-14 15:56:10,742 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 15:56:10,837 INFO L143 ThreadInstanceAdder]: Constructed 18 joinOtherThreadTransitions. [2025-04-14 15:56:10,877 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:56:10,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-14 15:56:10,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 15:56:10,881 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 15:56:10,882 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 15:56:10,952 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 15:56:10,963 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == thread4Thread1of1ForFork0 ======== [2025-04-14 15:56:10,968 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;@238f10ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:56:10,968 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-14 15:56:12,061 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err5INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-14 15:56:12,061 INFO L790 garLoopResultBuilder]: Registering result SAFE for location thread4Thread1of1ForFork0Err7INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-14 15:56:12,067 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-14 15:56:12,069 INFO L320 ceAbstractionStarter]: Result for error location thread4Thread1of1ForFork0 was SAFE,SAFE (1/3) [2025-04-14 15:56:12,074 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:56:12,074 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-14 15:56:12,075 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-14 15:56:12,075 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;@238f10ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 15:56:12,075 INFO L341 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2025-04-14 15:56:12,094 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:56:12,094 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:56:12,094 INFO L139 ounterexampleChecker]: Examining path program with hash 429781292, occurence #1 [2025-04-14 15:56:12,094 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:56:12,095 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:56:12,097 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:56:12,098 INFO L85 PathProgramCache]: Analyzing trace with hash -180014063, now seen corresponding path program 1 times [2025-04-14 15:56:12,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:56:12,103 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753650445] [2025-04-14 15:56:12,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:56:12,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:56:12,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-04-14 15:56:12,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-04-14 15:56:12,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:56:12,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:56:12,282 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 15:56:12,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:56:12,282 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753650445] [2025-04-14 15:56:12,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753650445] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:56:12,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:56:12,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 15:56:12,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601441699] [2025-04-14 15:56:12,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:56:12,288 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 15:56:12,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:56:12,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 15:56:12,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 15:56:12,302 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,304 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:56:12,305 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 0 states have call successors, (0), 0 states 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 15:56:12,305 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,426 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,426 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 15:56:12,427 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:56:12,427 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:56:12,427 INFO L139 ounterexampleChecker]: Examining path program with hash -721171908, occurence #1 [2025-04-14 15:56:12,427 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:56:12,427 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:56:12,427 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:56:12,427 INFO L85 PathProgramCache]: Analyzing trace with hash 446405933, now seen corresponding path program 1 times [2025-04-14 15:56:12,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:56:12,427 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371227534] [2025-04-14 15:56:12,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:56:12,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:56:12,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-04-14 15:56:12,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-04-14 15:56:12,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:56:12,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:56:12,575 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 15:56:12,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:56:12,575 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371227534] [2025-04-14 15:56:12,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371227534] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:56:12,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:56:12,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:56:12,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420331724] [2025-04-14 15:56:12,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:56:12,576 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:56:12,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:56:12,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:56:12,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:56:12,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,577 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:56:12,577 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 15:56:12,577 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,577 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,811 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:12,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 15:56:12,811 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:56:12,812 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:56:12,812 INFO L139 ounterexampleChecker]: Examining path program with hash -1395248772, occurence #1 [2025-04-14 15:56:12,812 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:56:12,812 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:56:12,812 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:56:12,812 INFO L85 PathProgramCache]: Analyzing trace with hash 1374900906, now seen corresponding path program 1 times [2025-04-14 15:56:12,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:56:12,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712014860] [2025-04-14 15:56:12,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:56:12,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:56:12,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-04-14 15:56:12,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-04-14 15:56:12,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:56:12,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:56:12,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:56:12,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:56:12,930 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712014860] [2025-04-14 15:56:12,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712014860] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:56:12,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:56:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:56:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008695594] [2025-04-14 15:56:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:56:12,931 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:56:12,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:56:12,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:56:12,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:56:12,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,931 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:56:12,931 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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 15:56:12,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:12,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:12,931 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,081 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,082 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,082 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 15:56:13,082 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:56:13,082 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:56:13,082 INFO L139 ounterexampleChecker]: Examining path program with hash -618067388, occurence #1 [2025-04-14 15:56:13,082 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:56:13,082 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:56:13,083 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:56:13,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1231855644, now seen corresponding path program 1 times [2025-04-14 15:56:13,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:56:13,083 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650976509] [2025-04-14 15:56:13,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 15:56:13,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:56:13,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-04-14 15:56:13,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-04-14 15:56:13,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:56:13,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:56:13,301 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 15:56:13,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:56:13,301 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650976509] [2025-04-14 15:56:13,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650976509] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:56:13,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:56:13,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:56:13,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526627036] [2025-04-14 15:56:13,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:56:13,302 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:56:13,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:56:13,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:56:13,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:56:13,303 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,303 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:56:13,303 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 15:56:13,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,303 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,447 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,447 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 15:56:13,447 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:56:13,447 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:56:13,447 INFO L139 ounterexampleChecker]: Examining path program with hash -297850836, occurence #1 [2025-04-14 15:56:13,447 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:56:13,447 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:56:13,447 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:56:13,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1671542553, now seen corresponding path program 2 times [2025-04-14 15:56:13,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:56:13,448 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122333887] [2025-04-14 15:56:13,448 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 15:56:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:56:13,462 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 79 statements into 2 equivalence classes. [2025-04-14 15:56:13,489 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-04-14 15:56:13,489 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 15:56:13,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 15:56:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 15:56:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 15:56:13,611 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122333887] [2025-04-14 15:56:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122333887] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 15:56:13,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 15:56:13,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 15:56:13,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249235809] [2025-04-14 15:56:13,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 15:56:13,612 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 15:56:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 15:56:13,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 15:56:13,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 15:56:13,613 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,613 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-14 15:56:13,613 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 0 states have call successors, (0), 0 states 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 15:56:13,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,613 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,614 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 15:56:13,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,731 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 15:56:13,731 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 15:56:13,731 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2025-04-14 15:56:13,731 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-04-14 15:56:13,732 INFO L139 ounterexampleChecker]: Examining path program with hash 1421443089, occurence #1 [2025-04-14 15:56:13,732 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-04-14 15:56:13,732 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-04-14 15:56:13,732 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 15:56:13,732 INFO L85 PathProgramCache]: Analyzing trace with hash -196931481, now seen corresponding path program 3 times [2025-04-14 15:56:13,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 15:56:13,732 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121312969] [2025-04-14 15:56:13,732 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 15:56:13,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 15:56:13,747 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 79 statements into 2 equivalence classes. [2025-04-14 15:56:13,779 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 79 of 79 statements. [2025-04-14 15:56:13,779 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 15:56:13,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 15:56:13,780 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 15:56:13,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-04-14 15:56:13,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-04-14 15:56:13,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 15:56:13,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 15:56:13,843 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 15:56:13,843 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 15:56:13,843 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2025-04-14 15:56:13,843 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2025-04-14 15:56:13,844 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2025-04-14 15:56:13,844 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 15:56:13,846 INFO L422 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2025-04-14 15:56:13,846 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE,UNKNOWN,UNKNOWN (2/3) [2025-04-14 15:56:13,994 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 15:56:13,994 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 15:56:14,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-04-14 15:56:14,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 03:56:14 BasicIcfg [2025-04-14 15:56:14,009 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 15:56:14,010 INFO L158 Benchmark]: Toolchain (without parser) took 4142.65ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 99.3MB in the beginning and 163.6MB in the end (delta: -64.3MB). Peak memory consumption was 133.6MB. Max. memory is 8.0GB. [2025-04-14 15:56:14,010 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 15:56:14,010 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.98ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 84.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2025-04-14 15:56:14,010 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.50ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 15:56:14,010 INFO L158 Benchmark]: Boogie Preprocessor took 26.21ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 80.8MB in the end (delta: 675.1kB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 15:56:14,011 INFO L158 Benchmark]: IcfgBuilder took 532.44ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 37.4MB in the end (delta: 43.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-14 15:56:14,011 INFO L158 Benchmark]: TraceAbstraction took 3287.87ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 37.4MB in the beginning and 163.6MB in the end (delta: -126.3MB). Peak memory consumption was 70.7MB. Max. memory is 8.0GB. [2025-04-14 15:56:14,012 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.17ms. Allocated memory is still 159.4MB. Free memory is still 86.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 251.98ms. Allocated memory is still 142.6MB. Free memory was 99.3MB in the beginning and 84.2MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.50ms. Allocated memory is still 142.6MB. Free memory was 84.2MB in the beginning and 82.1MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 26.21ms. Allocated memory is still 142.6MB. Free memory was 81.5MB in the beginning and 80.8MB in the end (delta: 675.1kB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 532.44ms. Allocated memory is still 142.6MB. Free memory was 80.8MB in the beginning and 37.4MB in the end (delta: 43.4MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 3287.87ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 37.4MB in the beginning and 163.6MB in the end (delta: -126.3MB). Peak memory consumption was 70.7MB. 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: 10764, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 0, independent unconditional: 10167, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 0, independent unconditional: 10167, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4776, independent: 4722, independent conditional: 0, independent unconditional: 4722, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4776, independent: 4713, independent conditional: 0, independent unconditional: 4713, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 752, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 618, dependent conditional: 0, dependent unconditional: 618, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10236, independent: 5445, independent conditional: 0, independent unconditional: 5445, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4776, unknown conditional: 0, unknown unconditional: 4776] , Statistics on independence cache: Total cache size (in pairs): 4776, Positive cache size: 4722, Positive conditional cache size: 0, Positive unconditional cache size: 4722, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5252, Maximal queried relation: 0, Independence queries for same thread: 528, Persistent sets #1 benchmarks: Persistent set computation time: 0.9s, Number of persistent set computation: 437, Number of trivial persistent sets: 36, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 4984, independent: 4930, independent conditional: 0, independent unconditional: 4930, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 10764, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 597, dependent conditional: 543, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 5237, independent unconditional: 4930, dependent: 69, dependent conditional: 15, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 0, independent unconditional: 10167, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 10236, independent: 10167, independent conditional: 0, independent unconditional: 10167, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 4776, independent: 4722, independent conditional: 0, independent unconditional: 4722, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 4776, independent: 4713, independent conditional: 0, independent unconditional: 4713, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 63, independent: 9, independent conditional: 0, independent unconditional: 9, dependent: 54, dependent conditional: 0, dependent unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 752, independent: 134, independent conditional: 0, independent unconditional: 134, dependent: 618, dependent conditional: 0, dependent unconditional: 618, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 10236, independent: 5445, independent conditional: 0, independent unconditional: 5445, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 4776, unknown conditional: 0, unknown unconditional: 4776] , Statistics on independence cache: Total cache size (in pairs): 4776, Positive cache size: 4722, Positive conditional cache size: 0, Positive unconditional cache size: 4722, Negative cache size: 54, Negative conditional cache size: 0, Negative unconditional cache size: 54, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 5252, Maximal queried relation: 0, Independence queries for same thread: 528 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8185, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 603, dependent conditional: 547, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7684, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 102, dependent conditional: 46, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7684, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 102, dependent conditional: 46, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7744, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 162, dependent conditional: 106, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7744, independent: 7582, independent conditional: 1, independent unconditional: 7581, dependent: 162, dependent conditional: 18, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7744, independent: 7582, independent conditional: 1, independent unconditional: 7581, dependent: 162, dependent conditional: 18, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1681, independent: 1660, independent conditional: 1, independent unconditional: 1659, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1681, independent: 1653, independent conditional: 0, independent unconditional: 1653, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 92, dependent conditional: 17, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 7744, independent: 5922, independent conditional: 0, independent unconditional: 5922, dependent: 141, dependent conditional: 13, dependent unconditional: 128, unknown: 1681, unknown conditional: 6, unknown unconditional: 1675] , Statistics on independence cache: Total cache size (in pairs): 6457, Positive cache size: 6382, Positive conditional cache size: 1, Positive unconditional cache size: 6381, Negative cache size: 75, Negative conditional cache size: 5, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1842, Maximal queried relation: 2, Independence queries for same thread: 501, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 162, Number of trivial persistent sets: 155, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 5883, independent: 5827, independent conditional: 0, independent unconditional: 5827, dependent: 56, dependent conditional: 0, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 8185, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 603, dependent conditional: 547, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7684, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 102, dependent conditional: 46, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 7684, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 102, dependent conditional: 46, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 7744, independent: 7582, independent conditional: 1755, independent unconditional: 5827, dependent: 162, dependent conditional: 106, dependent unconditional: 56, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 7744, independent: 7582, independent conditional: 1, independent unconditional: 7581, dependent: 162, dependent conditional: 18, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 7744, independent: 7582, independent conditional: 1, independent unconditional: 7581, dependent: 162, dependent conditional: 18, dependent unconditional: 144, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1681, independent: 1660, independent conditional: 1, independent unconditional: 1659, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1681, independent: 1653, independent conditional: 0, independent unconditional: 1653, dependent: 28, dependent conditional: 0, dependent unconditional: 28, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 28, independent: 7, independent conditional: 1, independent unconditional: 6, dependent: 21, dependent conditional: 5, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 123, independent: 31, independent conditional: 10, independent unconditional: 21, dependent: 92, dependent conditional: 17, dependent unconditional: 75, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 7744, independent: 5922, independent conditional: 0, independent unconditional: 5922, dependent: 141, dependent conditional: 13, dependent unconditional: 128, unknown: 1681, unknown conditional: 6, unknown unconditional: 1675] , Statistics on independence cache: Total cache size (in pairs): 6457, Positive cache size: 6382, Positive conditional cache size: 1, Positive unconditional cache size: 6381, Negative cache size: 75, Negative conditional cache size: 5, Negative unconditional cache size: 70, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 1842, Maximal queried relation: 2, Independence queries for same thread: 501 - CounterExampleResult [Line: 171]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L36] 0 _Atomic unsigned int x_0, y_1, x_8, y_9; [L37] 0 _Atomic _Bool f1_2, f2_3, f1_10, f2_11; [L38] 0 unsigned int temp_4, temp_5, temp_6, temp_7, temp_12, temp_13, temp_14, temp_15; [L142] 0 pthread_t t1, t4; [L145] 0 x_0 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967292, x_8=0, y_1=0, y_9=0] [L146] 0 y_1 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967292, x_8=0, y_1=4294967299, y_9=0] [L147] 0 x_8 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=0] [L148] 0 y_9 = __VERIFIER_nondet_uint() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, temp_12=0, temp_13=0, temp_14=0, temp_15=0, temp_4=0, temp_5=0, temp_6=0, temp_7=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L149] 0 temp_4 = __VERIFIER_nondet_uint() [L150] 0 temp_5 = __VERIFIER_nondet_uint() [L151] 0 temp_6 = __VERIFIER_nondet_uint() [L152] 0 temp_7 = __VERIFIER_nondet_uint() [L153] 0 temp_12 = __VERIFIER_nondet_uint() [L154] 0 temp_13 = __VERIFIER_nondet_uint() [L155] 0 temp_14 = __VERIFIER_nondet_uint() [L156] 0 temp_15 = __VERIFIER_nondet_uint() [L157] 0 f1_2 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L158] 0 f2_3 = __VERIFIER_nondet_bool() VAL [f1_10=0, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L159] 0 f1_10 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L160] 0 f2_11 = __VERIFIER_nondet_bool() VAL [f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L163] CALL 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L33] COND FALSE 0 !(!cond) [L163] RET 0 assume_abort_if_not( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) [L165] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [\at(_argptr, Pre)={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t1=-3, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L78] 1 pthread_t t2, t3; VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L80] 1 f1_2 = 0 VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L81] 1 f2_3 = 0 VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L83] FCALL, FORK 1 pthread_create(&t2, 0, thread2, 0) VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-2, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L84] FCALL, FORK 1 pthread_create(&t3, 0, thread3, 0) VAL [\at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L166] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t1=-3, t2=-2, t3=-1, t4=0, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L128] 4 pthread_t t5, t6; VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L130] 4 f1_10 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L131] 4 f2_11 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L133] FCALL, FORK 4 pthread_create(&t5, 0, thread5, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L134] FCALL, FORK 4 pthread_create(&t6, 0, thread6, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L42] COND TRUE 2 __VERIFIER_nondet_bool() [L42] COND FALSE 2 !(__VERIFIER_nondet_bool()) [L56] 2 return 0; [L85] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L60] COND TRUE 3 __VERIFIER_nondet_bool() [L60] COND FALSE 3 !(__VERIFIER_nondet_bool()) [L74] 3 return 0; [L86] FCALL, JOIN 3 pthread_join(t3, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L88] 1 return 0; [L167] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-3, t2=-2, t3=-1, t4=0, t5=1, t6=2, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L92] COND TRUE 5 __VERIFIER_nondet_bool() [L92] COND TRUE 5 __VERIFIER_nondet_bool() [L93] 5 temp_12 = x_8 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, x_0=-4294967292, x_8=4, y_1=4294967299, y_9=3] [L94] 5 x_8 = temp_12 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=3] [L96] 5 f1_10 = 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=3] [L110] COND TRUE 6 __VERIFIER_nondet_bool() [L110] COND TRUE 6 __VERIFIER_nondet_bool() [L111] 6 temp_14 = y_9 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_14=3, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=3] [L112] 6 y_9 = temp_14 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_14=3, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=4] [L114] 6 f2_11 = 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_14=3, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=4] [L97] CALL 5 assume_abort_if_not(f2_11) [L33] COND FALSE 5 !(!cond) [L97] RET 5 assume_abort_if_not(f2_11) [L99] 5 temp_13 = y_9 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=4] [L100] 5 y_9 = temp_13 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=5] [L115] CALL 6 assume_abort_if_not(f1_10) [L33] COND FALSE 6 !(!cond) [L115] RET 6 assume_abort_if_not(f1_10) [L117] 6 temp_15 = x_8 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=1, f1_2=0, f2_11=1, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=5] [L102] 5 f1_10 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=5, y_1=4294967299, y_9=5] [L118] 6 x_8 = temp_15 + 1 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=1, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=6, y_1=4294967299, y_9=5] [L120] 6 f2_11 = 0 VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=6, y_1=4294967299, y_9=5] [L103] CALL 5 assume_abort_if_not(!f2_11) [L33] COND FALSE 5 !(!cond) [L103] RET 5 assume_abort_if_not(!f2_11) [L121] CALL 6 assume_abort_if_not(!f1_10) [L33] COND FALSE 6 !(!cond) [L121] RET 6 assume_abort_if_not(!f1_10) [L92] COND TRUE 5 __VERIFIER_nondet_bool() [L92] COND FALSE 5 !(__VERIFIER_nondet_bool()) [L106] 5 return 0; [L135] FCALL, JOIN 5 pthread_join(t5, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=6, y_1=4294967299, y_9=5] [L110] COND TRUE 6 __VERIFIER_nondet_bool() [L110] COND FALSE 6 !(__VERIFIER_nondet_bool()) [L124] 6 return 0; [L136] FCALL, JOIN 6 pthread_join(t6, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t2=-2, t3=-1, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=6, y_1=4294967299, y_9=5] [L138] 4 return 0; [L168] FCALL, JOIN 4 pthread_join(t4, 0) VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-3, t2=-2, t3=-1, t4=0, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=6, y_1=4294967299, y_9=5] [L170] CALL 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L33] COND FALSE 0 !(!cond) [L170] RET 0 assume_abort_if_not( !( ( x_0 == x_8 ) && ( y_1 == y_9 ) ) ) [L171] 0 reach_error() VAL [\at(_argptr, Pre)={0:0}, \at(_argptr, Pre)={0:0}, \result={0:0}, \result={0:0}, _argptr={0:0}, _argptr={0:0}, f1_10=0, f1_2=0, f2_11=0, f2_3=0, t1=-3, t2=-2, t3=-1, t4=0, t5=1, t6=2, temp_12=4, temp_13=4, temp_14=3, temp_15=5, x_0=-4294967292, x_8=6, y_1=4294967299, y_9=5] - UnprovableResult [Line: 165]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 166]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: thread4Thread1of1ForFork0 with 1 thread instances CFG has 13 procedures, 173 locations, 204 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 1.1s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 13 procedures, 173 locations, 204 edges, 11 error locations. Started 1 CEGAR loops. OverallTime: 1.8s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.8s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 446 NumberOfCodeBlocks, 446 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 362 ConstructedInterpolants, 0 QuantifiedInterpolants, 1068 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-04-14 15:56:14,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...