./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-atomic/dekker-b-unfair.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-atomic/dekker-b-unfair.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 00eedb63fb9d62a729cbdbbc78c20dc2306cd626b581321e129d31c09fc5db8e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:03:33,711 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:03:33,777 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:03:33,780 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:03:33,780 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:03:33,801 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:03:33,801 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:03:33,802 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:03:33,802 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:03:33,802 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:03:33,802 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:03:33,803 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:33,803 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:33,803 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:03:33,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:03:33,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:03:33,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:03:33,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:03:33,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:03:33,804 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:03:33,804 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/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 -> 00eedb63fb9d62a729cbdbbc78c20dc2306cd626b581321e129d31c09fc5db8e [2025-01-09 21:03:34,012 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:03:34,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:03:34,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:03:34,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:03:34,019 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:03:34,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-atomic/dekker-b-unfair.i [2025-01-09 21:03:35,121 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8af95cb04/57b0be031dc741d6af4b3dee2398de25/FLAGafa2d83f9 [2025-01-09 21:03:35,440 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:03:35,441 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-atomic/dekker-b-unfair.i [2025-01-09 21:03:35,452 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8af95cb04/57b0be031dc741d6af4b3dee2398de25/FLAGafa2d83f9 [2025-01-09 21:03:35,462 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8af95cb04/57b0be031dc741d6af4b3dee2398de25 [2025-01-09 21:03:35,464 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:03:35,465 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:03:35,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:35,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:03:35,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:03:35,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,470 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e8e0a8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35, skipping insertion in model container [2025-01-09 21:03:35,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,488 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:03:35,748 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:35,756 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:03:35,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:03:35,831 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:03:35,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35 WrapperNode [2025-01-09 21:03:35,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:03:35,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:35,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:03:35,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:03:35,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,871 INFO L138 Inliner]: procedures = 161, calls = 11, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 148 [2025-01-09 21:03:35,871 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:03:35,871 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:03:35,871 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:03:35,871 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:03:35,875 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,876 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,890 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,891 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,893 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:03:35,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:03:35,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:03:35,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:03:35,900 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (1/1) ... [2025-01-09 21:03:35,903 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:03:35,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:03:35,929 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:03:35,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:03:35,950 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2025-01-09 21:03:35,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2025-01-09 21:03:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2025-01-09 21:03:35,951 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2025-01-09 21:03:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:03:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:03:35,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:03:35,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:03:35,952 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:03:36,058 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:03:36,062 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:03:36,218 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:03:36,219 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:03:36,232 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:03:36,234 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:03:36,234 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:36 BoogieIcfgContainer [2025-01-09 21:03:36,234 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:03:36,236 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:03:36,236 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:03:36,240 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:03:36,240 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:03:35" (1/3) ... [2025-01-09 21:03:36,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccf7455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:36, skipping insertion in model container [2025-01-09 21:03:36,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:03:35" (2/3) ... [2025-01-09 21:03:36,241 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccf7455 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:03:36, skipping insertion in model container [2025-01-09 21:03:36,241 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:36" (3/3) ... [2025-01-09 21:03:36,242 INFO L128 eAbstractionObserver]: Analyzing ICFG dekker-b-unfair.i [2025-01-09 21:03:36,254 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:03:36,256 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dekker-b-unfair.i that has 3 procedures, 170 locations, 1 initial locations, 4 loop locations, and 22 error locations. [2025-01-09 21:03:36,256 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:03:36,355 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:03:36,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 176 places, 185 transitions, 384 flow [2025-01-09 21:03:36,470 INFO L124 PetriNetUnfolderBase]: 16/183 cut-off events. [2025-01-09 21:03:36,473 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:03:36,482 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 183 events. 16/183 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 433 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 142. Up to 3 conditions per place. [2025-01-09 21:03:36,484 INFO L82 GeneralOperation]: Start removeDead. Operand has 176 places, 185 transitions, 384 flow [2025-01-09 21:03:36,491 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 169 places, 178 transitions, 365 flow [2025-01-09 21:03:36,500 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:03:36,510 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;@5d38ec4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:03:36,511 INFO L334 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2025-01-09 21:03:36,514 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:03:36,514 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-01-09 21:03:36,514 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:03:36,514 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:36,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:36,515 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:36,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:36,522 INFO L85 PathProgramCache]: Analyzing trace with hash 427862299, now seen corresponding path program 1 times [2025-01-09 21:03:36,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:36,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308009197] [2025-01-09 21:03:36,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:36,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:36,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 21:03:36,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 21:03:36,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:36,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:36,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:36,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308009197] [2025-01-09 21:03:36,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308009197] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:36,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:36,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:36,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116156335] [2025-01-09 21:03:36,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:36,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:36,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:36,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:36,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:36,784 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 185 [2025-01-09 21:03:36,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 169 places, 178 transitions, 365 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) [2025-01-09 21:03:36,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:36,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 185 [2025-01-09 21:03:36,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:36,932 INFO L124 PetriNetUnfolderBase]: 98/790 cut-off events. [2025-01-09 21:03:36,932 INFO L125 PetriNetUnfolderBase]: For 43/43 co-relation queries the response was YES. [2025-01-09 21:03:36,934 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 4938 event pairs, 23 based on Foata normal form. 66/687 useless extension candidates. Maximal degree in co-relation 812. Up to 99 conditions per place. [2025-01-09 21:03:36,937 INFO L140 encePairwiseOnDemand]: 159/185 looper letters, 22 selfloop transitions, 11 changer transitions 1/177 dead transitions. [2025-01-09 21:03:36,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 167 places, 177 transitions, 435 flow [2025-01-09 21:03:36,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:36,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:36,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2025-01-09 21:03:36,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225225225225225 [2025-01-09 21:03:36,947 INFO L175 Difference]: Start difference. First operand has 169 places, 178 transitions, 365 flow. Second operand 3 states and 512 transitions. [2025-01-09 21:03:36,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 167 places, 177 transitions, 435 flow [2025-01-09 21:03:36,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 177 transitions, 427 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-01-09 21:03:36,953 INFO L231 Difference]: Finished difference. Result has 166 places, 174 transitions, 424 flow [2025-01-09 21:03:36,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:36,957 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -3 predicate places. [2025-01-09 21:03:36,957 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 174 transitions, 424 flow [2025-01-09 21:03:36,957 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) [2025-01-09 21:03:36,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:36,957 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:36,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:03:36,958 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:36,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:36,958 INFO L85 PathProgramCache]: Analyzing trace with hash -849138690, now seen corresponding path program 1 times [2025-01-09 21:03:36,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:36,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290170177] [2025-01-09 21:03:36,958 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:36,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:36,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:03:36,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:03:36,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:36,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290170177] [2025-01-09 21:03:37,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290170177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 21:03:37,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926997210] [2025-01-09 21:03:37,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 21:03:37,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 21:03:37,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 21:03:37,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 185 [2025-01-09 21:03:37,065 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) [2025-01-09 21:03:37,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 185 [2025-01-09 21:03:37,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:37,134 INFO L124 PetriNetUnfolderBase]: 73/668 cut-off events. [2025-01-09 21:03:37,134 INFO L125 PetriNetUnfolderBase]: For 40/40 co-relation queries the response was YES. [2025-01-09 21:03:37,135 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 4109 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. [2025-01-09 21:03:37,137 INFO L140 encePairwiseOnDemand]: 174/185 looper letters, 14 selfloop transitions, 7 changer transitions 0/177 dead transitions. [2025-01-09 21:03:37,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 177 transitions, 474 flow [2025-01-09 21:03:37,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 21:03:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-01-09 21:03:37,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 649 transitions. [2025-01-09 21:03:37,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770270270270271 [2025-01-09 21:03:37,139 INFO L175 Difference]: Start difference. First operand has 166 places, 174 transitions, 424 flow. Second operand 4 states and 649 transitions. [2025-01-09 21:03:37,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 177 transitions, 474 flow [2025-01-09 21:03:37,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 177 transitions, 452 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:37,179 INFO L231 Difference]: Finished difference. Result has 168 places, 176 transitions, 444 flow [2025-01-09 21:03:37,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:37,180 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, -1 predicate places. [2025-01-09 21:03:37,180 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 176 transitions, 444 flow [2025-01-09 21:03:37,180 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) [2025-01-09 21:03:37,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:37,180 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:37,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:03:37,180 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:37,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:37,181 INFO L85 PathProgramCache]: Analyzing trace with hash 579502009, now seen corresponding path program 1 times [2025-01-09 21:03:37,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:37,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906587461] [2025-01-09 21:03:37,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:37,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:37,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-01-09 21:03:37,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-01-09 21:03:37,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:37,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906587461] [2025-01-09 21:03:37,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906587461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:37,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008659038] [2025-01-09 21:03:37,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:37,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:37,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:37,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-01-09 21:03:37,230 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) [2025-01-09 21:03:37,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-01-09 21:03:37,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:37,291 INFO L124 PetriNetUnfolderBase]: 75/853 cut-off events. [2025-01-09 21:03:37,292 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-01-09 21:03:37,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 853 events. 75/853 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 5621 event pairs, 16 based on Foata normal form. 0/704 useless extension candidates. Maximal degree in co-relation 890. Up to 75 conditions per place. [2025-01-09 21:03:37,295 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 12 selfloop transitions, 4 changer transitions 0/180 dead transitions. [2025-01-09 21:03:37,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 180 transitions, 486 flow [2025-01-09 21:03:37,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:37,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:37,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-01-09 21:03:37,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2025-01-09 21:03:37,297 INFO L175 Difference]: Start difference. First operand has 168 places, 176 transitions, 444 flow. Second operand 3 states and 506 transitions. [2025-01-09 21:03:37,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 180 transitions, 486 flow [2025-01-09 21:03:37,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 169 places, 180 transitions, 484 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:03:37,301 INFO L231 Difference]: Finished difference. Result has 171 places, 179 transitions, 472 flow [2025-01-09 21:03:37,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:37,302 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 2 predicate places. [2025-01-09 21:03:37,302 INFO L471 AbstractCegarLoop]: Abstraction has has 171 places, 179 transitions, 472 flow [2025-01-09 21:03:37,302 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) [2025-01-09 21:03:37,302 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:37,302 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:37,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:03:37,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:37,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:37,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1823643514, now seen corresponding path program 1 times [2025-01-09 21:03:37,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:37,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379951211] [2025-01-09 21:03:37,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:37,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:37,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-01-09 21:03:37,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-01-09 21:03:37,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:37,313 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379951211] [2025-01-09 21:03:37,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379951211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:37,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480432164] [2025-01-09 21:03:37,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:37,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:37,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:37,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2025-01-09 21:03:37,352 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) [2025-01-09 21:03:37,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,352 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2025-01-09 21:03:37,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:37,472 INFO L124 PetriNetUnfolderBase]: 143/1342 cut-off events. [2025-01-09 21:03:37,473 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-01-09 21:03:37,476 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 10956 event pairs, 20 based on Foata normal form. 0/1105 useless extension candidates. Maximal degree in co-relation 1686. Up to 125 conditions per place. [2025-01-09 21:03:37,479 INFO L140 encePairwiseOnDemand]: 178/185 looper letters, 12 selfloop transitions, 6 changer transitions 0/187 dead transitions. [2025-01-09 21:03:37,479 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 187 transitions, 527 flow [2025-01-09 21:03:37,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:37,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:37,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2025-01-09 21:03:37,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9261261261261261 [2025-01-09 21:03:37,481 INFO L175 Difference]: Start difference. First operand has 171 places, 179 transitions, 472 flow. Second operand 3 states and 514 transitions. [2025-01-09 21:03:37,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 187 transitions, 527 flow [2025-01-09 21:03:37,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 187 transitions, 519 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:37,485 INFO L231 Difference]: Finished difference. Result has 173 places, 185 transitions, 514 flow [2025-01-09 21:03:37,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:37,485 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 4 predicate places. [2025-01-09 21:03:37,485 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 185 transitions, 514 flow [2025-01-09 21:03:37,486 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) [2025-01-09 21:03:37,486 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:37,486 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:37,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:03:37,486 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:37,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:37,487 INFO L85 PathProgramCache]: Analyzing trace with hash 534056104, now seen corresponding path program 1 times [2025-01-09 21:03:37,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:37,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461240875] [2025-01-09 21:03:37,487 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:37,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:37,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:03:37,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:03:37,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:37,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461240875] [2025-01-09 21:03:37,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461240875] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412552382] [2025-01-09 21:03:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:37,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:37,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:37,543 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 185 [2025-01-09 21:03:37,544 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) [2025-01-09 21:03:37,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 185 [2025-01-09 21:03:37,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:37,647 INFO L124 PetriNetUnfolderBase]: 182/1457 cut-off events. [2025-01-09 21:03:37,648 INFO L125 PetriNetUnfolderBase]: For 238/255 co-relation queries the response was YES. [2025-01-09 21:03:37,651 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 12022 event pairs, 29 based on Foata normal form. 0/1199 useless extension candidates. Maximal degree in co-relation 1203. Up to 139 conditions per place. [2025-01-09 21:03:37,654 INFO L140 encePairwiseOnDemand]: 180/185 looper letters, 16 selfloop transitions, 6 changer transitions 0/190 dead transitions. [2025-01-09 21:03:37,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 190 transitions, 575 flow [2025-01-09 21:03:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:37,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2025-01-09 21:03:37,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9117117117117117 [2025-01-09 21:03:37,656 INFO L175 Difference]: Start difference. First operand has 173 places, 185 transitions, 514 flow. Second operand 3 states and 506 transitions. [2025-01-09 21:03:37,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 190 transitions, 575 flow [2025-01-09 21:03:37,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 173 places, 190 transitions, 561 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:37,660 INFO L231 Difference]: Finished difference. Result has 175 places, 189 transitions, 548 flow [2025-01-09 21:03:37,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:37,661 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 6 predicate places. [2025-01-09 21:03:37,661 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 189 transitions, 548 flow [2025-01-09 21:03:37,661 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) [2025-01-09 21:03:37,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:37,661 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:37,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:03:37,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err6ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:37,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash -257530076, now seen corresponding path program 1 times [2025-01-09 21:03:37,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27146490] [2025-01-09 21:03:37,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:37,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-01-09 21:03:37,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-01-09 21:03:37,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:37,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27146490] [2025-01-09 21:03:37,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27146490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043783789] [2025-01-09 21:03:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:37,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:37,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:37,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-01-09 21:03:37,715 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) [2025-01-09 21:03:37,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-01-09 21:03:37,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:37,854 INFO L124 PetriNetUnfolderBase]: 205/1715 cut-off events. [2025-01-09 21:03:37,854 INFO L125 PetriNetUnfolderBase]: For 119/122 co-relation queries the response was YES. [2025-01-09 21:03:37,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2470 conditions, 1715 events. 205/1715 cut-off events. For 119/122 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 15149 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. [2025-01-09 21:03:37,864 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 11 selfloop transitions, 5 changer transitions 0/194 dead transitions. [2025-01-09 21:03:37,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 177 places, 194 transitions, 592 flow [2025-01-09 21:03:37,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:37,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 509 transitions. [2025-01-09 21:03:37,868 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171171171171171 [2025-01-09 21:03:37,869 INFO L175 Difference]: Start difference. First operand has 175 places, 189 transitions, 548 flow. Second operand 3 states and 509 transitions. [2025-01-09 21:03:37,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 177 places, 194 transitions, 592 flow [2025-01-09 21:03:37,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 194 transitions, 580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:37,875 INFO L231 Difference]: Finished difference. Result has 177 places, 193 transitions, 574 flow [2025-01-09 21:03:37,875 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:37,875 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 8 predicate places. [2025-01-09 21:03:37,876 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 193 transitions, 574 flow [2025-01-09 21:03:37,876 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) [2025-01-09 21:03:37,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:37,877 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:37,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:03:37,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr2Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:37,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:37,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1507000629, now seen corresponding path program 1 times [2025-01-09 21:03:37,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:37,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232706030] [2025-01-09 21:03:37,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:37,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:37,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-01-09 21:03:37,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-01-09 21:03:37,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:37,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:37,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:37,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:37,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232706030] [2025-01-09 21:03:37,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232706030] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:37,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:37,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:37,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864793919] [2025-01-09 21:03:37,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:37,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:37,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:37,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:37,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:37,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 185 [2025-01-09 21:03:37,939 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) [2025-01-09 21:03:37,939 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:37,939 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 185 [2025-01-09 21:03:37,939 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:38,034 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L709-3-->L710: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][135], [24#L703-2true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 171#L710true, 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, 135#L726-4true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,034 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-01-09 21:03:38,034 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,035 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,035 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([546] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [24#L703-2true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 171#L710true, 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 135#L726-4true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,042 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-01-09 21:03:38,042 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,042 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,042 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,049 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([546] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [24#L703-2true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 135#L726-4true, 207#true, 127#L710-1true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,049 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-01-09 21:03:38,050 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-01-09 21:03:38,050 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-01-09 21:03:38,050 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-01-09 21:03:38,050 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L710-1-->L710-3: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][128], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 91#L703true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, 135#L726-4true, 13#L710-3true, 207#true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,050 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-01-09 21:03:38,050 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,050 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,050 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,051 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([563] L704-2-->L704-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork1_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|} OutVars{thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][148], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 109#L709-2true, 117#L704-3true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), 135#L726-4true, 207#true, 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2025-01-09 21:03:38,051 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-01-09 21:03:38,051 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:03:38,051 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:03:38,051 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:03:38,147 INFO L124 PetriNetUnfolderBase]: 328/2555 cut-off events. [2025-01-09 21:03:38,147 INFO L125 PetriNetUnfolderBase]: For 212/221 co-relation queries the response was YES. [2025-01-09 21:03:38,154 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 129. Compared 25269 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. [2025-01-09 21:03:38,162 INFO L140 encePairwiseOnDemand]: 179/185 looper letters, 11 selfloop transitions, 6 changer transitions 0/199 dead transitions. [2025-01-09 21:03:38,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 199 transitions, 625 flow [2025-01-09 21:03:38,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:38,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:38,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 512 transitions. [2025-01-09 21:03:38,164 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225225225225225 [2025-01-09 21:03:38,164 INFO L175 Difference]: Start difference. First operand has 177 places, 193 transitions, 574 flow. Second operand 3 states and 512 transitions. [2025-01-09 21:03:38,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 199 transitions, 625 flow [2025-01-09 21:03:38,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 199 transitions, 615 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:38,169 INFO L231 Difference]: Finished difference. Result has 179 places, 198 transitions, 614 flow [2025-01-09 21:03:38,169 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:38,170 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 10 predicate places. [2025-01-09 21:03:38,170 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 198 transitions, 614 flow [2025-01-09 21:03:38,170 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) [2025-01-09 21:03:38,170 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:38,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:38,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:03:38,171 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err7ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:38,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:38,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1266352246, now seen corresponding path program 1 times [2025-01-09 21:03:38,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:38,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124725430] [2025-01-09 21:03:38,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:38,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:38,180 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:03:38,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:03:38,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:38,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:03:38,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:03:38,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:03:38,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124725430] [2025-01-09 21:03:38,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124725430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:03:38,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:03:38,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:03:38,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261814055] [2025-01-09 21:03:38,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:03:38,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:03:38,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:03:38,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:03:38,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:03:38,215 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 185 [2025-01-09 21:03:38,216 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) [2025-01-09 21:03:38,216 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:03:38,216 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 185 [2025-01-09 21:03:38,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:03:38,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([454] L709-3-->L710: Formula: (= |v_#race~turn~0_1| 0) InVars {} OutVars{#race~turn~0=|v_#race~turn~0_1|} AuxVars[] AssignedVars[#race~turn~0][139], [24#L703-2true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, 171#L710true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, Black: 212#true, 135#L726-4true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,313 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-01-09 21:03:38,313 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,313 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,313 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,321 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([546] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [24#L703-2true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, 171#L710true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), Black: 212#true, 135#L726-4true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,321 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-01-09 21:03:38,321 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,321 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,321 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,329 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([546] L703-1-->L703-2: Formula: (= |v_#race~turn~0_13| |v_thr1Thread1of1ForFork1_#t~nondet5#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} OutVars{#race~turn~0=|v_#race~turn~0_13|, thr1Thread1of1ForFork1_#t~nondet5#1=|v_thr1Thread1of1ForFork1_#t~nondet5#1_3|} AuxVars[] AssignedVars[#race~turn~0][103], [24#L703-2true, Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 181#(= |#race~turn~0| 0), Black: 212#true, 135#L726-4true, 184#true, 127#L710-1true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,329 INFO L294 olderBase$Statistics]: this new event has 75 ancestors and is cut-off event [2025-01-09 21:03:38,329 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-01-09 21:03:38,329 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-01-09 21:03:38,330 INFO L297 olderBase$Statistics]: existing Event has 69 ancestors and is cut-off event [2025-01-09 21:03:38,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([461] L710-1-->L710-3: Formula: (= v_~turn~0_4 1) InVars {~turn~0=v_~turn~0_4} OutVars{~turn~0=v_~turn~0_4} AuxVars[] AssignedVars[][142], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 91#L703true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 214#(= |#race~flag1~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 179#true, Black: 212#true, 135#L726-4true, 13#L710-3true, 184#true, Black: 186#(= ~turn~0 0)]) [2025-01-09 21:03:38,330 INFO L294 olderBase$Statistics]: this new event has 74 ancestors and is cut-off event [2025-01-09 21:03:38,330 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,330 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,330 INFO L297 olderBase$Statistics]: existing Event has 68 ancestors and is cut-off event [2025-01-09 21:03:38,330 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([563] L704-2-->L704-3: Formula: (= |v_#race~flag1~0_7| |v_thr1Thread1of1ForFork1_#t~nondet6#1_3|) InVars {thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|} OutVars{thr1Thread1of1ForFork1_#t~nondet6#1=|v_thr1Thread1of1ForFork1_#t~nondet6#1_3|, #race~flag1~0=|v_#race~flag1~0_7|} AuxVars[] AssignedVars[#race~flag1~0][149], [Black: 194#(= |thr1Thread1of1ForFork1_#t~nondet1#1| |#race~flag1~0|), Black: 197#true, 117#L704-3true, 109#L709-2true, Black: 204#(= |thr2Thread1of1ForFork0_#t~nondet7#1| |#race~flag2~0|), 219#(= |#race~x~0| 0), 177#true, Black: 209#(= |#race~x~0| |thr1Thread1of1ForFork1_#t~nondet4#1|), Black: 214#(= |#race~flag1~0| 0), Black: 181#(= |#race~turn~0| 0), 135#L726-4true, 184#true, Black: 186#(= ~turn~0 0), 212#true]) [2025-01-09 21:03:38,331 INFO L294 olderBase$Statistics]: this new event has 77 ancestors and is cut-off event [2025-01-09 21:03:38,331 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:03:38,331 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:03:38,331 INFO L297 olderBase$Statistics]: existing Event has 71 ancestors and is cut-off event [2025-01-09 21:03:38,411 INFO L124 PetriNetUnfolderBase]: 374/2926 cut-off events. [2025-01-09 21:03:38,411 INFO L125 PetriNetUnfolderBase]: For 391/416 co-relation queries the response was YES. [2025-01-09 21:03:38,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4514 conditions, 2926 events. 374/2926 cut-off events. For 391/416 co-relation queries the response was YES. Maximal size of possible extension queue 144. Compared 30522 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. [2025-01-09 21:03:38,425 INFO L140 encePairwiseOnDemand]: 177/185 looper letters, 14 selfloop transitions, 7 changer transitions 0/206 dead transitions. [2025-01-09 21:03:38,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 181 places, 206 transitions, 681 flow [2025-01-09 21:03:38,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:03:38,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:03:38,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 513 transitions. [2025-01-09 21:03:38,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243243243243243 [2025-01-09 21:03:38,427 INFO L175 Difference]: Start difference. First operand has 179 places, 198 transitions, 614 flow. Second operand 3 states and 513 transitions. [2025-01-09 21:03:38,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 181 places, 206 transitions, 681 flow [2025-01-09 21:03:38,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 206 transitions, 669 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:03:38,431 INFO L231 Difference]: Finished difference. Result has 181 places, 204 transitions, 664 flow [2025-01-09 21:03:38,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=185, 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} [2025-01-09 21:03:38,432 INFO L279 CegarLoopForPetriNet]: 169 programPoint places, 12 predicate places. [2025-01-09 21:03:38,432 INFO L471 AbstractCegarLoop]: Abstraction has has 181 places, 204 transitions, 664 flow [2025-01-09 21:03:38,432 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) [2025-01-09 21:03:38,432 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:03:38,433 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:38,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:03:38,433 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err6ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-01-09 21:03:38,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:03:38,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1634466357, now seen corresponding path program 1 times [2025-01-09 21:03:38,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:03:38,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494988142] [2025-01-09 21:03:38,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:03:38,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:03:38,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:03:38,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:03:38,442 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:38,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:03:38,443 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:03:38,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:03:38,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:03:38,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:03:38,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:03:38,464 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:03:38,464 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:03:38,465 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (43 of 44 remaining) [2025-01-09 21:03:38,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (42 of 44 remaining) [2025-01-09 21:03:38,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (41 of 44 remaining) [2025-01-09 21:03:38,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (40 of 44 remaining) [2025-01-09 21:03:38,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (39 of 44 remaining) [2025-01-09 21:03:38,466 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (38 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (37 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (36 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (35 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (34 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (33 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (32 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (31 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (30 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (29 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (28 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (27 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (26 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (25 of 44 remaining) [2025-01-09 21:03:38,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (24 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (23 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (22 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (20 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (17 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err6ASSERT_VIOLATIONDATA_RACE (16 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (15 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err7ASSERT_VIOLATIONDATA_RACE (14 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err3ASSERT_VIOLATIONDATA_RACE (13 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err8ASSERT_VIOLATIONDATA_RACE (12 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err4ASSERT_VIOLATIONDATA_RACE (11 of 44 remaining) [2025-01-09 21:03:38,468 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err5ASSERT_VIOLATIONDATA_RACE (10 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err9ASSERT_VIOLATIONDATA_RACE (9 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (8 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6ASSERT_VIOLATIONDATA_RACE (7 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2ASSERT_VIOLATIONDATA_RACE (6 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7ASSERT_VIOLATIONDATA_RACE (5 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3ASSERT_VIOLATIONDATA_RACE (4 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8ASSERT_VIOLATIONDATA_RACE (3 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4ASSERT_VIOLATIONDATA_RACE (2 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5ASSERT_VIOLATIONDATA_RACE (1 of 44 remaining) [2025-01-09 21:03:38,469 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9ASSERT_VIOLATIONDATA_RACE (0 of 44 remaining) [2025-01-09 21:03:38,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:03:38,470 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:03:38,497 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:03:38,497 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:03:38,500 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:03:38 BasicIcfg [2025-01-09 21:03:38,501 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:03:38,501 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:03:38,501 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:03:38,501 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:03:38,502 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:03:36" (3/4) ... [2025-01-09 21:03:38,502 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-09 21:03:38,533 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 4. [2025-01-09 21:03:38,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:03:38,560 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:03:38,560 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:03:38,561 INFO L158 Benchmark]: Toolchain (without parser) took 3095.32ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 106.0MB in the beginning and 189.8MB in the end (delta: -83.9MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2025-01-09 21:03:38,561 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:38,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.77ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 86.1MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:03:38,561 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.48ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:03:38,561 INFO L158 Benchmark]: Boogie Preprocessor took 25.94ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.3MB in the end (delta: 783.0kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:03:38,562 INFO L158 Benchmark]: RCFGBuilder took 336.47ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 66.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 21:03:38,562 INFO L158 Benchmark]: TraceAbstraction took 2265.01ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 65.8MB in the beginning and 198.8MB in the end (delta: -133.1MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. [2025-01-09 21:03:38,562 INFO L158 Benchmark]: Witness Printer took 59.20ms. Allocated memory is still 343.9MB. Free memory was 198.8MB in the beginning and 189.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:03:38,563 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.13ms. Allocated memory is still 201.3MB. Free memory is still 126.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.77ms. Allocated memory is still 142.6MB. Free memory was 105.2MB in the beginning and 86.1MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.48ms. Allocated memory is still 142.6MB. Free memory was 86.1MB in the beginning and 84.1MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.94ms. Allocated memory is still 142.6MB. Free memory was 84.1MB in the beginning and 83.3MB in the end (delta: 783.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 336.47ms. Allocated memory is still 142.6MB. Free memory was 83.3MB in the beginning and 66.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2265.01ms. Allocated memory was 142.6MB in the beginning and 343.9MB in the end (delta: 201.3MB). Free memory was 65.8MB in the beginning and 198.8MB in the end (delta: -133.1MB). Peak memory consumption was 62.9MB. Max. memory is 16.1GB. * Witness Printer took 59.20ms. Allocated memory is still 343.9MB. Free memory was 198.8MB in the beginning and 189.8MB in the end (delta: 9.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L689] 0 int flag1 = 0, flag2 = 0; VAL [flag1=0, flag2=0] [L690] 0 int turn; VAL [flag1=0, flag2=0, turn=0] [L691] 0 int x; VAL [flag1=0, flag2=0, turn=0, x=0] [L723] 0 pthread_t t1, t2; VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] EXPR 0 0<=turn && turn<=1 VAL [flag1=0, flag2=0, turn=0, x=0] [L724] 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] [L724] RET 0 assume_abort_if_not(0<=turn && turn<=1) [L725] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [flag1=0, flag2=0, t1=-1, turn=0, x=0] [L693] 1 flag1 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L694] 1 flag2 >= 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=0, turn=0, x=0] [L726] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [flag1=1, flag2=0, t1=-1, t2=0, turn=0, x=0] [L708] 2 flag2 = 1 VAL [\old(_)={0:0}, _={0:0}, flag1=1, flag2=1, turn=0, x=0] [L694] 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 [708] and C: flag2 >= 1 [694] - 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: 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: 717]: 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: 718]: 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: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: 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: 702]: 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: 703]: 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: 698]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 704]: 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 there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 724]: Unable to prove that there are no data races Unable to prove that there are no data races 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. - UnprovableResult [Line: 726]: 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, 292 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: 2.1s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 259 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 54 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 247 IncrementalHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 47 mSDtfsCounter, 247 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.3s 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-01-09 21:03:38,576 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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(DATA-RACE)