./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread/sigma.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread/sigma.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6311419391ea3ecb02e394ed41d0b486034a6610515a8077a215fd58cbf1832c --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:12:51,015 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:12:51,058 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:12:51,064 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:12:51,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:12:51,084 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:12:51,085 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:12:51,086 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:12:51,086 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:12:51,086 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:12:51,087 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:12:51,087 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:12:51,087 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:12:51,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:12:51,088 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:12:51,089 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:51,089 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:51,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:51,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:12:51,090 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:12:51,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:12:51,091 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6311419391ea3ecb02e394ed41d0b486034a6610515a8077a215fd58cbf1832c [2025-04-29 11:12:51,299 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:12:51,308 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:12:51,309 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:12:51,311 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:12:51,311 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:12:51,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/sigma.c [2025-04-29 11:12:52,617 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e068b2d9/79ddb17bfa0f4bd1b4ed051eb6af42b2/FLAGd3292283f [2025-04-29 11:12:52,871 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:12:52,871 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/sigma.c [2025-04-29 11:12:52,873 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:52,874 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:52,874 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:52,874 WARN L117 ultiparseSymbolTable]: System include string.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:12:52,880 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e068b2d9/79ddb17bfa0f4bd1b4ed051eb6af42b2/FLAGd3292283f [2025-04-29 11:12:53,619 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4e068b2d9/79ddb17bfa0f4bd1b4ed051eb6af42b2 [2025-04-29 11:12:53,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:12:53,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:12:53,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:53,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:12:53,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:12:53,626 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,627 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@b741a69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53, skipping insertion in model container [2025-04-29 11:12:53,627 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,635 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:12:53,799 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:53,808 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:12:53,843 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:12:53,854 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:12:53,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53 WrapperNode [2025-04-29 11:12:53,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:12:53,856 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:53,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:12:53,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:12:53,861 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,871 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,890 INFO L138 Inliner]: procedures = 12, calls = 13, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 114 [2025-04-29 11:12:53,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:12:53,891 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:12:53,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:12:53,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:12:53,896 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,896 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,898 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,898 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,903 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,904 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,906 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,907 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:12:53,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:12:53,911 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:12:53,911 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:12:53,912 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (1/1) ... [2025-04-29 11:12:53,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:12:53,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:12:53,933 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-29 11:12:53,935 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-29 11:12:53,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:12:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:12:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:12:53,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:12:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:12:53,951 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:12:53,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:12:53,952 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:12:54,013 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:12:54,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:12:54,218 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:12:54,218 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:12:54,228 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:12:54,230 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-04-29 11:12:54,230 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:54 BoogieIcfgContainer [2025-04-29 11:12:54,230 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:12:54,232 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:12:54,232 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:12:54,235 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:12:54,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:12:53" (1/3) ... [2025-04-29 11:12:54,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70850baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:54, skipping insertion in model container [2025-04-29 11:12:54,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:12:53" (2/3) ... [2025-04-29 11:12:54,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70850baa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:12:54, skipping insertion in model container [2025-04-29 11:12:54,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:54" (3/3) ... [2025-04-29 11:12:54,237 INFO L128 eAbstractionObserver]: Analyzing ICFG sigma.c [2025-04-29 11:12:54,247 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:12:54,249 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sigma.c that has 2 procedures, 150 locations, 157 edges, 1 initial locations, 3 loop locations, and 17 error locations. [2025-04-29 11:12:54,250 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:12:54,303 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:12:54,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 158 transitions, 323 flow [2025-04-29 11:12:54,404 INFO L116 PetriNetUnfolderBase]: 13/238 cut-off events. [2025-04-29 11:12:54,406 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:12:54,408 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 238 events. 13/238 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 547 event pairs, 0 based on Foata normal form. 0/195 useless extension candidates. Maximal degree in co-relation 127. Up to 4 conditions per place. [2025-04-29 11:12:54,408 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 158 transitions, 323 flow [2025-04-29 11:12:54,411 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 158 transitions, 323 flow [2025-04-29 11:12:54,418 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:12:54,425 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=PETRI_NET, 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;@55a4e11d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:12:54,425 INFO L341 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-04-29 11:12:54,428 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:12:54,428 INFO L116 PetriNetUnfolderBase]: 0/11 cut-off events. [2025-04-29 11:12:54,428 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:12:54,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:54,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:54,428 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:54,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:54,432 INFO L85 PathProgramCache]: Analyzing trace with hash -187317883, now seen corresponding path program 1 times [2025-04-29 11:12:54,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:54,437 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444138571] [2025-04-29 11:12:54,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:54,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:54,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-29 11:12:54,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-29 11:12:54,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:54,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:54,522 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-29 11:12:54,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:54,522 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444138571] [2025-04-29 11:12:54,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444138571] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:54,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:54,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:54,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456392996] [2025-04-29 11:12:54,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:54,528 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:54,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:54,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:54,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:54,569 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 158 [2025-04-29 11:12:54,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 158 transitions, 323 flow. Second operand has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:54,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:54,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 158 [2025-04-29 11:12:54,572 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:54,639 INFO L116 PetriNetUnfolderBase]: 3/216 cut-off events. [2025-04-29 11:12:54,640 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:12:54,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 244 conditions, 216 events. 3/216 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 433 event pairs, 0 based on Foata normal form. 4/193 useless extension candidates. Maximal degree in co-relation 126. Up to 22 conditions per place. [2025-04-29 11:12:54,642 INFO L140 encePairwiseOnDemand]: 145/158 looper letters, 13 selfloop transitions, 1 changer transitions 2/145 dead transitions. [2025-04-29 11:12:54,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 145 transitions, 325 flow [2025-04-29 11:12:54,645 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:54,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 419 transitions. [2025-04-29 11:12:54,658 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8839662447257384 [2025-04-29 11:12:54,659 INFO L175 Difference]: Start difference. First operand has 153 places, 158 transitions, 323 flow. Second operand 3 states and 419 transitions. [2025-04-29 11:12:54,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 145 transitions, 325 flow [2025-04-29 11:12:54,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 145 transitions, 325 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:54,669 INFO L231 Difference]: Finished difference. Result has 148 places, 143 transitions, 295 flow [2025-04-29 11:12:54,672 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=295, PETRI_PLACES=148, PETRI_TRANSITIONS=143} [2025-04-29 11:12:54,674 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -5 predicate places. [2025-04-29 11:12:54,674 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 143 transitions, 295 flow [2025-04-29 11:12:54,674 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.66666666666666) internal successors, (395), 3 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:54,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:54,674 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:54,675 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:12:54,676 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:54,677 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:54,677 INFO L85 PathProgramCache]: Analyzing trace with hash 1533501695, now seen corresponding path program 1 times [2025-04-29 11:12:54,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:54,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912827154] [2025-04-29 11:12:54,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:54,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:54,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:12:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:12:54,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:54,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:54,730 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-29 11:12:54,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:54,731 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912827154] [2025-04-29 11:12:54,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912827154] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:54,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:54,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:54,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143633596] [2025-04-29 11:12:54,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:54,732 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:54,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:54,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:54,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:54,760 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 158 [2025-04-29 11:12:54,760 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 143 transitions, 295 flow. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:54,760 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:54,761 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 158 [2025-04-29 11:12:54,761 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:54,800 INFO L116 PetriNetUnfolderBase]: 5/249 cut-off events. [2025-04-29 11:12:54,800 INFO L117 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-04-29 11:12:54,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 249 events. 5/249 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 550 event pairs, 2 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 257. Up to 16 conditions per place. [2025-04-29 11:12:54,802 INFO L140 encePairwiseOnDemand]: 155/158 looper letters, 9 selfloop transitions, 2 changer transitions 0/142 dead transitions. [2025-04-29 11:12:54,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 142 transitions, 315 flow [2025-04-29 11:12:54,802 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:54,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:54,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2025-04-29 11:12:54,803 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9050632911392406 [2025-04-29 11:12:54,803 INFO L175 Difference]: Start difference. First operand has 148 places, 143 transitions, 295 flow. Second operand 3 states and 429 transitions. [2025-04-29 11:12:54,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 142 transitions, 315 flow [2025-04-29 11:12:54,804 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 142 transitions, 314 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:12:54,805 INFO L231 Difference]: Finished difference. Result has 146 places, 142 transitions, 296 flow [2025-04-29 11:12:54,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=292, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=142, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=146, PETRI_TRANSITIONS=142} [2025-04-29 11:12:54,807 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -7 predicate places. [2025-04-29 11:12:54,807 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 142 transitions, 296 flow [2025-04-29 11:12:54,808 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:54,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:54,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:54,808 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:12:54,808 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:54,809 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:54,809 INFO L85 PathProgramCache]: Analyzing trace with hash 1073577543, now seen corresponding path program 1 times [2025-04-29 11:12:54,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:54,809 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438281605] [2025-04-29 11:12:54,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:54,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:54,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:12:54,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:12:54,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:54,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:54,873 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-29 11:12:54,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:54,874 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438281605] [2025-04-29 11:12:54,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438281605] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:54,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:54,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:54,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72171864] [2025-04-29 11:12:54,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:54,875 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:54,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:54,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:54,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:54,896 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 139 out of 158 [2025-04-29 11:12:54,896 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 142 transitions, 296 flow. Second operand has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:54,897 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:54,897 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 139 of 158 [2025-04-29 11:12:54,897 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:54,960 INFO L116 PetriNetUnfolderBase]: 7/245 cut-off events. [2025-04-29 11:12:54,960 INFO L117 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2025-04-29 11:12:54,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 245 events. 7/245 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 583 event pairs, 4 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 258. Up to 18 conditions per place. [2025-04-29 11:12:54,961 INFO L140 encePairwiseOnDemand]: 154/158 looper letters, 8 selfloop transitions, 1 changer transitions 0/139 dead transitions. [2025-04-29 11:12:54,961 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 139 transitions, 308 flow [2025-04-29 11:12:54,962 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:54,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:54,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 429 transitions. [2025-04-29 11:12:54,963 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9050632911392406 [2025-04-29 11:12:54,963 INFO L175 Difference]: Start difference. First operand has 146 places, 142 transitions, 296 flow. Second operand 3 states and 429 transitions. [2025-04-29 11:12:54,963 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 139 transitions, 308 flow [2025-04-29 11:12:54,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 139 transitions, 304 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:54,967 INFO L231 Difference]: Finished difference. Result has 143 places, 139 transitions, 288 flow [2025-04-29 11:12:54,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=288, PETRI_PLACES=143, PETRI_TRANSITIONS=139} [2025-04-29 11:12:54,968 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -10 predicate places. [2025-04-29 11:12:54,968 INFO L485 AbstractCegarLoop]: Abstraction has has 143 places, 139 transitions, 288 flow [2025-04-29 11:12:54,969 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.0) internal successors, (420), 3 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:54,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:54,969 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:54,969 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:12:54,969 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:54,970 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:54,972 INFO L85 PathProgramCache]: Analyzing trace with hash -67169686, now seen corresponding path program 1 times [2025-04-29 11:12:54,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:54,972 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196966986] [2025-04-29 11:12:54,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:54,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:54,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-29 11:12:54,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-29 11:12:54,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:54,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:55,027 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-29 11:12:55,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:55,027 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196966986] [2025-04-29 11:12:55,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196966986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:55,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:55,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:55,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842846898] [2025-04-29 11:12:55,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:55,028 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:55,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:55,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:55,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:55,045 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 158 [2025-04-29 11:12:55,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 139 transitions, 288 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:55,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:55,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 158 [2025-04-29 11:12:55,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:55,083 INFO L116 PetriNetUnfolderBase]: 8/327 cut-off events. [2025-04-29 11:12:55,083 INFO L117 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-04-29 11:12:55,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 360 conditions, 327 events. 8/327 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1003 event pairs, 2 based on Foata normal form. 1/297 useless extension candidates. Maximal degree in co-relation 344. Up to 18 conditions per place. [2025-04-29 11:12:55,085 INFO L140 encePairwiseOnDemand]: 152/158 looper letters, 7 selfloop transitions, 4 changer transitions 0/141 dead transitions. [2025-04-29 11:12:55,085 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 141 transitions, 314 flow [2025-04-29 11:12:55,085 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:55,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:55,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 439 transitions. [2025-04-29 11:12:55,087 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9261603375527426 [2025-04-29 11:12:55,087 INFO L175 Difference]: Start difference. First operand has 143 places, 139 transitions, 288 flow. Second operand 3 states and 439 transitions. [2025-04-29 11:12:55,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 141 transitions, 314 flow [2025-04-29 11:12:55,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 141 transitions, 313 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:12:55,091 INFO L231 Difference]: Finished difference. Result has 145 places, 141 transitions, 315 flow [2025-04-29 11:12:55,092 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=285, PETRI_DIFFERENCE_MINUEND_PLACES=141, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=315, PETRI_PLACES=145, PETRI_TRANSITIONS=141} [2025-04-29 11:12:55,093 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -8 predicate places. [2025-04-29 11:12:55,093 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 141 transitions, 315 flow [2025-04-29 11:12:55,094 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:55,094 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:55,094 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:55,094 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:12:55,094 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:55,095 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:55,095 INFO L85 PathProgramCache]: Analyzing trace with hash 752183525, now seen corresponding path program 1 times [2025-04-29 11:12:55,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:55,095 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830707464] [2025-04-29 11:12:55,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:55,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:55,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:12:55,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:12:55,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:55,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:55,142 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-29 11:12:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:55,142 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830707464] [2025-04-29 11:12:55,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830707464] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:55,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:55,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:55,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598934791] [2025-04-29 11:12:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:55,143 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:55,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:55,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:55,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:55,161 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 158 [2025-04-29 11:12:55,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 141 transitions, 315 flow. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:55,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:55,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 158 [2025-04-29 11:12:55,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:55,194 INFO L116 PetriNetUnfolderBase]: 9/378 cut-off events. [2025-04-29 11:12:55,195 INFO L117 PetriNetUnfolderBase]: For 31/35 co-relation queries the response was YES. [2025-04-29 11:12:55,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 461 conditions, 378 events. 9/378 cut-off events. For 31/35 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1361 event pairs, 2 based on Foata normal form. 0/346 useless extension candidates. Maximal degree in co-relation 443. Up to 29 conditions per place. [2025-04-29 11:12:55,197 INFO L140 encePairwiseOnDemand]: 153/158 looper letters, 12 selfloop transitions, 4 changer transitions 0/144 dead transitions. [2025-04-29 11:12:55,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 144 transitions, 357 flow [2025-04-29 11:12:55,197 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:55,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:55,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 435 transitions. [2025-04-29 11:12:55,199 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9177215189873418 [2025-04-29 11:12:55,199 INFO L175 Difference]: Start difference. First operand has 145 places, 141 transitions, 315 flow. Second operand 3 states and 435 transitions. [2025-04-29 11:12:55,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 144 transitions, 357 flow [2025-04-29 11:12:55,200 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 144 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:55,202 INFO L231 Difference]: Finished difference. Result has 147 places, 144 transitions, 339 flow [2025-04-29 11:12:55,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=339, PETRI_PLACES=147, PETRI_TRANSITIONS=144} [2025-04-29 11:12:55,202 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -6 predicate places. [2025-04-29 11:12:55,203 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 144 transitions, 339 flow [2025-04-29 11:12:55,203 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:55,203 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:55,203 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:55,203 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:12:55,204 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:55,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:55,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1530285811, now seen corresponding path program 1 times [2025-04-29 11:12:55,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:55,204 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089442568] [2025-04-29 11:12:55,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:55,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:55,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-04-29 11:12:55,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-04-29 11:12:55,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:55,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:55,308 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-29 11:12:55,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:55,309 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089442568] [2025-04-29 11:12:55,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089442568] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:55,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:55,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:12:55,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179296268] [2025-04-29 11:12:55,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:55,309 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:12:55,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:55,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:12:55,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:12:55,391 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 158 [2025-04-29 11:12:55,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 144 transitions, 339 flow. Second operand has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:55,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:55,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 158 [2025-04-29 11:12:55,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:55,414 INFO L116 PetriNetUnfolderBase]: 5/270 cut-off events. [2025-04-29 11:12:55,414 INFO L117 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-04-29 11:12:55,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 270 events. 5/270 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 788 event pairs, 0 based on Foata normal form. 2/256 useless extension candidates. Maximal degree in co-relation 327. Up to 15 conditions per place. [2025-04-29 11:12:55,415 INFO L140 encePairwiseOnDemand]: 151/158 looper letters, 8 selfloop transitions, 5 changer transitions 14/144 dead transitions. [2025-04-29 11:12:55,416 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 144 transitions, 369 flow [2025-04-29 11:12:55,416 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:12:55,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:12:55,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 561 transitions. [2025-04-29 11:12:55,417 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8876582278481012 [2025-04-29 11:12:55,417 INFO L175 Difference]: Start difference. First operand has 147 places, 144 transitions, 339 flow. Second operand 4 states and 561 transitions. [2025-04-29 11:12:55,417 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 144 transitions, 369 flow [2025-04-29 11:12:55,418 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 144 transitions, 361 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:55,419 INFO L231 Difference]: Finished difference. Result has 149 places, 130 transitions, 321 flow [2025-04-29 11:12:55,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=331, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=144, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=321, PETRI_PLACES=149, PETRI_TRANSITIONS=130} [2025-04-29 11:12:55,420 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -4 predicate places. [2025-04-29 11:12:55,420 INFO L485 AbstractCegarLoop]: Abstraction has has 149 places, 130 transitions, 321 flow [2025-04-29 11:12:55,420 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 137.5) internal successors, (550), 4 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:55,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:55,420 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:55,420 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:12:55,421 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:55,421 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:55,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1254289424, now seen corresponding path program 1 times [2025-04-29 11:12:55,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:55,421 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475020803] [2025-04-29 11:12:55,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:55,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:55,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 60 statements into 1 equivalence classes. [2025-04-29 11:12:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 60 of 60 statements. [2025-04-29 11:12:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:55,438 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:55,803 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-29 11:12:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:55,804 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475020803] [2025-04-29 11:12:55,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475020803] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:55,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:55,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:55,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613914844] [2025-04-29 11:12:55,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:55,804 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:55,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:55,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:55,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:55,960 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 158 [2025-04-29 11:12:55,960 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 130 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:55,960 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:55,960 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 158 [2025-04-29 11:12:55,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:56,075 INFO L116 PetriNetUnfolderBase]: 124/600 cut-off events. [2025-04-29 11:12:56,075 INFO L117 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2025-04-29 11:12:56,076 INFO L83 FinitePrefix]: Finished finitePrefix Result has 996 conditions, 600 events. 124/600 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3062 event pairs, 42 based on Foata normal form. 0/552 useless extension candidates. Maximal degree in co-relation 973. Up to 253 conditions per place. [2025-04-29 11:12:56,078 INFO L140 encePairwiseOnDemand]: 147/158 looper letters, 32 selfloop transitions, 22 changer transitions 0/151 dead transitions. [2025-04-29 11:12:56,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 151 transitions, 471 flow [2025-04-29 11:12:56,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:56,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 757 transitions. [2025-04-29 11:12:56,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7985232067510548 [2025-04-29 11:12:56,080 INFO L175 Difference]: Start difference. First operand has 149 places, 130 transitions, 321 flow. Second operand 6 states and 757 transitions. [2025-04-29 11:12:56,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 151 transitions, 471 flow [2025-04-29 11:12:56,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 151 transitions, 461 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:12:56,084 INFO L231 Difference]: Finished difference. Result has 142 places, 151 transitions, 461 flow [2025-04-29 11:12:56,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=311, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=461, PETRI_PLACES=142, PETRI_TRANSITIONS=151} [2025-04-29 11:12:56,084 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -11 predicate places. [2025-04-29 11:12:56,085 INFO L485 AbstractCegarLoop]: Abstraction has has 142 places, 151 transitions, 461 flow [2025-04-29 11:12:56,085 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 118.83333333333333) internal successors, (713), 6 states have internal predecessors, (713), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:56,085 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:56,085 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:56,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:12:56,085 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:56,086 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:56,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1166541102, now seen corresponding path program 1 times [2025-04-29 11:12:56,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:56,086 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147643705] [2025-04-29 11:12:56,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:56,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:56,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:12:56,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:12:56,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:56,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:56,395 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-29 11:12:56,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:56,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147643705] [2025-04-29 11:12:56,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147643705] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:56,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:56,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:12:56,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508787219] [2025-04-29 11:12:56,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:56,396 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:56,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:56,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:56,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:56,490 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 158 [2025-04-29 11:12:56,491 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 151 transitions, 461 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:56,491 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:56,491 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 158 [2025-04-29 11:12:56,491 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:56,658 INFO L116 PetriNetUnfolderBase]: 226/870 cut-off events. [2025-04-29 11:12:56,658 INFO L117 PetriNetUnfolderBase]: For 277/324 co-relation queries the response was YES. [2025-04-29 11:12:56,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2038 conditions, 870 events. 226/870 cut-off events. For 277/324 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 5076 event pairs, 24 based on Foata normal form. 0/825 useless extension candidates. Maximal degree in co-relation 2013. Up to 404 conditions per place. [2025-04-29 11:12:56,666 INFO L140 encePairwiseOnDemand]: 142/158 looper letters, 40 selfloop transitions, 52 changer transitions 0/198 dead transitions. [2025-04-29 11:12:56,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 198 transitions, 809 flow [2025-04-29 11:12:56,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:12:56,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:12:56,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 818 transitions. [2025-04-29 11:12:56,668 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8628691983122363 [2025-04-29 11:12:56,668 INFO L175 Difference]: Start difference. First operand has 142 places, 151 transitions, 461 flow. Second operand 6 states and 818 transitions. [2025-04-29 11:12:56,668 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 198 transitions, 809 flow [2025-04-29 11:12:56,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 198 transitions, 809 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:12:56,674 INFO L231 Difference]: Finished difference. Result has 152 places, 198 transitions, 875 flow [2025-04-29 11:12:56,675 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=151, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=875, PETRI_PLACES=152, PETRI_TRANSITIONS=198} [2025-04-29 11:12:56,675 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -1 predicate places. [2025-04-29 11:12:56,676 INFO L485 AbstractCegarLoop]: Abstraction has has 152 places, 198 transitions, 875 flow [2025-04-29 11:12:56,677 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:56,677 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:56,677 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:56,677 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:12:56,677 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:56,678 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:56,678 INFO L85 PathProgramCache]: Analyzing trace with hash 1754848375, now seen corresponding path program 1 times [2025-04-29 11:12:56,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:56,678 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329942726] [2025-04-29 11:12:56,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:56,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:56,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-04-29 11:12:56,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-04-29 11:12:56,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:56,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:56,801 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-29 11:12:56,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:56,801 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329942726] [2025-04-29 11:12:56,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329942726] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:56,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:56,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:12:56,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016356152] [2025-04-29 11:12:56,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:56,801 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:56,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:56,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:56,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:56,922 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 158 [2025-04-29 11:12:56,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 198 transitions, 875 flow. Second operand has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:56,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:56,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 158 [2025-04-29 11:12:56,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:57,005 INFO L116 PetriNetUnfolderBase]: 163/680 cut-off events. [2025-04-29 11:12:57,006 INFO L117 PetriNetUnfolderBase]: For 541/588 co-relation queries the response was YES. [2025-04-29 11:12:57,008 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1832 conditions, 680 events. 163/680 cut-off events. For 541/588 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3821 event pairs, 7 based on Foata normal form. 1/676 useless extension candidates. Maximal degree in co-relation 1801. Up to 144 conditions per place. [2025-04-29 11:12:57,010 INFO L140 encePairwiseOnDemand]: 152/158 looper letters, 3 selfloop transitions, 5 changer transitions 0/145 dead transitions. [2025-04-29 11:12:57,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 145 transitions, 704 flow [2025-04-29 11:12:57,010 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:12:57,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:12:57,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 947 transitions. [2025-04-29 11:12:57,012 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.85623869801085 [2025-04-29 11:12:57,012 INFO L175 Difference]: Start difference. First operand has 152 places, 198 transitions, 875 flow. Second operand 7 states and 947 transitions. [2025-04-29 11:12:57,012 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 145 transitions, 704 flow [2025-04-29 11:12:57,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 145 transitions, 684 flow, removed 9 selfloop flow, removed 1 redundant places. [2025-04-29 11:12:57,019 INFO L231 Difference]: Finished difference. Result has 122 places, 145 transitions, 678 flow [2025-04-29 11:12:57,019 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=158, PETRI_DIFFERENCE_MINUEND_FLOW=668, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=678, PETRI_PLACES=122, PETRI_TRANSITIONS=145} [2025-04-29 11:12:57,019 INFO L279 CegarLoopForPetriNet]: 153 programPoint places, -31 predicate places. [2025-04-29 11:12:57,020 INFO L485 AbstractCegarLoop]: Abstraction has has 122 places, 145 transitions, 678 flow [2025-04-29 11:12:57,020 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 135.66666666666666) internal successors, (814), 6 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:57,020 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:57,020 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:57,020 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:12:57,020 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting threadErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-29 11:12:57,021 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:57,021 INFO L85 PathProgramCache]: Analyzing trace with hash 402824076, now seen corresponding path program 1 times [2025-04-29 11:12:57,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:57,021 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844616133] [2025-04-29 11:12:57,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:57,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:57,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-29 11:12:57,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-29 11:12:57,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:57,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:57,038 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:12:57,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-04-29 11:12:57,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-04-29 11:12:57,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:57,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:12:57,071 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:12:57,071 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:12:57,072 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2025-04-29 11:12:57,073 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-04-29 11:12:57,074 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-04-29 11:12:57,075 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-04-29 11:12:57,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:12:57,075 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:57,125 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:12:57,125 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:12:57,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:12:57 BasicIcfg [2025-04-29 11:12:57,128 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:12:57,129 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:12:57,129 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:12:57,129 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:12:57,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:12:54" (3/4) ... [2025-04-29 11:12:57,130 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:12:57,170 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 9. [2025-04-29 11:12:57,213 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:12:57,213 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:12:57,213 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:12:57,213 INFO L158 Benchmark]: Toolchain (without parser) took 3591.42ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 90.1MB in the end (delta: 64.6MB). Peak memory consumption was 59.6MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,215 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:57,216 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.17ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 140.5MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,216 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.79ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 138.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:57,216 INFO L158 Benchmark]: Boogie Preprocessor took 19.60ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 137.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:57,217 INFO L158 Benchmark]: RCFGBuilder took 319.40ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 118.9MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,217 INFO L158 Benchmark]: TraceAbstraction took 2896.69ms. Allocated memory is still 201.3MB. Free memory was 118.2MB in the beginning and 99.0MB in the end (delta: 19.2MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,217 INFO L158 Benchmark]: Witness Printer took 84.25ms. Allocated memory is still 201.3MB. Free memory was 99.0MB in the beginning and 90.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:57,218 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.25ms. Allocated memory is still 201.3MB. Free memory is still 118.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.17ms. Allocated memory is still 201.3MB. Free memory was 154.7MB in the beginning and 140.5MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.79ms. Allocated memory is still 201.3MB. Free memory was 140.5MB in the beginning and 138.5MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.60ms. Allocated memory is still 201.3MB. Free memory was 138.5MB in the beginning and 137.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 319.40ms. Allocated memory is still 201.3MB. Free memory was 137.0MB in the beginning and 118.9MB in the end (delta: 18.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2896.69ms. Allocated memory is still 201.3MB. Free memory was 118.2MB in the beginning and 99.0MB in the end (delta: 19.2MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Witness Printer took 84.25ms. Allocated memory is still 201.3MB. Free memory was 99.0MB in the beginning and 90.1MB in the end (delta: 8.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 31]: Data race detected Data race detected The following path leads to a data race: [L23] 0 const int SIGMA = 16; VAL [SIGMA=16] [L25] 0 int *array; VAL [SIGMA=16, array={0:0}] [L26] 0 int array_index=-1; VAL [SIGMA=16, array={0:0}, array_index=-1] [L38] 0 int tid, sum; VAL [SIGMA=16, array={0:0}, array_index=-1] [L39] 0 pthread_t *t; VAL [SIGMA=16, array={0:0}, array_index=-1] [L41] EXPR 0 sizeof(pthread_t) * SIGMA VAL [SIGMA=16, array={0:0}, array_index=-1] [L41] 0 t = (pthread_t *)malloc(sizeof(pthread_t) * SIGMA) VAL [SIGMA=16, array={0:0}, array_index=-1, t={1:0}] [L42] EXPR 0 sizeof(int) * SIGMA VAL [SIGMA=16, array={0:0}, array_index=-1, t={1:0}] [L42] 0 array = (int *)malloc(sizeof(int) * SIGMA) VAL [SIGMA=16, array={4:0}, array_index=-1, t={1:0}] [L44] CALL 0 assume_abort_if_not(t) [L11] COND FALSE 0 !(!cond) VAL [SIGMA=16, \at(cond, Pre)=1, array={4:0}, array_index=-1, cond=1] [L44] RET 0 assume_abort_if_not(t) [L45] 0 assume_abort_if_not(array) [L45] CALL 0 assume_abort_if_not(array) [L11] COND FALSE 0 !(!cond) VAL [SIGMA=16, \at(cond, Pre)=4, array={4:0}, array_index=-1, cond=4] [L45] RET 0 assume_abort_if_not(array) [L47] 0 tid=0 VAL [SIGMA=16, array={4:0}, array_index=-1, t={1:0}, tid=0] [L47] 0 tid