./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:45:48,764 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:45:48,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:45:48,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:45:48,833 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:45:48,852 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:45:48,853 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:45:48,854 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:45:48,854 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:45:48,855 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:45:48,855 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:45:48,855 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:45:48,855 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:45:48,856 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:45:48,856 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:45:48,856 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:45:48,856 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:45:48,856 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:45:48,857 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:45:48,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:45:48,858 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:45:48,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:48,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:45:48,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:45:48,858 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:45:48,858 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:45:48,859 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:45:48,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:45:48,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:45:48,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:45:48,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:45:48,859 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:45:48,859 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 37731ec014f4053387ac8b56c0764486866d63670c206743514c9636df9b594a [2025-03-14 01:45:49,094 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:45:49,101 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:45:49,103 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:45:49,105 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:45:49,105 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:45:49,106 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-14 01:45:50,298 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d0ad260/dcfb6a9bec4e4a59a827cc9f3d3eb5d7/FLAGb88e06c7d [2025-03-14 01:45:50,550 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:45:50,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-sum-array-hom.wvr.c [2025-03-14 01:45:50,591 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d0ad260/dcfb6a9bec4e4a59a827cc9f3d3eb5d7/FLAGb88e06c7d [2025-03-14 01:45:50,617 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d0ad260/dcfb6a9bec4e4a59a827cc9f3d3eb5d7 [2025-03-14 01:45:50,619 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:45:50,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:45:50,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:50,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:45:50,629 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:45:50,630 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,631 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@207b3483 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50, skipping insertion in model container [2025-03-14 01:45:50,632 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,647 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:45:50,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:50,798 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:45:50,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:45:50,837 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:45:50,838 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50 WrapperNode [2025-03-14 01:45:50,838 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:45:50,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:50,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:45:50,839 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:45:50,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,871 INFO L138 Inliner]: procedures = 24, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 123 [2025-03-14 01:45:50,874 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:45:50,875 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:45:50,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:45:50,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:45:50,881 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,881 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,883 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,893 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,894 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,895 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,895 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:45:50,898 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:45:50,898 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:45:50,898 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:45:50,898 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (1/1) ... [2025-03-14 01:45:50,910 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:45:50,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:45:50,938 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-14 01:45:50,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-14 01:45:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-14 01:45:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-14 01:45:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:45:50,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:45:50,963 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:45:50,964 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:45:51,046 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:45:51,049 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:45:51,398 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:45:51,399 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:45:51,399 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:45:51,414 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:45:51,417 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:51 BoogieIcfgContainer [2025-03-14 01:45:51,417 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:45:51,419 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:45:51,419 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:45:51,423 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:45:51,424 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:45:50" (1/3) ... [2025-03-14 01:45:51,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253423e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:51, skipping insertion in model container [2025-03-14 01:45:51,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:45:50" (2/3) ... [2025-03-14 01:45:51,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253423e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:45:51, skipping insertion in model container [2025-03-14 01:45:51,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:51" (3/3) ... [2025-03-14 01:45:51,426 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-sum-array-hom.wvr.c [2025-03-14 01:45:51,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:45:51,441 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-sum-array-hom.wvr.c that has 4 procedures, 256 locations, 1 initial locations, 4 loop locations, and 27 error locations. [2025-03-14 01:45:51,442 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:45:51,521 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-14 01:45:51,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 265 places, 267 transitions, 555 flow [2025-03-14 01:45:51,631 INFO L124 PetriNetUnfolderBase]: 12/264 cut-off events. [2025-03-14 01:45:51,634 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-14 01:45:51,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 264 events. 12/264 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 446 event pairs, 0 based on Foata normal form. 0/225 useless extension candidates. Maximal degree in co-relation 200. Up to 2 conditions per place. [2025-03-14 01:45:51,643 INFO L82 GeneralOperation]: Start removeDead. Operand has 265 places, 267 transitions, 555 flow [2025-03-14 01:45:51,649 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 246 places, 247 transitions, 512 flow [2025-03-14 01:45:51,660 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:45:51,671 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;@4031517b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:45:51,671 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-03-14 01:45:51,677 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:45:51,677 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2025-03-14 01:45:51,678 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:45:51,678 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:51,678 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] [2025-03-14 01:45:51,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:51,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash 127504730, now seen corresponding path program 1 times [2025-03-14 01:45:51,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:51,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137553009] [2025-03-14 01:45:51,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:51,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:51,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-14 01:45:51,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-14 01:45:51,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:51,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137553009] [2025-03-14 01:45:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137553009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:51,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:51,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:51,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902369995] [2025-03-14 01:45:51,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:51,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:51,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:51,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:51,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:51,883 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 267 [2025-03-14 01:45:51,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 247 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-03-14 01:45:51,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:51,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 267 [2025-03-14 01:45:51,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:51,989 INFO L124 PetriNetUnfolderBase]: 19/449 cut-off events. [2025-03-14 01:45:51,990 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2025-03-14 01:45:51,992 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 449 events. 19/449 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1622 event pairs, 7 based on Foata normal form. 15/388 useless extension candidates. Maximal degree in co-relation 311. Up to 31 conditions per place. [2025-03-14 01:45:51,994 INFO L140 encePairwiseOnDemand]: 258/267 looper letters, 13 selfloop transitions, 2 changer transitions 3/240 dead transitions. [2025-03-14 01:45:51,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 240 transitions, 528 flow [2025-03-14 01:45:51,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:51,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 748 transitions. [2025-03-14 01:45:52,009 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9338327091136079 [2025-03-14 01:45:52,012 INFO L175 Difference]: Start difference. First operand has 246 places, 247 transitions, 512 flow. Second operand 3 states and 748 transitions. [2025-03-14 01:45:52,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 240 transitions, 528 flow [2025-03-14 01:45:52,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 240 transitions, 516 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-14 01:45:52,022 INFO L231 Difference]: Finished difference. Result has 241 places, 237 transitions, 484 flow [2025-03-14 01:45:52,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=486, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=484, PETRI_PLACES=241, PETRI_TRANSITIONS=237} [2025-03-14 01:45:52,029 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -5 predicate places. [2025-03-14 01:45:52,029 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 237 transitions, 484 flow [2025-03-14 01:45:52,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-03-14 01:45:52,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,030 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] [2025-03-14 01:45:52,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:45:52,030 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:52,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1521568871, now seen corresponding path program 1 times [2025-03-14 01:45:52,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,032 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230631516] [2025-03-14 01:45:52,032 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-14 01:45:52,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-14 01:45:52,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230631516] [2025-03-14 01:45:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230631516] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980943574] [2025-03-14 01:45:52,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:52,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:52,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:52,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 242 out of 267 [2025-03-14 01:45:52,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 237 transitions, 484 flow. Second operand has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-03-14 01:45:52,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 242 of 267 [2025-03-14 01:45:52,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,169 INFO L124 PetriNetUnfolderBase]: 13/339 cut-off events. [2025-03-14 01:45:52,170 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:45:52,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 339 events. 13/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1050 event pairs, 5 based on Foata normal form. 0/289 useless extension candidates. Maximal degree in co-relation 346. Up to 27 conditions per place. [2025-03-14 01:45:52,172 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 13 selfloop transitions, 2 changer transitions 0/236 dead transitions. [2025-03-14 01:45:52,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 236 transitions, 512 flow [2025-03-14 01:45:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 742 transitions. [2025-03-14 01:45:52,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9263420724094882 [2025-03-14 01:45:52,174 INFO L175 Difference]: Start difference. First operand has 241 places, 237 transitions, 484 flow. Second operand 3 states and 742 transitions. [2025-03-14 01:45:52,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 236 transitions, 512 flow [2025-03-14 01:45:52,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 236 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:52,178 INFO L231 Difference]: Finished difference. Result has 237 places, 236 transitions, 482 flow [2025-03-14 01:45:52,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=482, PETRI_PLACES=237, PETRI_TRANSITIONS=236} [2025-03-14 01:45:52,179 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -9 predicate places. [2025-03-14 01:45:52,180 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 236 transitions, 482 flow [2025-03-14 01:45:52,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.33333333333334) internal successors, (730), 3 states have internal predecessors, (730), 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-03-14 01:45:52,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,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] [2025-03-14 01:45:52,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:45:52,181 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:52,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,181 INFO L85 PathProgramCache]: Analyzing trace with hash -810100995, now seen corresponding path program 1 times [2025-03-14 01:45:52,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849892349] [2025-03-14 01:45:52,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:45:52,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:45:52,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849892349] [2025-03-14 01:45:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849892349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:52,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666647062] [2025-03-14 01:45:52,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:52,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:52,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:52,255 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 267 [2025-03-14 01:45:52,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 236 transitions, 482 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-03-14 01:45:52,256 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:52,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 267 [2025-03-14 01:45:52,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:52,318 INFO L124 PetriNetUnfolderBase]: 25/432 cut-off events. [2025-03-14 01:45:52,319 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-14 01:45:52,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 432 events. 25/432 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1668 event pairs, 12 based on Foata normal form. 0/368 useless extension candidates. Maximal degree in co-relation 452. Up to 46 conditions per place. [2025-03-14 01:45:52,323 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 14 selfloop transitions, 1 changer transitions 0/232 dead transitions. [2025-03-14 01:45:52,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 232 transitions, 504 flow [2025-03-14 01:45:52,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:52,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-03-14 01:45:52,328 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225967540574282 [2025-03-14 01:45:52,328 INFO L175 Difference]: Start difference. First operand has 237 places, 236 transitions, 482 flow. Second operand 3 states and 739 transitions. [2025-03-14 01:45:52,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 232 transitions, 504 flow [2025-03-14 01:45:52,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 232 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:52,333 INFO L231 Difference]: Finished difference. Result has 233 places, 232 transitions, 472 flow [2025-03-14 01:45:52,335 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=472, PETRI_PLACES=233, PETRI_TRANSITIONS=232} [2025-03-14 01:45:52,336 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2025-03-14 01:45:52,336 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 232 transitions, 472 flow [2025-03-14 01:45:52,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-03-14 01:45:52,336 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:52,337 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:52,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:45:52,337 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:52,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:52,338 INFO L85 PathProgramCache]: Analyzing trace with hash -301283110, now seen corresponding path program 1 times [2025-03-14 01:45:52,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:52,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973035749] [2025-03-14 01:45:52,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:52,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:52,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:45:52,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:45:52,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:52,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:52,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:52,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973035749] [2025-03-14 01:45:52,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973035749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:52,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:52,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609196648] [2025-03-14 01:45:52,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:52,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:52,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:52,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:52,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:53,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 267 [2025-03-14 01:45:53,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 232 transitions, 472 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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-03-14 01:45:53,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 267 [2025-03-14 01:45:53,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,347 INFO L124 PetriNetUnfolderBase]: 394/2186 cut-off events. [2025-03-14 01:45:53,347 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-03-14 01:45:53,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2804 conditions, 2186 events. 394/2186 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 17801 event pairs, 264 based on Foata normal form. 0/1780 useless extension candidates. Maximal degree in co-relation 2766. Up to 579 conditions per place. [2025-03-14 01:45:53,366 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 26 selfloop transitions, 5 changer transitions 0/231 dead transitions. [2025-03-14 01:45:53,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 231 transitions, 532 flow [2025-03-14 01:45:53,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:53,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:53,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1394 transitions. [2025-03-14 01:45:53,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8701622971285893 [2025-03-14 01:45:53,370 INFO L175 Difference]: Start difference. First operand has 233 places, 232 transitions, 472 flow. Second operand 6 states and 1394 transitions. [2025-03-14 01:45:53,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 231 transitions, 532 flow [2025-03-14 01:45:53,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 231 transitions, 531 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:53,374 INFO L231 Difference]: Finished difference. Result has 236 places, 231 transitions, 479 flow [2025-03-14 01:45:53,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=469, PETRI_DIFFERENCE_MINUEND_PLACES=231, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=236, PETRI_TRANSITIONS=231} [2025-03-14 01:45:53,375 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -10 predicate places. [2025-03-14 01:45:53,375 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 231 transitions, 479 flow [2025-03-14 01:45:53,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 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-03-14 01:45:53,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,376 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:45:53,377 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:53,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1396691977, now seen corresponding path program 1 times [2025-03-14 01:45:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449389089] [2025-03-14 01:45:53,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-14 01:45:53,391 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-14 01:45:53,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449389089] [2025-03-14 01:45:53,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449389089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450248478] [2025-03-14 01:45:53,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 267 [2025-03-14 01:45:53,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 231 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-03-14 01:45:53,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 267 [2025-03-14 01:45:53,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,488 INFO L124 PetriNetUnfolderBase]: 24/402 cut-off events. [2025-03-14 01:45:53,489 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:45:53,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 402 events. 24/402 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1537 event pairs, 15 based on Foata normal form. 0/352 useless extension candidates. Maximal degree in co-relation 441. Up to 40 conditions per place. [2025-03-14 01:45:53,492 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 12 selfloop transitions, 2 changer transitions 0/230 dead transitions. [2025-03-14 01:45:53,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 505 flow [2025-03-14 01:45:53,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 744 transitions. [2025-03-14 01:45:53,494 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288389513108615 [2025-03-14 01:45:53,494 INFO L175 Difference]: Start difference. First operand has 236 places, 231 transitions, 479 flow. Second operand 3 states and 744 transitions. [2025-03-14 01:45:53,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 505 flow [2025-03-14 01:45:53,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 230 transitions, 495 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:53,497 INFO L231 Difference]: Finished difference. Result has 232 places, 230 transitions, 471 flow [2025-03-14 01:45:53,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=230, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=228, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=232, PETRI_TRANSITIONS=230} [2025-03-14 01:45:53,498 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -14 predicate places. [2025-03-14 01:45:53,498 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 230 transitions, 471 flow [2025-03-14 01:45:53,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-03-14 01:45:53,499 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,499 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:45:53,499 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:53,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1215245863, now seen corresponding path program 1 times [2025-03-14 01:45:53,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669009417] [2025-03-14 01:45:53,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-03-14 01:45:53,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-03-14 01:45:53,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669009417] [2025-03-14 01:45:53,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669009417] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001692483] [2025-03-14 01:45:53,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 267 [2025-03-14 01:45:53,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 230 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-03-14 01:45:53,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 267 [2025-03-14 01:45:53,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,628 INFO L124 PetriNetUnfolderBase]: 37/538 cut-off events. [2025-03-14 01:45:53,628 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-03-14 01:45:53,630 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 538 events. 37/538 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2441 event pairs, 20 based on Foata normal form. 0/466 useless extension candidates. Maximal degree in co-relation 567. Up to 56 conditions per place. [2025-03-14 01:45:53,632 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 14 selfloop transitions, 1 changer transitions 0/226 dead transitions. [2025-03-14 01:45:53,632 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 226 transitions, 493 flow [2025-03-14 01:45:53,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 739 transitions. [2025-03-14 01:45:53,634 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9225967540574282 [2025-03-14 01:45:53,634 INFO L175 Difference]: Start difference. First operand has 232 places, 230 transitions, 471 flow. Second operand 3 states and 739 transitions. [2025-03-14 01:45:53,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 226 transitions, 493 flow [2025-03-14 01:45:53,636 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 226 transitions, 489 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,638 INFO L231 Difference]: Finished difference. Result has 228 places, 226 transitions, 461 flow [2025-03-14 01:45:53,638 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=459, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=228, PETRI_TRANSITIONS=226} [2025-03-14 01:45:53,639 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2025-03-14 01:45:53,640 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 226 transitions, 461 flow [2025-03-14 01:45:53,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 241.0) internal successors, (723), 3 states have internal predecessors, (723), 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-03-14 01:45:53,641 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,641 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:45:53,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:53,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,643 INFO L85 PathProgramCache]: Analyzing trace with hash -2079452099, now seen corresponding path program 1 times [2025-03-14 01:45:53,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611047314] [2025-03-14 01:45:53,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-14 01:45:53,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-14 01:45:53,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611047314] [2025-03-14 01:45:53,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611047314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542220646] [2025-03-14 01:45:53,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,709 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-03-14 01:45:53,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 226 transitions, 461 flow. Second operand has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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-03-14 01:45:53,710 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-03-14 01:45:53,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,753 INFO L124 PetriNetUnfolderBase]: 13/333 cut-off events. [2025-03-14 01:45:53,753 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:45:53,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 370 conditions, 333 events. 13/333 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 933 event pairs, 2 based on Foata normal form. 0/302 useless extension candidates. Maximal degree in co-relation 332. Up to 12 conditions per place. [2025-03-14 01:45:53,755 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 10 selfloop transitions, 3 changer transitions 0/226 dead transitions. [2025-03-14 01:45:53,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 226 transitions, 489 flow [2025-03-14 01:45:53,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-03-14 01:45:53,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2025-03-14 01:45:53,758 INFO L175 Difference]: Start difference. First operand has 228 places, 226 transitions, 461 flow. Second operand 3 states and 753 transitions. [2025-03-14 01:45:53,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 226 transitions, 489 flow [2025-03-14 01:45:53,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 227 places, 226 transitions, 488 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:53,761 INFO L231 Difference]: Finished difference. Result has 227 places, 224 transitions, 462 flow [2025-03-14 01:45:53,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=225, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=227, PETRI_TRANSITIONS=224} [2025-03-14 01:45:53,762 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -19 predicate places. [2025-03-14 01:45:53,762 INFO L471 AbstractCegarLoop]: Abstraction has has 227 places, 224 transitions, 462 flow [2025-03-14 01:45:53,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.0) internal successors, (741), 3 states have internal predecessors, (741), 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-03-14 01:45:53,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,762 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:45:53,763 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:53,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1193658050, now seen corresponding path program 1 times [2025-03-14 01:45:53,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872092773] [2025-03-14 01:45:53,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-03-14 01:45:53,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-03-14 01:45:53,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:53,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:53,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:53,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:53,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872092773] [2025-03-14 01:45:53,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872092773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:53,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:53,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:53,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985448884] [2025-03-14 01:45:53,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:53,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:53,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:53,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:53,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:53,824 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 267 [2025-03-14 01:45:53,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 227 places, 224 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-03-14 01:45:53,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:53,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 267 [2025-03-14 01:45:53,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:53,941 INFO L124 PetriNetUnfolderBase]: 114/1110 cut-off events. [2025-03-14 01:45:53,941 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-14 01:45:53,945 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1309 conditions, 1110 events. 114/1110 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 7419 event pairs, 22 based on Foata normal form. 0/965 useless extension candidates. Maximal degree in co-relation 1271. Up to 161 conditions per place. [2025-03-14 01:45:53,949 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 18 selfloop transitions, 3 changer transitions 0/229 dead transitions. [2025-03-14 01:45:53,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 229 transitions, 519 flow [2025-03-14 01:45:53,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:53,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:53,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-03-14 01:45:53,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2025-03-14 01:45:53,951 INFO L175 Difference]: Start difference. First operand has 227 places, 224 transitions, 462 flow. Second operand 3 states and 753 transitions. [2025-03-14 01:45:53,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 229 transitions, 519 flow [2025-03-14 01:45:53,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 229 transitions, 513 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:53,957 INFO L231 Difference]: Finished difference. Result has 225 places, 224 transitions, 471 flow [2025-03-14 01:45:53,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=471, PETRI_PLACES=225, PETRI_TRANSITIONS=224} [2025-03-14 01:45:53,959 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2025-03-14 01:45:53,960 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 224 transitions, 471 flow [2025-03-14 01:45:53,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.33333333333334) internal successors, (733), 3 states have internal predecessors, (733), 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-03-14 01:45:53,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:53,960 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:45:53,961 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:53,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1809115272, now seen corresponding path program 1 times [2025-03-14 01:45:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:53,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40304891] [2025-03-14 01:45:53,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:53,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:53,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-03-14 01:45:53,999 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-03-14 01:45:54,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:54,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:54,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:54,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:54,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40304891] [2025-03-14 01:45:54,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40304891] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:54,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:54,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:54,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437172382] [2025-03-14 01:45:54,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:54,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:54,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:54,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:54,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-03-14 01:45:54,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 224 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-03-14 01:45:54,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:54,033 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-03-14 01:45:54,033 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:54,080 INFO L124 PetriNetUnfolderBase]: 54/548 cut-off events. [2025-03-14 01:45:54,080 INFO L125 PetriNetUnfolderBase]: For 13/23 co-relation queries the response was YES. [2025-03-14 01:45:54,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 666 conditions, 548 events. 54/548 cut-off events. For 13/23 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2448 event pairs, 5 based on Foata normal form. 1/495 useless extension candidates. Maximal degree in co-relation 628. Up to 40 conditions per place. [2025-03-14 01:45:54,084 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 10 selfloop transitions, 3 changer transitions 0/224 dead transitions. [2025-03-14 01:45:54,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 224 transitions, 499 flow [2025-03-14 01:45:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:54,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 753 transitions. [2025-03-14 01:45:54,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9400749063670412 [2025-03-14 01:45:54,086 INFO L175 Difference]: Start difference. First operand has 225 places, 224 transitions, 471 flow. Second operand 3 states and 753 transitions. [2025-03-14 01:45:54,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 224 transitions, 499 flow [2025-03-14 01:45:54,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 224 transitions, 499 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:45:54,089 INFO L231 Difference]: Finished difference. Result has 225 places, 222 transitions, 473 flow [2025-03-14 01:45:54,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=225, PETRI_TRANSITIONS=222} [2025-03-14 01:45:54,090 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -21 predicate places. [2025-03-14 01:45:54,090 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 222 transitions, 473 flow [2025-03-14 01:45:54,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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-03-14 01:45:54,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:54,091 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:54,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:45:54,091 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:54,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash -805394271, now seen corresponding path program 1 times [2025-03-14 01:45:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:54,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274935796] [2025-03-14 01:45:54,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:54,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-14 01:45:54,107 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-14 01:45:54,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:54,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:54,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:54,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:54,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274935796] [2025-03-14 01:45:54,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274935796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:54,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:54,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-14 01:45:54,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501329205] [2025-03-14 01:45:54,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:54,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-14 01:45:54,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:54,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-14 01:45:54,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-14 01:45:54,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-03-14 01:45:54,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 222 transitions, 473 flow. Second operand has 7 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 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-03-14 01:45:54,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:54,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-03-14 01:45:54,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:54,499 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([641] thread3EXIT-->L89-9: Formula: (and (= 0 v_thread3Thread1of1ForFork1_thidvar3_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork1_thidvar0_4) (= 0 v_thread3Thread1of1ForFork1_thidvar1_4) (= 0 v_thread3Thread1of1ForFork1_thidvar2_4)) InVars {ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} OutVars{ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork1_thidvar0=v_thread3Thread1of1ForFork1_thidvar0_4, thread3Thread1of1ForFork1_thidvar3=v_thread3Thread1of1ForFork1_thidvar3_4, thread3Thread1of1ForFork1_thidvar1=v_thread3Thread1of1ForFork1_thidvar1_4, thread3Thread1of1ForFork1_thidvar2=v_thread3Thread1of1ForFork1_thidvar2_4} AuxVars[] AssignedVars[][234], [288#(= |#race~M~0| 0), 299#true, Black: 292#true, 294#(= |#race~A~0| 0), 276#(= |#race~N~0| 0), 66#L89-9true, 296#true]) [2025-03-14 01:45:54,500 INFO L294 olderBase$Statistics]: this new event has 206 ancestors and is cut-off event [2025-03-14 01:45:54,501 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-03-14 01:45:54,501 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-14 01:45:54,501 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2025-03-14 01:45:54,501 INFO L124 PetriNetUnfolderBase]: 56/741 cut-off events. [2025-03-14 01:45:54,501 INFO L125 PetriNetUnfolderBase]: For 9/32 co-relation queries the response was YES. [2025-03-14 01:45:54,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 741 events. 56/741 cut-off events. For 9/32 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3640 event pairs, 18 based on Foata normal form. 5/687 useless extension candidates. Maximal degree in co-relation 884. Up to 62 conditions per place. [2025-03-14 01:45:54,506 INFO L140 encePairwiseOnDemand]: 254/267 looper letters, 22 selfloop transitions, 14 changer transitions 0/237 dead transitions. [2025-03-14 01:45:54,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 237 transitions, 583 flow [2025-03-14 01:45:54,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-14 01:45:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-03-14 01:45:54,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 2417 transitions. [2025-03-14 01:45:54,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9052434456928838 [2025-03-14 01:45:54,510 INFO L175 Difference]: Start difference. First operand has 225 places, 222 transitions, 473 flow. Second operand 10 states and 2417 transitions. [2025-03-14 01:45:54,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 237 transitions, 583 flow [2025-03-14 01:45:54,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 237 transitions, 577 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:54,516 INFO L231 Difference]: Finished difference. Result has 236 places, 229 transitions, 533 flow [2025-03-14 01:45:54,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=533, PETRI_PLACES=236, PETRI_TRANSITIONS=229} [2025-03-14 01:45:54,518 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -10 predicate places. [2025-03-14 01:45:54,518 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 229 transitions, 533 flow [2025-03-14 01:45:54,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 239.85714285714286) internal successors, (1679), 7 states have internal predecessors, (1679), 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-03-14 01:45:54,519 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:54,519 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:54,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:45:54,520 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:54,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:54,520 INFO L85 PathProgramCache]: Analyzing trace with hash 2057171420, now seen corresponding path program 1 times [2025-03-14 01:45:54,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:54,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-14 01:45:54,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:54,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:54,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-14 01:45:54,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-14 01:45:54,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:54,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:54,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:54,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:54,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-14 01:45:54,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021851520] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:54,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:54,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:54,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669064527] [2025-03-14 01:45:54,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:54,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-14 01:45:54,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:54,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-14 01:45:54,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-14 01:45:54,649 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 267 [2025-03-14 01:45:54,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 229 transitions, 533 flow. Second operand has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-03-14 01:45:54,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:54,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 267 [2025-03-14 01:45:54,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:54,809 INFO L124 PetriNetUnfolderBase]: 100/1221 cut-off events. [2025-03-14 01:45:54,809 INFO L125 PetriNetUnfolderBase]: For 62/103 co-relation queries the response was YES. [2025-03-14 01:45:54,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1547 conditions, 1221 events. 100/1221 cut-off events. For 62/103 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 8052 event pairs, 35 based on Foata normal form. 10/1133 useless extension candidates. Maximal degree in co-relation 1498. Up to 111 conditions per place. [2025-03-14 01:45:54,823 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 24 selfloop transitions, 5 changer transitions 0/240 dead transitions. [2025-03-14 01:45:54,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 240 transitions, 621 flow [2025-03-14 01:45:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-14 01:45:54,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-14 01:45:54,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1230 transitions. [2025-03-14 01:45:54,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213483146067416 [2025-03-14 01:45:54,827 INFO L175 Difference]: Start difference. First operand has 236 places, 229 transitions, 533 flow. Second operand 5 states and 1230 transitions. [2025-03-14 01:45:54,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 240 transitions, 621 flow [2025-03-14 01:45:54,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 240 transitions, 617 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:45:54,831 INFO L231 Difference]: Finished difference. Result has 241 places, 231 transitions, 554 flow [2025-03-14 01:45:54,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=529, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=224, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=554, PETRI_PLACES=241, PETRI_TRANSITIONS=231} [2025-03-14 01:45:54,832 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -5 predicate places. [2025-03-14 01:45:54,832 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 231 transitions, 554 flow [2025-03-14 01:45:54,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 242.0) internal successors, (1210), 5 states have internal predecessors, (1210), 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-03-14 01:45:54,833 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:54,833 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:54,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:45:54,833 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:54,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:54,834 INFO L85 PathProgramCache]: Analyzing trace with hash 943510292, now seen corresponding path program 1 times [2025-03-14 01:45:54,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:54,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-03-14 01:45:54,834 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:54,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:54,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-14 01:45:54,843 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-14 01:45:54,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:54,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:54,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:54,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842773125] [2025-03-14 01:45:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [842773125] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:54,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073444720] [2025-03-14 01:45:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:54,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:54,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:54,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:54,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:54,872 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-03-14 01:45:54,873 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 231 transitions, 554 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-03-14 01:45:54,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:54,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-03-14 01:45:54,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:54,972 INFO L124 PetriNetUnfolderBase]: 128/1093 cut-off events. [2025-03-14 01:45:54,972 INFO L125 PetriNetUnfolderBase]: For 86/99 co-relation queries the response was YES. [2025-03-14 01:45:54,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1466 conditions, 1093 events. 128/1093 cut-off events. For 86/99 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 6990 event pairs, 11 based on Foata normal form. 8/1035 useless extension candidates. Maximal degree in co-relation 1419. Up to 129 conditions per place. [2025-03-14 01:45:54,980 INFO L140 encePairwiseOnDemand]: 262/267 looper letters, 8 selfloop transitions, 2 changer transitions 6/231 dead transitions. [2025-03-14 01:45:54,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 231 transitions, 580 flow [2025-03-14 01:45:54,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:54,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:54,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 752 transitions. [2025-03-14 01:45:54,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9388264669163545 [2025-03-14 01:45:54,983 INFO L175 Difference]: Start difference. First operand has 241 places, 231 transitions, 554 flow. Second operand 3 states and 752 transitions. [2025-03-14 01:45:54,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 231 transitions, 580 flow [2025-03-14 01:45:54,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 231 transitions, 575 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:54,988 INFO L231 Difference]: Finished difference. Result has 239 places, 223 transitions, 536 flow [2025-03-14 01:45:54,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=545, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=227, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=239, PETRI_TRANSITIONS=223} [2025-03-14 01:45:54,989 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -7 predicate places. [2025-03-14 01:45:54,990 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 223 transitions, 536 flow [2025-03-14 01:45:54,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-03-14 01:45:54,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:54,991 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:54,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:45:54,991 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:54,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:54,992 INFO L85 PathProgramCache]: Analyzing trace with hash -160670737, now seen corresponding path program 1 times [2025-03-14 01:45:54,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:54,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486778926] [2025-03-14 01:45:54,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:54,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:54,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-14 01:45:55,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-14 01:45:55,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:55,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:55,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:55,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:55,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486778926] [2025-03-14 01:45:55,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486778926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:55,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:55,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217523571] [2025-03-14 01:45:55,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:55,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:55,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:55,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:55,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:55,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-03-14 01:45:55,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 239 places, 223 transitions, 536 flow. Second operand has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-03-14 01:45:55,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:55,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-03-14 01:45:55,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:55,589 INFO L124 PetriNetUnfolderBase]: 111/1171 cut-off events. [2025-03-14 01:45:55,589 INFO L125 PetriNetUnfolderBase]: For 138/147 co-relation queries the response was YES. [2025-03-14 01:45:55,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1613 conditions, 1171 events. 111/1171 cut-off events. For 138/147 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7412 event pairs, 32 based on Foata normal form. 0/1090 useless extension candidates. Maximal degree in co-relation 1565. Up to 124 conditions per place. [2025-03-14 01:45:55,603 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 24 selfloop transitions, 5 changer transitions 0/230 dead transitions. [2025-03-14 01:45:55,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 230 transitions, 616 flow [2025-03-14 01:45:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:55,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-03-14 01:45:55,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9088639200998752 [2025-03-14 01:45:55,606 INFO L175 Difference]: Start difference. First operand has 239 places, 223 transitions, 536 flow. Second operand 6 states and 1456 transitions. [2025-03-14 01:45:55,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 230 transitions, 616 flow [2025-03-14 01:45:55,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 230 transitions, 612 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:55,611 INFO L231 Difference]: Finished difference. Result has 235 places, 222 transitions, 540 flow [2025-03-14 01:45:55,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=540, PETRI_PLACES=235, PETRI_TRANSITIONS=222} [2025-03-14 01:45:55,612 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -11 predicate places. [2025-03-14 01:45:55,612 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 222 transitions, 540 flow [2025-03-14 01:45:55,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-03-14 01:45:55,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:55,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:55,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:45:55,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:55,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:55,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1098353672, now seen corresponding path program 1 times [2025-03-14 01:45:55,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:55,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542229193] [2025-03-14 01:45:55,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:55,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:55,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-14 01:45:55,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-14 01:45:55,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:55,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:55,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:55,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:55,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542229193] [2025-03-14 01:45:55,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542229193] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:55,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:55,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:55,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345138726] [2025-03-14 01:45:55,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:55,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:55,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:55,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:55,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:56,080 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-03-14 01:45:56,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 222 transitions, 540 flow. Second operand has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 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-03-14 01:45:56,082 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:56,082 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-03-14 01:45:56,082 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:56,223 INFO L124 PetriNetUnfolderBase]: 181/1135 cut-off events. [2025-03-14 01:45:56,224 INFO L125 PetriNetUnfolderBase]: For 138/203 co-relation queries the response was YES. [2025-03-14 01:45:56,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1619 conditions, 1135 events. 181/1135 cut-off events. For 138/203 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 7210 event pairs, 44 based on Foata normal form. 8/1072 useless extension candidates. Maximal degree in co-relation 1571. Up to 173 conditions per place. [2025-03-14 01:45:56,232 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 22 selfloop transitions, 5 changer transitions 0/229 dead transitions. [2025-03-14 01:45:56,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 229 transitions, 616 flow [2025-03-14 01:45:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:56,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-03-14 01:45:56,235 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9088639200998752 [2025-03-14 01:45:56,235 INFO L175 Difference]: Start difference. First operand has 235 places, 222 transitions, 540 flow. Second operand 6 states and 1456 transitions. [2025-03-14 01:45:56,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 229 transitions, 616 flow [2025-03-14 01:45:56,237 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 234 places, 229 transitions, 606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:56,238 INFO L231 Difference]: Finished difference. Result has 234 places, 221 transitions, 538 flow [2025-03-14 01:45:56,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=528, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=538, PETRI_PLACES=234, PETRI_TRANSITIONS=221} [2025-03-14 01:45:56,239 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -12 predicate places. [2025-03-14 01:45:56,239 INFO L471 AbstractCegarLoop]: Abstraction has has 234 places, 221 transitions, 538 flow [2025-03-14 01:45:56,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 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-03-14 01:45:56,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:56,240 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:56,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:45:56,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:56,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:56,241 INFO L85 PathProgramCache]: Analyzing trace with hash 951096322, now seen corresponding path program 1 times [2025-03-14 01:45:56,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:56,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286191650] [2025-03-14 01:45:56,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:56,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:56,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-14 01:45:56,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-14 01:45:56,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:56,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:56,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:45:56,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:56,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286191650] [2025-03-14 01:45:56,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286191650] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:56,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:56,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:45:56,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779214396] [2025-03-14 01:45:56,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:56,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:45:56,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:56,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:45:56,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:45:56,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 267 [2025-03-14 01:45:56,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 221 transitions, 538 flow. Second operand has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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-03-14 01:45:56,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:56,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 267 [2025-03-14 01:45:56,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:56,771 INFO L124 PetriNetUnfolderBase]: 90/1045 cut-off events. [2025-03-14 01:45:56,771 INFO L125 PetriNetUnfolderBase]: For 76/98 co-relation queries the response was YES. [2025-03-14 01:45:56,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1515 conditions, 1045 events. 90/1045 cut-off events. For 76/98 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6360 event pairs, 27 based on Foata normal form. 4/1004 useless extension candidates. Maximal degree in co-relation 1467. Up to 118 conditions per place. [2025-03-14 01:45:56,780 INFO L140 encePairwiseOnDemand]: 261/267 looper letters, 24 selfloop transitions, 5 changer transitions 0/228 dead transitions. [2025-03-14 01:45:56,781 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 238 places, 228 transitions, 618 flow [2025-03-14 01:45:56,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:45:56,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:45:56,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1456 transitions. [2025-03-14 01:45:56,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9088639200998752 [2025-03-14 01:45:56,783 INFO L175 Difference]: Start difference. First operand has 234 places, 221 transitions, 538 flow. Second operand 6 states and 1456 transitions. [2025-03-14 01:45:56,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 238 places, 228 transitions, 618 flow [2025-03-14 01:45:56,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 228 transitions, 608 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:56,787 INFO L231 Difference]: Finished difference. Result has 233 places, 220 transitions, 536 flow [2025-03-14 01:45:56,788 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=536, PETRI_PLACES=233, PETRI_TRANSITIONS=220} [2025-03-14 01:45:56,788 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -13 predicate places. [2025-03-14 01:45:56,788 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 220 transitions, 536 flow [2025-03-14 01:45:56,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 240.16666666666666) internal successors, (1441), 6 states have internal predecessors, (1441), 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-03-14 01:45:56,789 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:56,789 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:56,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:45:56,789 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:56,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:56,790 INFO L85 PathProgramCache]: Analyzing trace with hash -252384271, now seen corresponding path program 1 times [2025-03-14 01:45:56,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:56,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085668238] [2025-03-14 01:45:56,790 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:56,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:56,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-14 01:45:56,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-14 01:45:56,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:56,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:56,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:45:56,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:56,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085668238] [2025-03-14 01:45:56,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085668238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:56,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:56,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:56,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724961754] [2025-03-14 01:45:56,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:56,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:56,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:56,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:56,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:56,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-03-14 01:45:56,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 220 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-03-14 01:45:56,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:56,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-03-14 01:45:56,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:56,923 INFO L124 PetriNetUnfolderBase]: 83/1041 cut-off events. [2025-03-14 01:45:56,923 INFO L125 PetriNetUnfolderBase]: For 46/51 co-relation queries the response was YES. [2025-03-14 01:45:56,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1373 conditions, 1041 events. 83/1041 cut-off events. For 46/51 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6071 event pairs, 19 based on Foata normal form. 0/994 useless extension candidates. Maximal degree in co-relation 1326. Up to 86 conditions per place. [2025-03-14 01:45:56,932 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 10 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-03-14 01:45:56,932 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 221 transitions, 564 flow [2025-03-14 01:45:56,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:56,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:56,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2025-03-14 01:45:56,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375780274656679 [2025-03-14 01:45:56,934 INFO L175 Difference]: Start difference. First operand has 233 places, 220 transitions, 536 flow. Second operand 3 states and 751 transitions. [2025-03-14 01:45:56,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 221 transitions, 564 flow [2025-03-14 01:45:56,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 221 transitions, 554 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:45:56,938 INFO L231 Difference]: Finished difference. Result has 229 places, 219 transitions, 528 flow [2025-03-14 01:45:56,938 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=229, PETRI_TRANSITIONS=219} [2025-03-14 01:45:56,939 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -17 predicate places. [2025-03-14 01:45:56,939 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 219 transitions, 528 flow [2025-03-14 01:45:56,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.0) internal successors, (744), 3 states have internal predecessors, (744), 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-03-14 01:45:56,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:56,940 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:56,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:45:56,940 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:56,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1646970694, now seen corresponding path program 1 times [2025-03-14 01:45:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:56,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15449690] [2025-03-14 01:45:56,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:56,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:56,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-14 01:45:56,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-14 01:45:56,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:56,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:56,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:45:56,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:56,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15449690] [2025-03-14 01:45:56,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15449690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:56,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:56,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:56,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863238672] [2025-03-14 01:45:56,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:56,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:56,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:56,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:56,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:56,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-03-14 01:45:56,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 219 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-03-14 01:45:56,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:56,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-03-14 01:45:56,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:57,092 INFO L124 PetriNetUnfolderBase]: 141/1096 cut-off events. [2025-03-14 01:45:57,093 INFO L125 PetriNetUnfolderBase]: For 99/120 co-relation queries the response was YES. [2025-03-14 01:45:57,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1096 events. 141/1096 cut-off events. For 99/120 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 6754 event pairs, 40 based on Foata normal form. 0/1044 useless extension candidates. Maximal degree in co-relation 1430. Up to 169 conditions per place. [2025-03-14 01:45:57,098 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 10 selfloop transitions, 2 changer transitions 6/220 dead transitions. [2025-03-14 01:45:57,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 220 transitions, 556 flow [2025-03-14 01:45:57,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2025-03-14 01:45:57,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375780274656679 [2025-03-14 01:45:57,099 INFO L175 Difference]: Start difference. First operand has 229 places, 219 transitions, 528 flow. Second operand 3 states and 751 transitions. [2025-03-14 01:45:57,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 220 transitions, 556 flow [2025-03-14 01:45:57,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 220 transitions, 552 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:45:57,102 INFO L231 Difference]: Finished difference. Result has 228 places, 212 transitions, 494 flow [2025-03-14 01:45:57,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=522, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=494, PETRI_PLACES=228, PETRI_TRANSITIONS=212} [2025-03-14 01:45:57,103 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -18 predicate places. [2025-03-14 01:45:57,103 INFO L471 AbstractCegarLoop]: Abstraction has has 228 places, 212 transitions, 494 flow [2025-03-14 01:45:57,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 248.33333333333334) internal successors, (745), 3 states have internal predecessors, (745), 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-03-14 01:45:57,104 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:45:57,104 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-14 01:45:57,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-14 01:45:57,104 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err4ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 42 more)] === [2025-03-14 01:45:57,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:45:57,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2024216060, now seen corresponding path program 1 times [2025-03-14 01:45:57,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:45:57,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323151496] [2025-03-14 01:45:57,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:45:57,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:45:57,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-14 01:45:57,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-14 01:45:57,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:45:57,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:45:57,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:45:57,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:45:57,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323151496] [2025-03-14 01:45:57,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323151496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:45:57,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:45:57,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:45:57,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623701485] [2025-03-14 01:45:57,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:45:57,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:45:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:45:57,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:45:57,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:45:57,145 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 246 out of 267 [2025-03-14 01:45:57,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 228 places, 212 transitions, 494 flow. Second operand has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-03-14 01:45:57,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:45:57,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 246 of 267 [2025-03-14 01:45:57,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:45:57,224 INFO L124 PetriNetUnfolderBase]: 69/990 cut-off events. [2025-03-14 01:45:57,225 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-03-14 01:45:57,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1262 conditions, 990 events. 69/990 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5932 event pairs, 19 based on Foata normal form. 1/961 useless extension candidates. Maximal degree in co-relation 1215. Up to 61 conditions per place. [2025-03-14 01:45:57,229 INFO L140 encePairwiseOnDemand]: 264/267 looper letters, 0 selfloop transitions, 0 changer transitions 213/213 dead transitions. [2025-03-14 01:45:57,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 213 transitions, 522 flow [2025-03-14 01:45:57,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:45:57,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:45:57,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 751 transitions. [2025-03-14 01:45:57,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9375780274656679 [2025-03-14 01:45:57,231 INFO L175 Difference]: Start difference. First operand has 228 places, 212 transitions, 494 flow. Second operand 3 states and 751 transitions. [2025-03-14 01:45:57,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 213 transitions, 522 flow [2025-03-14 01:45:57,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 213 transitions, 498 flow, removed 4 selfloop flow, removed 8 redundant places. [2025-03-14 01:45:57,234 INFO L231 Difference]: Finished difference. Result has 217 places, 0 transitions, 0 flow [2025-03-14 01:45:57,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=267, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=217, PETRI_TRANSITIONS=0} [2025-03-14 01:45:57,234 INFO L279 CegarLoopForPetriNet]: 246 programPoint places, -29 predicate places. [2025-03-14 01:45:57,234 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 0 transitions, 0 flow [2025-03-14 01:45:57,235 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.66666666666666) internal successors, (743), 3 states have internal predecessors, (743), 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-03-14 01:45:57,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 46 remaining) [2025-03-14 01:45:57,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (44 of 46 remaining) [2025-03-14 01:45:57,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (43 of 46 remaining) [2025-03-14 01:45:57,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (42 of 46 remaining) [2025-03-14 01:45:57,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (41 of 46 remaining) [2025-03-14 01:45:57,237 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (40 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (39 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (37 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (35 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (34 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (33 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (32 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (31 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (30 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (29 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (27 of 46 remaining) [2025-03-14 01:45:57,238 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (26 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (24 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (23 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (22 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (21 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (20 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (19 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (17 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (12 of 46 remaining) [2025-03-14 01:45:57,239 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (10 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (9 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (8 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (6 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 46 remaining) [2025-03-14 01:45:57,240 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 46 remaining) [2025-03-14 01:45:57,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:45:57,241 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:45:57,247 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-14 01:45:57,247 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-14 01:45:57,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.03 01:45:57 BasicIcfg [2025-03-14 01:45:57,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-14 01:45:57,252 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-14 01:45:57,252 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-14 01:45:57,252 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-14 01:45:57,253 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:45:51" (3/4) ... [2025-03-14 01:45:57,254 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-14 01:45:57,259 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-14 01:45:57,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-14 01:45:57,260 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-14 01:45:57,263 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2025-03-14 01:45:57,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-14 01:45:57,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-14 01:45:57,264 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-14 01:45:57,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-14 01:45:57,319 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-14 01:45:57,319 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-14 01:45:57,320 INFO L158 Benchmark]: Toolchain (without parser) took 6699.46ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 122.3MB in the beginning and 311.1MB in the end (delta: -188.8MB). Peak memory consumption was 96.5MB. Max. memory is 16.1GB. [2025-03-14 01:45:57,321 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:57,321 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.41ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:57,321 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.35ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:57,322 INFO L158 Benchmark]: Boogie Preprocessor took 21.53ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-14 01:45:57,322 INFO L158 Benchmark]: IcfgBuilder took 519.52ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 83.9MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-14 01:45:57,322 INFO L158 Benchmark]: TraceAbstraction took 5832.13ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 83.2MB in the beginning and 319.5MB in the end (delta: -236.3MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. [2025-03-14 01:45:57,322 INFO L158 Benchmark]: Witness Printer took 67.54ms. Allocated memory is still 453.0MB. Free memory was 319.5MB in the beginning and 311.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-14 01:45:57,325 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.24ms. Allocated memory is still 201.3MB. Free memory is still 116.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.41ms. Allocated memory is still 167.8MB. Free memory was 122.3MB in the beginning and 109.9MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.35ms. Allocated memory is still 167.8MB. Free memory was 109.9MB in the beginning and 108.3MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.53ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 519.52ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 83.9MB in the end (delta: 22.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5832.13ms. Allocated memory was 167.8MB in the beginning and 453.0MB in the end (delta: 285.2MB). Free memory was 83.2MB in the beginning and 319.5MB in the end (delta: -236.3MB). Peak memory consumption was 46.2MB. Max. memory is 16.1GB. * Witness Printer took 67.54ms. Allocated memory is still 453.0MB. Free memory was 319.5MB in the beginning and 311.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 101]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 361 locations, 46 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: 5.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 952 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 532 mSDsluCounter, 416 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 309 mSDsCounter, 171 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1517 IncrementalHoareTripleChecker+Invalid, 1688 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 171 mSolverCounterUnsat, 107 mSDtfsCounter, 1517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 65 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=554occurred in iteration=11, InterpolantAutomatonStates: 75, 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.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1540 NumberOfCodeBlocks, 1540 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1522 ConstructedInterpolants, 0 QuantifiedInterpolants, 2228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 3/3 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 - AllSpecificationsHoldResult: All specifications hold 27 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-14 01:45:57,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE