./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:46:06,235 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:46:06,328 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-11 16:46:06,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:46:06,336 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:46:06,365 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:46:06,365 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:46:06,366 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:46:06,366 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:46:06,370 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:46:06,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:46:06,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:46:06,371 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:46:06,371 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:46:06,371 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:46:06,371 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:46:06,372 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:46:06,372 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:46:06,372 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:46:06,372 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:46:06,372 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:46:06,374 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:46:06,374 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-11 16:46:06,375 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:46:06,375 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 16:46:06,375 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:46:06,375 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:46:06,376 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:46:06,376 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:46:06,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:46:06,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:46:06,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:46:06,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:46:06,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:46:06,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:46:06,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:46:06,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:46:06,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:46:06,379 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:46:06,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:46:06,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:46:06,380 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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-clean/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 -> 8495a4f5aea7cc78cc34cbe091df9506d17978f2685019ca49cb76f0e1f4a919 [2024-10-11 16:46:06,635 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:46:06,662 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:46:06,665 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:46:06,666 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:46:06,667 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:46:06,668 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b.i [2024-10-11 16:46:08,087 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:46:08,313 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:46:08,314 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b.i [2024-10-11 16:46:08,331 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/166d7916e/ee7dcf8957f34036b5ec71616832922c/FLAG7a1023c20 [2024-10-11 16:46:08,644 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/166d7916e/ee7dcf8957f34036b5ec71616832922c [2024-10-11 16:46:08,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:46:08,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:46:08,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:46:08,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:46:08,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:46:08,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:46:08" (1/1) ... [2024-10-11 16:46:08,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7b4483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:08, skipping insertion in model container [2024-10-11 16:46:08,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:46:08" (1/1) ... [2024-10-11 16:46:08,706 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:46:09,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:46:09,082 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:46:09,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:46:09,168 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:46:09,168 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09 WrapperNode [2024-10-11 16:46:09,168 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:46:09,169 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:46:09,171 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:46:09,171 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:46:09,176 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,192 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,221 INFO L138 Inliner]: procedures = 167, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 154 [2024-10-11 16:46:09,222 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:46:09,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:46:09,223 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:46:09,223 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:46:09,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,238 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,238 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,249 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,252 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,259 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,261 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:46:09,263 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:46:09,263 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:46:09,263 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:46:09,264 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (1/1) ... [2024-10-11 16:46:09,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:46:09,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:46:09,296 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:46:09,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:46:09,340 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-11 16:46:09,340 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-11 16:46:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-11 16:46:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-11 16:46:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:46:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-11 16:46:09,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:46:09,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:46:09,343 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-11 16:46:09,450 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:46:09,451 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:46:09,662 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-11 16:46:09,662 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:46:09,676 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:46:09,676 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-11 16:46:09,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:46:09 BoogieIcfgContainer [2024-10-11 16:46:09,677 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:46:09,678 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:46:09,679 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:46:09,683 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:46:09,683 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:46:08" (1/3) ... [2024-10-11 16:46:09,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff1b7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:46:09, skipping insertion in model container [2024-10-11 16:46:09,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:46:09" (2/3) ... [2024-10-11 16:46:09,687 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff1b7ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:46:09, skipping insertion in model container [2024-10-11 16:46:09,687 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:46:09" (3/3) ... [2024-10-11 16:46:09,688 INFO L112 eAbstractionObserver]: Analyzing ICFG dekker-b.i [2024-10-11 16:46:09,701 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:46:09,701 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2024-10-11 16:46:09,701 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-11 16:46:09,786 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-11 16:46:09,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 178 places, 187 transitions, 388 flow [2024-10-11 16:46:09,906 INFO L124 PetriNetUnfolderBase]: 16/185 cut-off events. [2024-10-11 16:46:09,907 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-11 16:46:09,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 194 conditions, 185 events. 16/185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 453 event pairs, 0 based on Foata normal form. 0/147 useless extension candidates. Maximal degree in co-relation 144. Up to 3 conditions per place. [2024-10-11 16:46:09,916 INFO L82 GeneralOperation]: Start removeDead. Operand has 178 places, 187 transitions, 388 flow [2024-10-11 16:46:09,924 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 171 places, 180 transitions, 369 flow [2024-10-11 16:46:09,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:46:09,945 INFO L333 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;@429f1f5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:46:09,945 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2024-10-11 16:46:09,949 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-11 16:46:09,949 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2024-10-11 16:46:09,949 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-11 16:46:09,949 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:09,950 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:46:09,951 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:09,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:09,956 INFO L85 PathProgramCache]: Analyzing trace with hash -668289511, now seen corresponding path program 1 times [2024-10-11 16:46:09,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:09,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143928687] [2024-10-11 16:46:09,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:09,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:10,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:10,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:10,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143928687] [2024-10-11 16:46:10,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143928687] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:10,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:10,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:46:10,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827583478] [2024-10-11 16:46:10,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:10,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:46:10,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:10,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:46:10,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:46:10,304 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 187 [2024-10-11 16:46:10,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 180 transitions, 369 flow. Second operand has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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) [2024-10-11 16:46:10,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:10,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 187 [2024-10-11 16:46:10,309 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:10,518 INFO L124 PetriNetUnfolderBase]: 98/790 cut-off events. [2024-10-11 16:46:10,519 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2024-10-11 16:46:10,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 964 conditions, 790 events. 98/790 cut-off events. For 43/43 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 4934 event pairs, 23 based on Foata normal form. 67/688 useless extension candidates. Maximal degree in co-relation 812. Up to 99 conditions per place. [2024-10-11 16:46:10,536 INFO L140 encePairwiseOnDemand]: 161/187 looper letters, 22 selfloop transitions, 11 changer transitions 1/177 dead transitions. [2024-10-11 16:46:10,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 435 flow [2024-10-11 16:46:10,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:46:10,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:46:10,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-10-11 16:46:10,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126559714795008 [2024-10-11 16:46:10,604 INFO L175 Difference]: Start difference. First operand has 171 places, 180 transitions, 369 flow. Second operand 3 states and 512 transitions. [2024-10-11 16:46:10,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 435 flow [2024-10-11 16:46:10,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 177 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-11 16:46:10,626 INFO L231 Difference]: Finished difference. Result has 166 places, 174 transitions, 424 flow [2024-10-11 16:46:10,629 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=424, PETRI_PLACES=166, PETRI_TRANSITIONS=174} [2024-10-11 16:46:10,641 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, -5 predicate places. [2024-10-11 16:46:10,642 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 174 transitions, 424 flow [2024-10-11 16:46:10,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.66666666666666) internal successors, (458), 3 states have internal predecessors, (458), 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) [2024-10-11 16:46:10,642 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:10,642 INFO L204 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] [2024-10-11 16:46:10,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:46:10,643 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:10,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:10,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1878226010, now seen corresponding path program 1 times [2024-10-11 16:46:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:10,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004473240] [2024-10-11 16:46:10,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:10,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:10,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:10,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:10,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004473240] [2024-10-11 16:46:10,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004473240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:10,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:10,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:46:10,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32003193] [2024-10-11 16:46:10,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:10,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:46:10,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:10,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:46:10,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:46:10,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 187 [2024-10-11 16:46:10,922 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 174 transitions, 424 flow. Second operand has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 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) [2024-10-11 16:46:10,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:10,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 187 [2024-10-11 16:46:10,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:11,042 INFO L124 PetriNetUnfolderBase]: 73/668 cut-off events. [2024-10-11 16:46:11,042 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2024-10-11 16:46:11,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 873 conditions, 668 events. 73/668 cut-off events. For 40/40 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4118 event pairs, 15 based on Foata normal form. 6/550 useless extension candidates. Maximal degree in co-relation 795. Up to 62 conditions per place. [2024-10-11 16:46:11,049 INFO L140 encePairwiseOnDemand]: 176/187 looper letters, 14 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2024-10-11 16:46:11,049 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 177 transitions, 474 flow [2024-10-11 16:46:11,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:46:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-11 16:46:11,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2024-10-11 16:46:11,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8676470588235294 [2024-10-11 16:46:11,058 INFO L175 Difference]: Start difference. First operand has 166 places, 174 transitions, 424 flow. Second operand 4 states and 649 transitions. [2024-10-11 16:46:11,058 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 177 transitions, 474 flow [2024-10-11 16:46:11,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 177 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:46:11,065 INFO L231 Difference]: Finished difference. Result has 168 places, 176 transitions, 444 flow [2024-10-11 16:46:11,067 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=166, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=444, PETRI_PLACES=168, PETRI_TRANSITIONS=176} [2024-10-11 16:46:11,067 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, -3 predicate places. [2024-10-11 16:46:11,068 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 176 transitions, 444 flow [2024-10-11 16:46:11,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.5) internal successors, (630), 4 states have internal predecessors, (630), 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) [2024-10-11 16:46:11,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:11,068 INFO L204 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] [2024-10-11 16:46:11,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:46:11,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:11,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:11,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1248550256, now seen corresponding path program 1 times [2024-10-11 16:46:11,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:11,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309440835] [2024-10-11 16:46:11,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:11,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:11,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:11,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:11,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:11,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309440835] [2024-10-11 16:46:11,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309440835] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:11,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:11,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:46:11,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73600448] [2024-10-11 16:46:11,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:11,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:46:11,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:11,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:46:11,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:46:11,160 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-10-11 16:46:11,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 176 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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) [2024-10-11 16:46:11,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:11,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-10-11 16:46:11,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:11,255 INFO L124 PetriNetUnfolderBase]: 61/754 cut-off events. [2024-10-11 16:46:11,255 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-11 16:46:11,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 754 events. 61/754 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 4707 event pairs, 18 based on Foata normal form. 0/621 useless extension candidates. Maximal degree in co-relation 847. Up to 66 conditions per place. [2024-10-11 16:46:11,263 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 12 selfloop transitions, 4 changer transitions 0/180 dead transitions. [2024-10-11 16:46:11,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 180 transitions, 486 flow [2024-10-11 16:46:11,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:46:11,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:46:11,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-10-11 16:46:11,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2024-10-11 16:46:11,267 INFO L175 Difference]: Start difference. First operand has 168 places, 176 transitions, 444 flow. Second operand 3 states and 506 transitions. [2024-10-11 16:46:11,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 180 transitions, 486 flow [2024-10-11 16:46:11,272 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 180 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-11 16:46:11,275 INFO L231 Difference]: Finished difference. Result has 171 places, 179 transitions, 472 flow [2024-10-11 16:46:11,275 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=167, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=172, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=171, PETRI_TRANSITIONS=179} [2024-10-11 16:46:11,277 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 0 predicate places. [2024-10-11 16:46:11,277 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 179 transitions, 472 flow [2024-10-11 16:46:11,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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) [2024-10-11 16:46:11,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:11,279 INFO L204 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] [2024-10-11 16:46:11,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:46:11,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:11,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:11,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1143351916, now seen corresponding path program 1 times [2024-10-11 16:46:11,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:11,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608716123] [2024-10-11 16:46:11,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:11,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:11,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:11,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:11,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608716123] [2024-10-11 16:46:11,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608716123] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:11,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:11,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:46:11,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823100534] [2024-10-11 16:46:11,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:11,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:46:11,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:11,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:46:11,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:46:11,360 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-10-11 16:46:11,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 179 transitions, 472 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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) [2024-10-11 16:46:11,383 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:11,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-10-11 16:46:11,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:11,570 INFO L124 PetriNetUnfolderBase]: 143/1342 cut-off events. [2024-10-11 16:46:11,570 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2024-10-11 16:46:11,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1793 conditions, 1342 events. 143/1342 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 11013 event pairs, 20 based on Foata normal form. 0/1106 useless extension candidates. Maximal degree in co-relation 1686. Up to 125 conditions per place. [2024-10-11 16:46:11,580 INFO L140 encePairwiseOnDemand]: 180/187 looper letters, 12 selfloop transitions, 6 changer transitions 0/187 dead transitions. [2024-10-11 16:46:11,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 187 transitions, 527 flow [2024-10-11 16:46:11,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:46:11,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:46:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-10-11 16:46:11,582 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9162210338680927 [2024-10-11 16:46:11,583 INFO L175 Difference]: Start difference. First operand has 171 places, 179 transitions, 472 flow. Second operand 3 states and 514 transitions. [2024-10-11 16:46:11,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 187 transitions, 527 flow [2024-10-11 16:46:11,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 187 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:46:11,588 INFO L231 Difference]: Finished difference. Result has 173 places, 185 transitions, 514 flow [2024-10-11 16:46:11,588 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=169, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=173, PETRI_TRANSITIONS=185} [2024-10-11 16:46:11,589 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 2 predicate places. [2024-10-11 16:46:11,589 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 185 transitions, 514 flow [2024-10-11 16:46:11,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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) [2024-10-11 16:46:11,590 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:11,590 INFO L204 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] [2024-10-11 16:46:11,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:46:11,591 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:11,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:11,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1112685949, now seen corresponding path program 1 times [2024-10-11 16:46:11,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:11,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281818268] [2024-10-11 16:46:11,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:11,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:11,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:11,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281818268] [2024-10-11 16:46:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281818268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:46:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401088455] [2024-10-11 16:46:11,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:11,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:46:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:11,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:46:11,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:46:11,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 187 [2024-10-11 16:46:11,655 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 185 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2024-10-11 16:46:11,656 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:11,656 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 187 [2024-10-11 16:46:11,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:11,804 INFO L124 PetriNetUnfolderBase]: 182/1457 cut-off events. [2024-10-11 16:46:11,805 INFO L125 PetriNetUnfolderBase]: For 238/255 co-relation queries the response was YES. [2024-10-11 16:46:11,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2134 conditions, 1457 events. 182/1457 cut-off events. For 238/255 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 12032 event pairs, 29 based on Foata normal form. 0/1200 useless extension candidates. Maximal degree in co-relation 1203. Up to 139 conditions per place. [2024-10-11 16:46:11,816 INFO L140 encePairwiseOnDemand]: 182/187 looper letters, 16 selfloop transitions, 6 changer transitions 0/190 dead transitions. [2024-10-11 16:46:11,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 190 transitions, 575 flow [2024-10-11 16:46:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:46:11,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:46:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-10-11 16:46:11,818 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9019607843137255 [2024-10-11 16:46:11,818 INFO L175 Difference]: Start difference. First operand has 173 places, 185 transitions, 514 flow. Second operand 3 states and 506 transitions. [2024-10-11 16:46:11,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 190 transitions, 575 flow [2024-10-11 16:46:11,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 190 transitions, 561 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:46:11,823 INFO L231 Difference]: Finished difference. Result has 175 places, 189 transitions, 548 flow [2024-10-11 16:46:11,824 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=171, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=185, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=548, PETRI_PLACES=175, PETRI_TRANSITIONS=189} [2024-10-11 16:46:11,825 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 4 predicate places. [2024-10-11 16:46:11,825 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 189 transitions, 548 flow [2024-10-11 16:46:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.66666666666666) internal successors, (494), 3 states have internal predecessors, (494), 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) [2024-10-11 16:46:11,825 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:11,826 INFO L204 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] [2024-10-11 16:46:11,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:46:11,826 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:11,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:11,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1474790138, now seen corresponding path program 1 times [2024-10-11 16:46:11,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:11,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963294126] [2024-10-11 16:46:11,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:11,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:11,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:11,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:11,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963294126] [2024-10-11 16:46:11,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963294126] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:11,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:11,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:46:11,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91118781] [2024-10-11 16:46:11,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:11,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:46:11,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:11,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:46:11,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:46:11,890 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-10-11 16:46:11,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 189 transitions, 548 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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) [2024-10-11 16:46:11,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:11,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-10-11 16:46:11,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:12,137 INFO L124 PetriNetUnfolderBase]: 205/1715 cut-off events. [2024-10-11 16:46:12,138 INFO L125 PetriNetUnfolderBase]: For 115/118 co-relation queries the response was YES. [2024-10-11 16:46:12,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2470 conditions, 1715 events. 205/1715 cut-off events. For 115/118 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 15105 event pairs, 41 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1934. Up to 150 conditions per place. [2024-10-11 16:46:12,150 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 11 selfloop transitions, 5 changer transitions 0/194 dead transitions. [2024-10-11 16:46:12,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 194 transitions, 592 flow [2024-10-11 16:46:12,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:46:12,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:46:12,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2024-10-11 16:46:12,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9073083778966132 [2024-10-11 16:46:12,153 INFO L175 Difference]: Start difference. First operand has 175 places, 189 transitions, 548 flow. Second operand 3 states and 509 transitions. [2024-10-11 16:46:12,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 194 transitions, 592 flow [2024-10-11 16:46:12,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:46:12,158 INFO L231 Difference]: Finished difference. Result has 177 places, 193 transitions, 574 flow [2024-10-11 16:46:12,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=574, PETRI_PLACES=177, PETRI_TRANSITIONS=193} [2024-10-11 16:46:12,159 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 6 predicate places. [2024-10-11 16:46:12,160 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 193 transitions, 574 flow [2024-10-11 16:46:12,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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) [2024-10-11 16:46:12,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:12,161 INFO L204 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] [2024-10-11 16:46:12,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:46:12,161 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:12,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:12,163 INFO L85 PathProgramCache]: Analyzing trace with hash -530009180, now seen corresponding path program 1 times [2024-10-11 16:46:12,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:12,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516032946] [2024-10-11 16:46:12,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:12,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:12,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:12,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:12,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516032946] [2024-10-11 16:46:12,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516032946] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:12,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:12,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:46:12,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996431103] [2024-10-11 16:46:12,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:12,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:46:12,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:12,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:46:12,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:46:12,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 187 [2024-10-11 16:46:12,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 193 transitions, 574 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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) [2024-10-11 16:46:12,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:12,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 187 [2024-10-11 16:46:12,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:12,377 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L709-->L709-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][135], [Black: 188#(= ~turn~0 0), Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, 209#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 40#L702-2true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 138#L709-1true, Black: 181#true, 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,378 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:46:12,378 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,378 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,378 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][101], [Black: 188#(= ~turn~0 0), Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, 209#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 40#L702-2true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 183#(= |#race~turn~0| 0), 138#L709-1true, 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,389 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:46:12,389 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,389 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,389 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,400 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L709-2-->L709-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][128], [Black: 188#(= ~turn~0 0), 24#L702true, Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, 209#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 28#L709-4true, Black: 181#true, 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,400 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:46:12,400 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,400 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,400 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][101], [120#L709-2true, Black: 188#(= ~turn~0 0), Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, 209#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 40#L702-2true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 183#(= |#race~turn~0| 0), 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,401 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-10-11 16:46:12,401 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-10-11 16:46:12,401 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-10-11 16:46:12,401 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-10-11 16:46:12,402 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L703-2-->L703-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork0_#t~nondet8#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][148], [Black: 188#(= ~turn~0 0), 114#L703-3true, Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, 152#L708-2true, 209#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 214#true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 183#(= |#race~turn~0| 0)]) [2024-10-11 16:46:12,403 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-11 16:46:12,403 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-10-11 16:46:12,403 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-10-11 16:46:12,403 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-10-11 16:46:12,546 INFO L124 PetriNetUnfolderBase]: 328/2555 cut-off events. [2024-10-11 16:46:12,546 INFO L125 PetriNetUnfolderBase]: For 212/221 co-relation queries the response was YES. [2024-10-11 16:46:12,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3796 conditions, 2555 events. 328/2555 cut-off events. For 212/221 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 25251 event pairs, 42 based on Foata normal form. 2/2106 useless extension candidates. Maximal degree in co-relation 3672. Up to 221 conditions per place. [2024-10-11 16:46:12,562 INFO L140 encePairwiseOnDemand]: 181/187 looper letters, 11 selfloop transitions, 6 changer transitions 0/199 dead transitions. [2024-10-11 16:46:12,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 625 flow [2024-10-11 16:46:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:46:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:46:12,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2024-10-11 16:46:12,565 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9126559714795008 [2024-10-11 16:46:12,565 INFO L175 Difference]: Start difference. First operand has 177 places, 193 transitions, 574 flow. Second operand 3 states and 512 transitions. [2024-10-11 16:46:12,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 625 flow [2024-10-11 16:46:12,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 199 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:46:12,571 INFO L231 Difference]: Finished difference. Result has 179 places, 198 transitions, 614 flow [2024-10-11 16:46:12,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=179, PETRI_TRANSITIONS=198} [2024-10-11 16:46:12,572 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 8 predicate places. [2024-10-11 16:46:12,572 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 198 transitions, 614 flow [2024-10-11 16:46:12,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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) [2024-10-11 16:46:12,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:12,574 INFO L204 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] [2024-10-11 16:46:12,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:46:12,574 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:12,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:12,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2041878789, now seen corresponding path program 1 times [2024-10-11 16:46:12,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:12,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072495223] [2024-10-11 16:46:12,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:12,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:46:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:46:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:46:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072495223] [2024-10-11 16:46:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072495223] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:46:12,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:46:12,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:46:12,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293085408] [2024-10-11 16:46:12,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:46:12,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:46:12,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:46:12,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:46:12,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:46:12,640 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 187 [2024-10-11 16:46:12,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 198 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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) [2024-10-11 16:46:12,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-11 16:46:12,642 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 187 [2024-10-11 16:46:12,642 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-11 16:46:12,783 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([457] L709-->L709-1: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][139], [Black: 188#(= ~turn~0 0), Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 40#L702-2true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 221#(= |#race~x~0| 0), 138#L709-1true, Black: 214#true, Black: 181#true, 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,783 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:46:12,784 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,784 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,784 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,795 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][101], [Black: 188#(= ~turn~0 0), Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 40#L702-2true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 138#L709-1true, Black: 183#(= |#race~turn~0| 0), 221#(= |#race~x~0| 0), Black: 214#true, 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,796 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:46:12,796 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,796 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,796 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,808 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([464] L709-2-->L709-4: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][142], [Black: 188#(= ~turn~0 0), 24#L702true, Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 28#L709-4true, 221#(= |#race~x~0| 0), Black: 181#true, Black: 214#true, 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,808 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2024-10-11 16:46:12,808 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,808 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,809 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2024-10-11 16:46:12,809 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([553] L702-1-->L702-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork0_#t~nondet7#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet7#1=|v_thr1Thread1of1ForFork0_#t~nondet7#1_3|, #race~turn~0=|v_#race~turn~0_13|} AuxVars[] AssignedVars[#race~turn~0][101], [120#L709-2true, Black: 188#(= ~turn~0 0), Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 40#L702-2true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), Black: 183#(= |#race~turn~0| 0), 221#(= |#race~x~0| 0), Black: 214#true, 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,809 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2024-10-11 16:46:12,809 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-10-11 16:46:12,809 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-10-11 16:46:12,809 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2024-10-11 16:46:12,810 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([570] L703-2-->L703-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork0_#t~nondet8#1_3|) InVars {thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|} OutVars{thr1Thread1of1ForFork0_#t~nondet8#1=|v_thr1Thread1of1ForFork0_#t~nondet8#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][149], [Black: 188#(= ~turn~0 0), 114#L703-3true, Black: 196#(= |#race~flag1~0| |thr1Thread1of1ForFork0_#t~nondet3#1|), 134#L725-4true, 186#true, Black: 199#true, 152#L708-2true, Black: 206#(= |thr2Thread1of1ForFork1_#t~nondet9#1| |#race~flag2~0|), 214#true, 179#true, Black: 211#(= |#race~x~0| |thr1Thread1of1ForFork0_#t~nondet6#1|), 221#(= |#race~x~0| 0), Black: 183#(= |#race~turn~0| 0), Black: 216#(= |#race~flag1~0| 0)]) [2024-10-11 16:46:12,810 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2024-10-11 16:46:12,811 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-10-11 16:46:12,811 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-10-11 16:46:12,811 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2024-10-11 16:46:12,979 INFO L124 PetriNetUnfolderBase]: 374/2926 cut-off events. [2024-10-11 16:46:12,979 INFO L125 PetriNetUnfolderBase]: For 387/412 co-relation queries the response was YES. [2024-10-11 16:46:12,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4514 conditions, 2926 events. 374/2926 cut-off events. For 387/412 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 30489 event pairs, 56 based on Foata normal form. 1/2454 useless extension candidates. Maximal degree in co-relation 3751. Up to 221 conditions per place. [2024-10-11 16:46:12,997 INFO L140 encePairwiseOnDemand]: 179/187 looper letters, 14 selfloop transitions, 7 changer transitions 0/206 dead transitions. [2024-10-11 16:46:12,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 206 transitions, 681 flow [2024-10-11 16:46:12,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:46:12,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-11 16:46:12,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2024-10-11 16:46:13,000 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9144385026737968 [2024-10-11 16:46:13,000 INFO L175 Difference]: Start difference. First operand has 179 places, 198 transitions, 614 flow. Second operand 3 states and 513 transitions. [2024-10-11 16:46:13,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 206 transitions, 681 flow [2024-10-11 16:46:13,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 206 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-11 16:46:13,006 INFO L231 Difference]: Finished difference. Result has 181 places, 204 transitions, 664 flow [2024-10-11 16:46:13,007 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=187, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=664, PETRI_PLACES=181, PETRI_TRANSITIONS=204} [2024-10-11 16:46:13,007 INFO L277 CegarLoopForPetriNet]: 171 programPoint places, 10 predicate places. [2024-10-11 16:46:13,008 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 204 transitions, 664 flow [2024-10-11 16:46:13,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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) [2024-10-11 16:46:13,008 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-11 16:46:13,009 INFO L204 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] [2024-10-11 16:46:13,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:46:13,009 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2024-10-11 16:46:13,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:46:13,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1663183614, now seen corresponding path program 1 times [2024-10-11 16:46:13,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:46:13,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300681688] [2024-10-11 16:46:13,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:46:13,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:46:13,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:46:13,023 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 16:46:13,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 16:46:13,054 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 16:46:13,054 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 16:46:13,056 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2024-10-11 16:46:13,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2024-10-11 16:46:13,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2024-10-11 16:46:13,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2024-10-11 16:46:13,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2024-10-11 16:46:13,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2024-10-11 16:46:13,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2024-10-11 16:46:13,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2024-10-11 16:46:13,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2024-10-11 16:46:13,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2024-10-11 16:46:13,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2024-10-11 16:46:13,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2024-10-11 16:46:13,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2024-10-11 16:46:13,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2024-10-11 16:46:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2024-10-11 16:46:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2024-10-11 16:46:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2024-10-11 16:46:13,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2024-10-11 16:46:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2024-10-11 16:46:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2024-10-11 16:46:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2024-10-11 16:46:13,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2024-10-11 16:46:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2024-10-11 16:46:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 44 remaining) [2024-10-11 16:46:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 44 remaining) [2024-10-11 16:46:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2024-10-11 16:46:13,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2024-10-11 16:46:13,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2024-10-11 16:46:13,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2024-10-11 16:46:13,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2024-10-11 16:46:13,064 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2024-10-11 16:46:13,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2024-10-11 16:46:13,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2024-10-11 16:46:13,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2024-10-11 16:46:13,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2024-10-11 16:46:13,065 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2024-10-11 16:46:13,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2024-10-11 16:46:13,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2024-10-11 16:46:13,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2024-10-11 16:46:13,066 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2024-10-11 16:46:13,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2024-10-11 16:46:13,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2024-10-11 16:46:13,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2024-10-11 16:46:13,067 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2024-10-11 16:46:13,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:46:13,068 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:46:13,125 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-11 16:46:13,126 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 16:46:13,132 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 04:46:13 BasicIcfg [2024-10-11 16:46:13,132 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 16:46:13,133 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 16:46:13,133 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 16:46:13,133 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 16:46:13,133 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:46:09" (3/4) ... [2024-10-11 16:46:13,137 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 16:46:13,138 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 16:46:13,138 INFO L158 Benchmark]: Toolchain (without parser) took 4490.41ms. Allocated memory was 188.7MB in the beginning and 295.7MB in the end (delta: 107.0MB). Free memory was 113.4MB in the beginning and 218.6MB in the end (delta: -105.3MB). Peak memory consumption was 4.5MB. Max. memory is 16.1GB. [2024-10-11 16:46:13,139 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 16:46:13,139 INFO L158 Benchmark]: CACSL2BoogieTranslator took 519.55ms. Allocated memory is still 188.7MB. Free memory was 113.0MB in the beginning and 146.7MB in the end (delta: -33.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. [2024-10-11 16:46:13,139 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.47ms. Allocated memory is still 188.7MB. Free memory was 146.7MB in the beginning and 144.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 16:46:13,140 INFO L158 Benchmark]: Boogie Preprocessor took 38.93ms. Allocated memory is still 188.7MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 16:46:13,140 INFO L158 Benchmark]: RCFGBuilder took 413.97ms. Allocated memory is still 188.7MB. Free memory was 142.5MB in the beginning and 124.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-11 16:46:13,140 INFO L158 Benchmark]: TraceAbstraction took 3453.47ms. Allocated memory was 188.7MB in the beginning and 295.7MB in the end (delta: 107.0MB). Free memory was 123.6MB in the beginning and 219.7MB in the end (delta: -96.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. [2024-10-11 16:46:13,141 INFO L158 Benchmark]: Witness Printer took 5.41ms. Allocated memory is still 295.7MB. Free memory was 219.7MB in the beginning and 218.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 16:46:13,143 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.15ms. Allocated memory is still 104.9MB. Free memory is still 60.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 519.55ms. Allocated memory is still 188.7MB. Free memory was 113.0MB in the beginning and 146.7MB in the end (delta: -33.6MB). Peak memory consumption was 17.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.47ms. Allocated memory is still 188.7MB. Free memory was 146.7MB in the beginning and 144.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.93ms. Allocated memory is still 188.7MB. Free memory was 144.6MB in the beginning and 142.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 413.97ms. Allocated memory is still 188.7MB. Free memory was 142.5MB in the beginning and 124.7MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3453.47ms. Allocated memory was 188.7MB in the beginning and 295.7MB in the end (delta: 107.0MB). Free memory was 123.6MB in the beginning and 219.7MB in the end (delta: -96.1MB). Peak memory consumption was 9.8MB. Max. memory is 16.1GB. * Witness Printer took 5.41ms. Allocated memory is still 295.7MB. Free memory was 219.7MB in the beginning and 218.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 693]: Data race detected Data race detected The following path leads to a data race: [L688] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L689] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L690] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L722] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L723] EXPR 0 0<=turn VAL [flag1=0, flag2=0, turn=0, x=0] [L723] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L723] EXPR 0 turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L723] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L723] CALL 0 assume_abort_if_not(0<=turn && turn<=1) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, flag1=0, flag2=0, turn=0, x=0] [L723] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L724] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L692] 1 flag1 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L725] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1=-1, t2=0, turn=0, x=0] [L707] 2 flag2 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L693] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] Now there is a data race on ~flag2~0 between C: flag2 = 1 [707] and C: flag2 >= 1 [693] - UnprovableResult [Line: 707]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 715]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 716]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 717]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 718]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 700]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 695]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 697]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 296 locations, 44 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.2s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 281 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 101 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 242 IncrementalHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 64 mSDtfsCounter, 242 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=664occurred in iteration=8, InterpolantAutomatonStates: 25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 359 NumberOfCodeBlocks, 359 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 301 ConstructedInterpolants, 0 QuantifiedInterpolants, 331 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-11 16:46:13,174 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE