./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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/parallel-misc-1.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 faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:13:07,685 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:13:07,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:13:07,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:13:07,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:13:07,772 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:13:07,773 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:13:07,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:13:07,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:13:07,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:13:07,775 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:13:07,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:13:07,775 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:13:07,776 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:13:07,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:07,776 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:13:07,776 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:13:07,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:13:07,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:13:07,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:13:07,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:13:07,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:13:07,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:13:07,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:13:07,777 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 -> faddac23864cc4e42f962ac43a8d0f59593853dbb1d55e3baabe0c76b2187dd4 [2025-03-17 11:13:08,006 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:13:08,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:13:08,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:13:08,018 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:13:08,018 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:13:08,019 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-17 11:13:09,111 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51257a769/329d4aeb3e5e4722bbb2aca5fbe5d7d2/FLAG52fb06335 [2025-03-17 11:13:09,320 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:13:09,330 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/parallel-misc-1.wvr.c [2025-03-17 11:13:09,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51257a769/329d4aeb3e5e4722bbb2aca5fbe5d7d2/FLAG52fb06335 [2025-03-17 11:13:09,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51257a769/329d4aeb3e5e4722bbb2aca5fbe5d7d2 [2025-03-17 11:13:09,681 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:13:09,682 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:13:09,683 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:09,683 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:13:09,686 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:13:09,687 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:09,688 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@677499ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09, skipping insertion in model container [2025-03-17 11:13:09,689 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:09,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:13:09,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:09,879 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:13:09,914 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:13:09,932 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:13:09,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09 WrapperNode [2025-03-17 11:13:09,933 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:13:09,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:09,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:13:09,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:13:09,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:09,948 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:09,971 INFO L138 Inliner]: procedures = 22, calls = 32, calls flagged for inlining = 18, calls inlined = 32, statements flattened = 503 [2025-03-17 11:13:09,972 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:13:09,972 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:13:09,972 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:13:09,973 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:13:09,977 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:09,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:09,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:09,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:10,000 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:10,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:10,006 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:10,007 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:10,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:13:10,017 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:13:10,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:13:10,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:13:10,018 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (1/1) ... [2025-03-17 11:13:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:13:10,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:13:10,048 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-17 11:13:10,050 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-17 11:13:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:13:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-17 11:13:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-17 11:13:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-17 11:13:10,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-17 11:13:10,069 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:13:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:13:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:13:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:13:10,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:13:10,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:13:10,071 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:13:10,161 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:13:10,163 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:13:10,754 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:13:10,754 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:13:10,786 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:13:10,787 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:13:10,787 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:10 BoogieIcfgContainer [2025-03-17 11:13:10,787 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:13:10,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:13:10,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:13:10,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:13:10,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:13:09" (1/3) ... [2025-03-17 11:13:10,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24549e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:10, skipping insertion in model container [2025-03-17 11:13:10,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:13:09" (2/3) ... [2025-03-17 11:13:10,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24549e91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:13:10, skipping insertion in model container [2025-03-17 11:13:10,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:10" (3/3) ... [2025-03-17 11:13:10,795 INFO L128 eAbstractionObserver]: Analyzing ICFG parallel-misc-1.wvr.c [2025-03-17 11:13:10,807 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:13:10,810 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG parallel-misc-1.wvr.c that has 3 procedures, 674 locations, 1 initial locations, 3 loop locations, and 73 error locations. [2025-03-17 11:13:10,810 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:13:10,934 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-17 11:13:10,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 680 places, 705 transitions, 1424 flow [2025-03-17 11:13:11,200 INFO L124 PetriNetUnfolderBase]: 32/703 cut-off events. [2025-03-17 11:13:11,203 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:13:11,216 INFO L83 FinitePrefix]: Finished finitePrefix Result has 712 conditions, 703 events. 32/703 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 1908 event pairs, 0 based on Foata normal form. 0/598 useless extension candidates. Maximal degree in co-relation 456. Up to 2 conditions per place. [2025-03-17 11:13:11,217 INFO L82 GeneralOperation]: Start removeDead. Operand has 680 places, 705 transitions, 1424 flow [2025-03-17 11:13:11,229 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 662 places, 686 transitions, 1384 flow [2025-03-17 11:13:11,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:13:11,246 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;@514a510c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:13:11,246 INFO L334 AbstractCegarLoop]: Starting to check reachability of 123 error locations. [2025-03-17 11:13:11,251 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:13:11,252 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-17 11:13:11,253 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:13:11,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:11,253 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] [2025-03-17 11:13:11,254 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:11,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:11,259 INFO L85 PathProgramCache]: Analyzing trace with hash -661373047, now seen corresponding path program 1 times [2025-03-17 11:13:11,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:11,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18537389] [2025-03-17 11:13:11,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:11,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:11,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 11:13:11,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 11:13:11,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:11,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:11,386 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-17 11:13:11,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:11,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18537389] [2025-03-17 11:13:11,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18537389] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:11,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:11,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403355729] [2025-03-17 11:13:11,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:11,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:11,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:11,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:11,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:11,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-03-17 11:13:11,480 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 686 transitions, 1384 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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-17 11:13:11,480 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:11,480 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-03-17 11:13:11,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:11,777 INFO L124 PetriNetUnfolderBase]: 28/1966 cut-off events. [2025-03-17 11:13:11,777 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2025-03-17 11:13:11,783 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2021 conditions, 1966 events. 28/1966 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 10278 event pairs, 6 based on Foata normal form. 81/1737 useless extension candidates. Maximal degree in co-relation 1769. Up to 32 conditions per place. [2025-03-17 11:13:11,789 INFO L140 encePairwiseOnDemand]: 681/705 looper letters, 19 selfloop transitions, 2 changer transitions 3/664 dead transitions. [2025-03-17 11:13:11,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 664 transitions, 1382 flow [2025-03-17 11:13:11,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:11,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2020 transitions. [2025-03-17 11:13:11,802 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9550827423167849 [2025-03-17 11:13:11,803 INFO L175 Difference]: Start difference. First operand has 662 places, 686 transitions, 1384 flow. Second operand 3 states and 2020 transitions. [2025-03-17 11:13:11,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 664 transitions, 1382 flow [2025-03-17 11:13:11,809 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 664 transitions, 1374 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-17 11:13:11,818 INFO L231 Difference]: Finished difference. Result has 659 places, 661 transitions, 1330 flow [2025-03-17 11:13:11,821 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1332, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=664, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1330, PETRI_PLACES=659, PETRI_TRANSITIONS=661} [2025-03-17 11:13:11,824 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -3 predicate places. [2025-03-17 11:13:11,824 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 661 transitions, 1330 flow [2025-03-17 11:13:11,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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-17 11:13:11,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:11,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:11,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:13:11,826 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:11,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:11,826 INFO L85 PathProgramCache]: Analyzing trace with hash -1351079901, now seen corresponding path program 1 times [2025-03-17 11:13:11,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:11,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489552237] [2025-03-17 11:13:11,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:11,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:11,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-17 11:13:11,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-17 11:13:11,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:11,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:11,870 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-17 11:13:11,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:11,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489552237] [2025-03-17 11:13:11,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489552237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:11,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:11,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:11,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494200369] [2025-03-17 11:13:11,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:11,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:11,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:11,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:11,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:11,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-17 11:13:11,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 661 transitions, 1330 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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-17 11:13:11,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:11,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-17 11:13:11,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:12,036 INFO L124 PetriNetUnfolderBase]: 19/880 cut-off events. [2025-03-17 11:13:12,037 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-17 11:13:12,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 917 conditions, 880 events. 19/880 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3080 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 883. Up to 29 conditions per place. [2025-03-17 11:13:12,047 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/660 dead transitions. [2025-03-17 11:13:12,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 657 places, 660 transitions, 1360 flow [2025-03-17 11:13:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:12,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:12,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-17 11:13:12,054 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-17 11:13:12,054 INFO L175 Difference]: Start difference. First operand has 659 places, 661 transitions, 1330 flow. Second operand 3 states and 2009 transitions. [2025-03-17 11:13:12,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 657 places, 660 transitions, 1360 flow [2025-03-17 11:13:12,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 655 places, 660 transitions, 1356 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:12,066 INFO L231 Difference]: Finished difference. Result has 655 places, 660 transitions, 1328 flow [2025-03-17 11:13:12,067 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1324, PETRI_DIFFERENCE_MINUEND_PLACES=653, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=660, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=658, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1328, PETRI_PLACES=655, PETRI_TRANSITIONS=660} [2025-03-17 11:13:12,067 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -7 predicate places. [2025-03-17 11:13:12,067 INFO L471 AbstractCegarLoop]: Abstraction has has 655 places, 660 transitions, 1328 flow [2025-03-17 11:13:12,068 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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-17 11:13:12,069 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:12,069 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] [2025-03-17 11:13:12,069 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:13:12,069 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:12,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:12,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1851262581, now seen corresponding path program 1 times [2025-03-17 11:13:12,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:12,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085321800] [2025-03-17 11:13:12,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:12,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:12,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-17 11:13:12,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-17 11:13:12,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:12,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:12,125 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-17 11:13:12,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:12,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085321800] [2025-03-17 11:13:12,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085321800] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:12,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:12,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:12,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914285070] [2025-03-17 11:13:12,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:12,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:12,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:12,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:12,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:12,148 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-03-17 11:13:12,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 655 places, 660 transitions, 1328 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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-17 11:13:12,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:12,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-03-17 11:13:12,154 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:12,287 INFO L124 PetriNetUnfolderBase]: 13/876 cut-off events. [2025-03-17 11:13:12,287 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-03-17 11:13:12,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 896 conditions, 876 events. 13/876 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2749 event pairs, 1 based on Foata normal form. 0/746 useless extension candidates. Maximal degree in co-relation 854. Up to 11 conditions per place. [2025-03-17 11:13:12,298 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/659 dead transitions. [2025-03-17 11:13:12,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 656 places, 659 transitions, 1346 flow [2025-03-17 11:13:12,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:12,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-03-17 11:13:12,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-03-17 11:13:12,302 INFO L175 Difference]: Start difference. First operand has 655 places, 660 transitions, 1328 flow. Second operand 3 states and 2021 transitions. [2025-03-17 11:13:12,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 656 places, 659 transitions, 1346 flow [2025-03-17 11:13:12,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 654 places, 659 transitions, 1342 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:12,311 INFO L231 Difference]: Finished difference. Result has 654 places, 659 transitions, 1326 flow [2025-03-17 11:13:12,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1322, PETRI_DIFFERENCE_MINUEND_PLACES=652, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=659, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=657, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1326, PETRI_PLACES=654, PETRI_TRANSITIONS=659} [2025-03-17 11:13:12,312 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -8 predicate places. [2025-03-17 11:13:12,313 INFO L471 AbstractCegarLoop]: Abstraction has has 654 places, 659 transitions, 1326 flow [2025-03-17 11:13:12,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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-17 11:13:12,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:12,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:12,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:13:12,314 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:12,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:12,315 INFO L85 PathProgramCache]: Analyzing trace with hash -653458787, now seen corresponding path program 1 times [2025-03-17 11:13:12,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:12,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711300323] [2025-03-17 11:13:12,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:12,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 11:13:12,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 11:13:12,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:12,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:12,349 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-17 11:13:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:12,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711300323] [2025-03-17 11:13:12,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711300323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:12,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:12,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:12,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680159227] [2025-03-17 11:13:12,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:12,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:12,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:12,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:12,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:12,363 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 670 out of 705 [2025-03-17 11:13:12,365 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 654 places, 659 transitions, 1326 flow. Second operand has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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-17 11:13:12,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:12,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 670 of 705 [2025-03-17 11:13:12,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:12,468 INFO L124 PetriNetUnfolderBase]: 11/660 cut-off events. [2025-03-17 11:13:12,468 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-17 11:13:12,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 679 conditions, 660 events. 11/660 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1852 event pairs, 1 based on Foata normal form. 0/566 useless extension candidates. Maximal degree in co-relation 629. Up to 11 conditions per place. [2025-03-17 11:13:12,477 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 8 selfloop transitions, 2 changer transitions 0/658 dead transitions. [2025-03-17 11:13:12,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 655 places, 658 transitions, 1344 flow [2025-03-17 11:13:12,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:12,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2021 transitions. [2025-03-17 11:13:12,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9555555555555556 [2025-03-17 11:13:12,482 INFO L175 Difference]: Start difference. First operand has 654 places, 659 transitions, 1326 flow. Second operand 3 states and 2021 transitions. [2025-03-17 11:13:12,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 655 places, 658 transitions, 1344 flow [2025-03-17 11:13:12,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 653 places, 658 transitions, 1340 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:12,491 INFO L231 Difference]: Finished difference. Result has 653 places, 658 transitions, 1324 flow [2025-03-17 11:13:12,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1320, PETRI_DIFFERENCE_MINUEND_PLACES=651, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=658, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=656, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1324, PETRI_PLACES=653, PETRI_TRANSITIONS=658} [2025-03-17 11:13:12,492 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -9 predicate places. [2025-03-17 11:13:12,493 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 658 transitions, 1324 flow [2025-03-17 11:13:12,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 671.3333333333334) internal successors, (2014), 3 states have internal predecessors, (2014), 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-17 11:13:12,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:12,494 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] [2025-03-17 11:13:12,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:13:12,494 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:12,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1517996264, now seen corresponding path program 1 times [2025-03-17 11:13:12,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:12,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7758161] [2025-03-17 11:13:12,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:12,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:12,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-03-17 11:13:12,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-03-17 11:13:12,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:12,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:12,552 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-17 11:13:12,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:12,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7758161] [2025-03-17 11:13:12,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7758161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:12,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:12,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:12,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37425557] [2025-03-17 11:13:12,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:12,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:12,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:12,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:12,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:12,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-17 11:13:12,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 658 transitions, 1324 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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-17 11:13:12,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:12,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-17 11:13:12,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:12,759 INFO L124 PetriNetUnfolderBase]: 22/1525 cut-off events. [2025-03-17 11:13:12,759 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2025-03-17 11:13:12,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1559 conditions, 1525 events. 22/1525 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7100 event pairs, 4 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1501. Up to 22 conditions per place. [2025-03-17 11:13:12,775 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/657 dead transitions. [2025-03-17 11:13:12,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 657 transitions, 1352 flow [2025-03-17 11:13:12,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:12,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:12,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-17 11:13:12,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-17 11:13:12,778 INFO L175 Difference]: Start difference. First operand has 653 places, 658 transitions, 1324 flow. Second operand 3 states and 2011 transitions. [2025-03-17 11:13:12,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 657 transitions, 1352 flow [2025-03-17 11:13:12,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 657 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:12,785 INFO L231 Difference]: Finished difference. Result has 652 places, 657 transitions, 1322 flow [2025-03-17 11:13:12,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1318, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=657, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=655, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1322, PETRI_PLACES=652, PETRI_TRANSITIONS=657} [2025-03-17 11:13:12,786 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -10 predicate places. [2025-03-17 11:13:12,787 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 657 transitions, 1322 flow [2025-03-17 11:13:12,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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-17 11:13:12,788 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:12,788 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] [2025-03-17 11:13:12,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:13:12,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:12,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:12,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1102684188, now seen corresponding path program 1 times [2025-03-17 11:13:12,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:12,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134164692] [2025-03-17 11:13:12,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:12,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:12,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-03-17 11:13:12,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-03-17 11:13:12,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:12,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:12,840 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-17 11:13:12,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:12,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134164692] [2025-03-17 11:13:12,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134164692] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:12,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:12,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:12,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049130127] [2025-03-17 11:13:12,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:12,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:12,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:12,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:12,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:12,880 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-17 11:13:12,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 657 transitions, 1322 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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-17 11:13:12,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:12,882 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-17 11:13:12,882 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:12,958 INFO L124 PetriNetUnfolderBase]: 14/701 cut-off events. [2025-03-17 11:13:12,958 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-03-17 11:13:12,964 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 701 events. 14/701 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2247 event pairs, 4 based on Foata normal form. 0/602 useless extension candidates. Maximal degree in co-relation 665. Up to 22 conditions per place. [2025-03-17 11:13:12,967 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/656 dead transitions. [2025-03-17 11:13:12,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 656 transitions, 1350 flow [2025-03-17 11:13:12,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:12,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-17 11:13:12,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-17 11:13:12,970 INFO L175 Difference]: Start difference. First operand has 652 places, 657 transitions, 1322 flow. Second operand 3 states and 2011 transitions. [2025-03-17 11:13:12,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 656 transitions, 1350 flow [2025-03-17 11:13:12,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 656 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:12,977 INFO L231 Difference]: Finished difference. Result has 651 places, 656 transitions, 1320 flow [2025-03-17 11:13:12,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1316, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=654, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1320, PETRI_PLACES=651, PETRI_TRANSITIONS=656} [2025-03-17 11:13:12,978 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -11 predicate places. [2025-03-17 11:13:12,978 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 656 transitions, 1320 flow [2025-03-17 11:13:12,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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-17 11:13:12,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:12,979 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] [2025-03-17 11:13:12,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:13:12,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:12,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1090109854, now seen corresponding path program 1 times [2025-03-17 11:13:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:12,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100045959] [2025-03-17 11:13:12,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:12,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 11:13:12,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 11:13:12,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:12,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:13,017 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-17 11:13:13,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:13,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100045959] [2025-03-17 11:13:13,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100045959] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:13,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:13,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565300348] [2025-03-17 11:13:13,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:13,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:13,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:13,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:13,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-17 11:13:13,050 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 656 transitions, 1320 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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-17 11:13:13,050 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:13,050 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-17 11:13:13,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:13,149 INFO L124 PetriNetUnfolderBase]: 18/874 cut-off events. [2025-03-17 11:13:13,150 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:13:13,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 916 conditions, 874 events. 18/874 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3337 event pairs, 6 based on Foata normal form. 0/748 useless extension candidates. Maximal degree in co-relation 842. Up to 28 conditions per place. [2025-03-17 11:13:13,157 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/655 dead transitions. [2025-03-17 11:13:13,158 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 655 transitions, 1350 flow [2025-03-17 11:13:13,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:13,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-17 11:13:13,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-17 11:13:13,160 INFO L175 Difference]: Start difference. First operand has 651 places, 656 transitions, 1320 flow. Second operand 3 states and 2009 transitions. [2025-03-17 11:13:13,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 655 transitions, 1350 flow [2025-03-17 11:13:13,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 655 transitions, 1346 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:13,167 INFO L231 Difference]: Finished difference. Result has 650 places, 655 transitions, 1318 flow [2025-03-17 11:13:13,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1314, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=655, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=653, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1318, PETRI_PLACES=650, PETRI_TRANSITIONS=655} [2025-03-17 11:13:13,168 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -12 predicate places. [2025-03-17 11:13:13,168 INFO L471 AbstractCegarLoop]: Abstraction has has 650 places, 655 transitions, 1318 flow [2025-03-17 11:13:13,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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-17 11:13:13,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:13,170 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:13,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:13:13,170 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:13,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:13,170 INFO L85 PathProgramCache]: Analyzing trace with hash 883071740, now seen corresponding path program 1 times [2025-03-17 11:13:13,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:13,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166678440] [2025-03-17 11:13:13,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:13,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:13,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-17 11:13:13,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-17 11:13:13,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:13,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:13,223 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-17 11:13:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166678440] [2025-03-17 11:13:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166678440] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390051383] [2025-03-17 11:13:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:13,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:13,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:13,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 664 out of 705 [2025-03-17 11:13:13,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 650 places, 655 transitions, 1318 flow. Second operand has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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-17 11:13:13,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:13,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 664 of 705 [2025-03-17 11:13:13,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:13,348 INFO L124 PetriNetUnfolderBase]: 18/873 cut-off events. [2025-03-17 11:13:13,348 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-03-17 11:13:13,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 909 conditions, 873 events. 18/873 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3098 event pairs, 6 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 827. Up to 28 conditions per place. [2025-03-17 11:13:13,358 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/654 dead transitions. [2025-03-17 11:13:13,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 651 places, 654 transitions, 1348 flow [2025-03-17 11:13:13,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:13,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2009 transitions. [2025-03-17 11:13:13,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498817966903074 [2025-03-17 11:13:13,361 INFO L175 Difference]: Start difference. First operand has 650 places, 655 transitions, 1318 flow. Second operand 3 states and 2009 transitions. [2025-03-17 11:13:13,361 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 651 places, 654 transitions, 1348 flow [2025-03-17 11:13:13,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 649 places, 654 transitions, 1344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:13,368 INFO L231 Difference]: Finished difference. Result has 649 places, 654 transitions, 1316 flow [2025-03-17 11:13:13,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1312, PETRI_DIFFERENCE_MINUEND_PLACES=647, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=654, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=652, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=649, PETRI_TRANSITIONS=654} [2025-03-17 11:13:13,369 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -13 predicate places. [2025-03-17 11:13:13,369 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 654 transitions, 1316 flow [2025-03-17 11:13:13,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 665.3333333333334) internal successors, (1996), 3 states have internal predecessors, (1996), 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-17 11:13:13,370 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:13,370 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] [2025-03-17 11:13:13,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:13:13,370 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:13,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:13,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1216471974, now seen corresponding path program 1 times [2025-03-17 11:13:13,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:13,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086104971] [2025-03-17 11:13:13,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:13,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:13,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-03-17 11:13:13,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-03-17 11:13:13,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:13,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:13,426 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-17 11:13:13,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:13,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086104971] [2025-03-17 11:13:13,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086104971] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:13,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:13,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:13,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386679771] [2025-03-17 11:13:13,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:13,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:13,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:13,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:13,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:13,444 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-17 11:13:13,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 654 transitions, 1316 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:13,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:13,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-17 11:13:13,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:13,561 INFO L124 PetriNetUnfolderBase]: 17/1083 cut-off events. [2025-03-17 11:13:13,561 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-17 11:13:13,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1111 conditions, 1083 events. 17/1083 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4814 event pairs, 3 based on Foata normal form. 0/925 useless extension candidates. Maximal degree in co-relation 1021. Up to 19 conditions per place. [2025-03-17 11:13:13,568 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 10 selfloop transitions, 2 changer transitions 0/653 dead transitions. [2025-03-17 11:13:13,568 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 650 places, 653 transitions, 1338 flow [2025-03-17 11:13:13,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:13,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:13,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2017 transitions. [2025-03-17 11:13:13,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9536643026004729 [2025-03-17 11:13:13,572 INFO L175 Difference]: Start difference. First operand has 649 places, 654 transitions, 1316 flow. Second operand 3 states and 2017 transitions. [2025-03-17 11:13:13,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 650 places, 653 transitions, 1338 flow [2025-03-17 11:13:13,574 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 653 transitions, 1334 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:13,578 INFO L231 Difference]: Finished difference. Result has 648 places, 653 transitions, 1314 flow [2025-03-17 11:13:13,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=646, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=653, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1314, PETRI_PLACES=648, PETRI_TRANSITIONS=653} [2025-03-17 11:13:13,580 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2025-03-17 11:13:13,580 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 653 transitions, 1314 flow [2025-03-17 11:13:13,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:13,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:13,581 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] [2025-03-17 11:13:13,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:13:13,581 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:13,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:13,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1509994947, now seen corresponding path program 1 times [2025-03-17 11:13:13,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:13,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418847187] [2025-03-17 11:13:13,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:13,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:13,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:13:13,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:13:13,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:13,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:13,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-17 11:13:13,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:13,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418847187] [2025-03-17 11:13:13,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418847187] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:13,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:13,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:13,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513274025] [2025-03-17 11:13:13,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:13,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:13,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:13,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:13,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:13,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 668 out of 705 [2025-03-17 11:13:13,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 653 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:13,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:13,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 668 of 705 [2025-03-17 11:13:13,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:13,776 INFO L124 PetriNetUnfolderBase]: 29/1717 cut-off events. [2025-03-17 11:13:13,776 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-17 11:13:13,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1759 conditions, 1717 events. 29/1717 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 9708 event pairs, 8 based on Foata normal form. 0/1463 useless extension candidates. Maximal degree in co-relation 1661. Up to 32 conditions per place. [2025-03-17 11:13:13,789 INFO L140 encePairwiseOnDemand]: 701/705 looper letters, 10 selfloop transitions, 1 changer transitions 0/650 dead transitions. [2025-03-17 11:13:13,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 650 transitions, 1330 flow [2025-03-17 11:13:13,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:13,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:13,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2018 transitions. [2025-03-17 11:13:13,792 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9541371158392435 [2025-03-17 11:13:13,792 INFO L175 Difference]: Start difference. First operand has 648 places, 653 transitions, 1314 flow. Second operand 3 states and 2018 transitions. [2025-03-17 11:13:13,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 650 transitions, 1330 flow [2025-03-17 11:13:13,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 650 transitions, 1326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:13,799 INFO L231 Difference]: Finished difference. Result has 645 places, 650 transitions, 1306 flow [2025-03-17 11:13:13,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=650, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=649, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=645, PETRI_TRANSITIONS=650} [2025-03-17 11:13:13,800 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -17 predicate places. [2025-03-17 11:13:13,800 INFO L471 AbstractCegarLoop]: Abstraction has has 645 places, 650 transitions, 1306 flow [2025-03-17 11:13:13,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:13,801 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:13,801 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:13,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:13:13,802 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:13,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:13,802 INFO L85 PathProgramCache]: Analyzing trace with hash -943179008, now seen corresponding path program 1 times [2025-03-17 11:13:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:13,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529580691] [2025-03-17 11:13:13,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:13,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:13,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 11:13:13,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 11:13:13,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:13,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:14,352 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-17 11:13:14,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:14,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529580691] [2025-03-17 11:13:14,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529580691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:14,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:14,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:14,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412530470] [2025-03-17 11:13:14,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:14,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:14,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:14,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:14,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:14,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 640 out of 705 [2025-03-17 11:13:14,509 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 645 places, 650 transitions, 1306 flow. Second operand has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 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-17 11:13:14,509 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:14,509 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 640 of 705 [2025-03-17 11:13:14,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:14,926 INFO L124 PetriNetUnfolderBase]: 244/4163 cut-off events. [2025-03-17 11:13:14,926 INFO L125 PetriNetUnfolderBase]: For 30/31 co-relation queries the response was YES. [2025-03-17 11:13:14,938 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4606 conditions, 4163 events. 244/4163 cut-off events. For 30/31 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 32160 event pairs, 168 based on Foata normal form. 0/3508 useless extension candidates. Maximal degree in co-relation 4509. Up to 421 conditions per place. [2025-03-17 11:13:14,946 INFO L140 encePairwiseOnDemand]: 699/705 looper letters, 36 selfloop transitions, 5 changer transitions 0/649 dead transitions. [2025-03-17 11:13:14,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 649 transitions, 1386 flow [2025-03-17 11:13:14,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:14,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3882 transitions. [2025-03-17 11:13:14,952 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9177304964539007 [2025-03-17 11:13:14,952 INFO L175 Difference]: Start difference. First operand has 645 places, 650 transitions, 1306 flow. Second operand 6 states and 3882 transitions. [2025-03-17 11:13:14,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 649 transitions, 1386 flow [2025-03-17 11:13:14,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 648 places, 649 transitions, 1385 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:14,958 INFO L231 Difference]: Finished difference. Result has 648 places, 649 transitions, 1313 flow [2025-03-17 11:13:14,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=643, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=649, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=644, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1313, PETRI_PLACES=648, PETRI_TRANSITIONS=649} [2025-03-17 11:13:14,959 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -14 predicate places. [2025-03-17 11:13:14,959 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 649 transitions, 1313 flow [2025-03-17 11:13:14,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 641.5) internal successors, (3849), 6 states have internal predecessors, (3849), 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-17 11:13:14,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:14,961 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:14,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:13:14,961 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:14,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:14,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1237142175, now seen corresponding path program 1 times [2025-03-17 11:13:14,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:14,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861947444] [2025-03-17 11:13:14,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:14,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:14,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-17 11:13:14,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-17 11:13:14,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:14,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:14,994 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-17 11:13:14,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:14,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861947444] [2025-03-17 11:13:14,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861947444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:14,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:14,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:14,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676216623] [2025-03-17 11:13:14,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:14,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:14,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:14,995 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:14,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:15,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 665 out of 705 [2025-03-17 11:13:15,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 649 transitions, 1313 flow. Second operand has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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-17 11:13:15,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:15,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 665 of 705 [2025-03-17 11:13:15,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:15,165 INFO L124 PetriNetUnfolderBase]: 34/1521 cut-off events. [2025-03-17 11:13:15,165 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-17 11:13:15,173 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1582 conditions, 1521 events. 34/1521 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7600 event pairs, 15 based on Foata normal form. 0/1298 useless extension candidates. Maximal degree in co-relation 1564. Up to 46 conditions per place. [2025-03-17 11:13:15,179 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/648 dead transitions. [2025-03-17 11:13:15,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 648 transitions, 1341 flow [2025-03-17 11:13:15,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:15,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:15,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2011 transitions. [2025-03-17 11:13:15,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9508274231678487 [2025-03-17 11:13:15,183 INFO L175 Difference]: Start difference. First operand has 648 places, 649 transitions, 1313 flow. Second operand 3 states and 2011 transitions. [2025-03-17 11:13:15,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 648 transitions, 1341 flow [2025-03-17 11:13:15,187 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 644 places, 648 transitions, 1331 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:15,191 INFO L231 Difference]: Finished difference. Result has 644 places, 648 transitions, 1305 flow [2025-03-17 11:13:15,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1301, PETRI_DIFFERENCE_MINUEND_PLACES=642, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=648, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=646, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=644, PETRI_TRANSITIONS=648} [2025-03-17 11:13:15,193 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -18 predicate places. [2025-03-17 11:13:15,194 INFO L471 AbstractCegarLoop]: Abstraction has has 644 places, 648 transitions, 1305 flow [2025-03-17 11:13:15,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 666.3333333333334) internal successors, (1999), 3 states have internal predecessors, (1999), 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-17 11:13:15,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:15,195 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:15,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:13:15,195 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:15,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:15,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1092011694, now seen corresponding path program 1 times [2025-03-17 11:13:15,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:15,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224488669] [2025-03-17 11:13:15,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:15,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:15,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-17 11:13:15,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-17 11:13:15,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:15,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:15,229 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-17 11:13:15,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:15,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224488669] [2025-03-17 11:13:15,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224488669] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:15,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:15,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:15,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015681041] [2025-03-17 11:13:15,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:15,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:15,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:15,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:15,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:15,264 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 645 out of 705 [2025-03-17 11:13:15,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 644 places, 648 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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-17 11:13:15,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:15,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 645 of 705 [2025-03-17 11:13:15,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:15,393 INFO L124 PetriNetUnfolderBase]: 28/1297 cut-off events. [2025-03-17 11:13:15,393 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-03-17 11:13:15,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1366 conditions, 1297 events. 28/1297 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 6706 event pairs, 8 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 1268. Up to 44 conditions per place. [2025-03-17 11:13:15,403 INFO L140 encePairwiseOnDemand]: 690/705 looper letters, 25 selfloop transitions, 5 changer transitions 0/641 dead transitions. [2025-03-17 11:13:15,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 636 places, 641 transitions, 1352 flow [2025-03-17 11:13:15,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:15,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:15,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1975 transitions. [2025-03-17 11:13:15,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.933806146572104 [2025-03-17 11:13:15,407 INFO L175 Difference]: Start difference. First operand has 644 places, 648 transitions, 1305 flow. Second operand 3 states and 1975 transitions. [2025-03-17 11:13:15,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 636 places, 641 transitions, 1352 flow [2025-03-17 11:13:15,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 634 places, 641 transitions, 1348 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:15,415 INFO L231 Difference]: Finished difference. Result has 635 places, 640 transitions, 1304 flow [2025-03-17 11:13:15,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1281, PETRI_DIFFERENCE_MINUEND_PLACES=632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=638, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=633, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=635, PETRI_TRANSITIONS=640} [2025-03-17 11:13:15,417 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -27 predicate places. [2025-03-17 11:13:15,417 INFO L471 AbstractCegarLoop]: Abstraction has has 635 places, 640 transitions, 1304 flow [2025-03-17 11:13:15,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 646.0) internal successors, (1938), 3 states have internal predecessors, (1938), 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-17 11:13:15,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:15,418 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:15,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:13:15,419 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:15,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:15,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1451259733, now seen corresponding path program 1 times [2025-03-17 11:13:15,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:15,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626810761] [2025-03-17 11:13:15,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:15,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:15,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-17 11:13:15,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-17 11:13:15,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:15,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:15,456 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-17 11:13:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626810761] [2025-03-17 11:13:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626810761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:15,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:15,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:15,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46162482] [2025-03-17 11:13:15,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:15,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:15,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:15,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:15,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:15,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 660 out of 705 [2025-03-17 11:13:15,484 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 635 places, 640 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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-17 11:13:15,484 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:15,484 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 660 of 705 [2025-03-17 11:13:15,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:15,567 INFO L124 PetriNetUnfolderBase]: 25/876 cut-off events. [2025-03-17 11:13:15,567 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2025-03-17 11:13:15,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 876 events. 25/876 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3175 event pairs, 8 based on Foata normal form. 0/768 useless extension candidates. Maximal degree in co-relation 835. Up to 34 conditions per place. [2025-03-17 11:13:15,575 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 15 selfloop transitions, 5 changer transitions 0/638 dead transitions. [2025-03-17 11:13:15,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 632 places, 638 transitions, 1341 flow [2025-03-17 11:13:15,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:15,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:15,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2005 transitions. [2025-03-17 11:13:15,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479905437352246 [2025-03-17 11:13:15,579 INFO L175 Difference]: Start difference. First operand has 635 places, 640 transitions, 1304 flow. Second operand 3 states and 2005 transitions. [2025-03-17 11:13:15,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 632 places, 638 transitions, 1341 flow [2025-03-17 11:13:15,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 631 places, 638 transitions, 1336 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:15,586 INFO L231 Difference]: Finished difference. Result has 632 places, 637 transitions, 1312 flow [2025-03-17 11:13:15,587 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=635, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=630, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=632, PETRI_TRANSITIONS=637} [2025-03-17 11:13:15,588 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -30 predicate places. [2025-03-17 11:13:15,588 INFO L471 AbstractCegarLoop]: Abstraction has has 632 places, 637 transitions, 1312 flow [2025-03-17 11:13:15,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 661.0) internal successors, (1983), 3 states have internal predecessors, (1983), 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-17 11:13:15,589 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:15,589 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:13:15,589 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:15,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:15,589 INFO L85 PathProgramCache]: Analyzing trace with hash 751891913, now seen corresponding path program 1 times [2025-03-17 11:13:15,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:15,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079929542] [2025-03-17 11:13:15,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:15,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:15,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-17 11:13:15,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-17 11:13:15,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:15,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:15,626 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-17 11:13:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:15,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079929542] [2025-03-17 11:13:15,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079929542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:15,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:15,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:15,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313829641] [2025-03-17 11:13:15,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:15,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:15,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:15,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:15,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:15,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-03-17 11:13:15,649 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 632 places, 637 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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-17 11:13:15,649 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:15,649 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-03-17 11:13:15,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:15,816 INFO L124 PetriNetUnfolderBase]: 40/1573 cut-off events. [2025-03-17 11:13:15,816 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2025-03-17 11:13:15,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1677 conditions, 1573 events. 40/1573 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 7248 event pairs, 2 based on Foata normal form. 0/1371 useless extension candidates. Maximal degree in co-relation 1578. Up to 30 conditions per place. [2025-03-17 11:13:15,826 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 13 selfloop transitions, 6 changer transitions 0/637 dead transitions. [2025-03-17 11:13:15,826 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 630 places, 637 transitions, 1352 flow [2025-03-17 11:13:15,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:15,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:15,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-03-17 11:13:15,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-03-17 11:13:15,829 INFO L175 Difference]: Start difference. First operand has 632 places, 637 transitions, 1312 flow. Second operand 3 states and 2012 transitions. [2025-03-17 11:13:15,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 630 places, 637 transitions, 1352 flow [2025-03-17 11:13:15,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 629 places, 637 transitions, 1347 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:15,835 INFO L231 Difference]: Finished difference. Result has 630 places, 635 transitions, 1325 flow [2025-03-17 11:13:15,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1299, PETRI_DIFFERENCE_MINUEND_PLACES=627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=633, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=627, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1325, PETRI_PLACES=630, PETRI_TRANSITIONS=635} [2025-03-17 11:13:15,836 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -32 predicate places. [2025-03-17 11:13:15,836 INFO L471 AbstractCegarLoop]: Abstraction has has 630 places, 635 transitions, 1325 flow [2025-03-17 11:13:15,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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-17 11:13:15,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:15,841 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:13:15,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 11:13:15,841 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:15,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:15,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1041208591, now seen corresponding path program 1 times [2025-03-17 11:13:15,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:15,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925044642] [2025-03-17 11:13:15,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:15,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:15,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:13:15,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:13:15,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:15,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:15,868 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-17 11:13:15,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:15,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925044642] [2025-03-17 11:13:15,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925044642] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:15,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:15,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:15,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531305679] [2025-03-17 11:13:15,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:15,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:15,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:15,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:15,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:15,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 663 out of 705 [2025-03-17 11:13:15,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 630 places, 635 transitions, 1325 flow. Second operand has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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-17 11:13:15,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:15,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 663 of 705 [2025-03-17 11:13:15,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:16,100 INFO L124 PetriNetUnfolderBase]: 53/1813 cut-off events. [2025-03-17 11:13:16,100 INFO L125 PetriNetUnfolderBase]: For 15/17 co-relation queries the response was YES. [2025-03-17 11:13:16,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1951 conditions, 1813 events. 53/1813 cut-off events. For 15/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10971 event pairs, 2 based on Foata normal form. 1/1588 useless extension candidates. Maximal degree in co-relation 1851. Up to 43 conditions per place. [2025-03-17 11:13:16,129 INFO L140 encePairwiseOnDemand]: 695/705 looper letters, 12 selfloop transitions, 5 changer transitions 4/636 dead transitions. [2025-03-17 11:13:16,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 628 places, 636 transitions, 1368 flow [2025-03-17 11:13:16,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:16,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:16,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2012 transitions. [2025-03-17 11:13:16,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9513002364066194 [2025-03-17 11:13:16,133 INFO L175 Difference]: Start difference. First operand has 630 places, 635 transitions, 1325 flow. Second operand 3 states and 2012 transitions. [2025-03-17 11:13:16,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 628 places, 636 transitions, 1368 flow [2025-03-17 11:13:16,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 627 places, 636 transitions, 1362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:16,140 INFO L231 Difference]: Finished difference. Result has 628 places, 629 transitions, 1323 flow [2025-03-17 11:13:16,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1311, PETRI_DIFFERENCE_MINUEND_PLACES=625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=631, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=626, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1323, PETRI_PLACES=628, PETRI_TRANSITIONS=629} [2025-03-17 11:13:16,142 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -34 predicate places. [2025-03-17 11:13:16,142 INFO L471 AbstractCegarLoop]: Abstraction has has 628 places, 629 transitions, 1323 flow [2025-03-17 11:13:16,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 664.0) internal successors, (1992), 3 states have internal predecessors, (1992), 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-17 11:13:16,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:16,143 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, 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-17 11:13:16,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 11:13:16,143 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:16,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:16,143 INFO L85 PathProgramCache]: Analyzing trace with hash 588080694, now seen corresponding path program 1 times [2025-03-17 11:13:16,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:16,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111277064] [2025-03-17 11:13:16,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:16,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:16,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-17 11:13:16,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-17 11:13:16,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:16,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:16,181 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-17 11:13:16,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:16,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111277064] [2025-03-17 11:13:16,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111277064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:16,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:16,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:16,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738796461] [2025-03-17 11:13:16,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:16,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:16,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:16,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:16,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:16,206 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-03-17 11:13:16,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 628 places, 629 transitions, 1323 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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-17 11:13:16,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:16,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-03-17 11:13:16,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:16,564 INFO L124 PetriNetUnfolderBase]: 129/3255 cut-off events. [2025-03-17 11:13:16,565 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-17 11:13:16,584 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3660 conditions, 3255 events. 129/3255 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 24999 event pairs, 4 based on Foata normal form. 0/2879 useless extension candidates. Maximal degree in co-relation 3559. Up to 158 conditions per place. [2025-03-17 11:13:16,591 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 17 selfloop transitions, 3 changer transitions 0/626 dead transitions. [2025-03-17 11:13:16,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 626 transitions, 1359 flow [2025-03-17 11:13:16,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:16,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2000 transitions. [2025-03-17 11:13:16,594 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9456264775413712 [2025-03-17 11:13:16,594 INFO L175 Difference]: Start difference. First operand has 628 places, 629 transitions, 1323 flow. Second operand 3 states and 2000 transitions. [2025-03-17 11:13:16,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 626 transitions, 1359 flow [2025-03-17 11:13:16,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 619 places, 626 transitions, 1354 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:16,600 INFO L231 Difference]: Finished difference. Result has 620 places, 624 transitions, 1319 flow [2025-03-17 11:13:16,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=617, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=623, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=620, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1319, PETRI_PLACES=620, PETRI_TRANSITIONS=624} [2025-03-17 11:13:16,601 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -42 predicate places. [2025-03-17 11:13:16,601 INFO L471 AbstractCegarLoop]: Abstraction has has 620 places, 624 transitions, 1319 flow [2025-03-17 11:13:16,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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-17 11:13:16,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:16,601 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, 1, 1, 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-17 11:13:16,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 11:13:16,602 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:16,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:16,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1684678152, now seen corresponding path program 1 times [2025-03-17 11:13:16,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:16,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690208268] [2025-03-17 11:13:16,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:16,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:16,608 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-17 11:13:16,611 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-17 11:13:16,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:16,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:16,628 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-17 11:13:16,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:16,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690208268] [2025-03-17 11:13:16,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690208268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:16,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:16,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:16,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081458244] [2025-03-17 11:13:16,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:16,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:16,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:16,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:16,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:16,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 658 out of 705 [2025-03-17 11:13:16,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 620 places, 624 transitions, 1319 flow. Second operand has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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-17 11:13:16,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:16,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 658 of 705 [2025-03-17 11:13:16,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:17,040 INFO L124 PetriNetUnfolderBase]: 122/3768 cut-off events. [2025-03-17 11:13:17,040 INFO L125 PetriNetUnfolderBase]: For 36/40 co-relation queries the response was YES. [2025-03-17 11:13:17,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4229 conditions, 3768 events. 122/3768 cut-off events. For 36/40 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 31088 event pairs, 20 based on Foata normal form. 0/3397 useless extension candidates. Maximal degree in co-relation 4127. Up to 176 conditions per place. [2025-03-17 11:13:17,070 INFO L140 encePairwiseOnDemand]: 696/705 looper letters, 18 selfloop transitions, 3 changer transitions 0/622 dead transitions. [2025-03-17 11:13:17,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 622 transitions, 1360 flow [2025-03-17 11:13:17,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:17,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:17,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2001 transitions. [2025-03-17 11:13:17,073 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9460992907801419 [2025-03-17 11:13:17,073 INFO L175 Difference]: Start difference. First operand has 620 places, 624 transitions, 1319 flow. Second operand 3 states and 2001 transitions. [2025-03-17 11:13:17,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 622 transitions, 1360 flow [2025-03-17 11:13:17,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 622 transitions, 1357 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:17,080 INFO L231 Difference]: Finished difference. Result has 616 places, 619 transitions, 1317 flow [2025-03-17 11:13:17,080 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=613, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=618, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=615, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1317, PETRI_PLACES=616, PETRI_TRANSITIONS=619} [2025-03-17 11:13:17,081 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -46 predicate places. [2025-03-17 11:13:17,081 INFO L471 AbstractCegarLoop]: Abstraction has has 616 places, 619 transitions, 1317 flow [2025-03-17 11:13:17,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 659.0) internal successors, (1977), 3 states have internal predecessors, (1977), 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-17 11:13:17,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:17,081 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:17,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 11:13:17,082 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err20ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash -317673532, now seen corresponding path program 1 times [2025-03-17 11:13:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979063464] [2025-03-17 11:13:17,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:17,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-17 11:13:17,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-17 11:13:17,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:17,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:17,116 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-17 11:13:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979063464] [2025-03-17 11:13:17,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979063464] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:17,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:17,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:17,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725877640] [2025-03-17 11:13:17,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:17,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:17,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:17,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:17,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:17,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 659 out of 705 [2025-03-17 11:13:17,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 616 places, 619 transitions, 1317 flow. Second operand has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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-17 11:13:17,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:17,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 659 of 705 [2025-03-17 11:13:17,139 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:18,149 INFO L124 PetriNetUnfolderBase]: 354/9609 cut-off events. [2025-03-17 11:13:18,149 INFO L125 PetriNetUnfolderBase]: For 59/63 co-relation queries the response was YES. [2025-03-17 11:13:18,181 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10800 conditions, 9609 events. 354/9609 cut-off events. For 59/63 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 98028 event pairs, 88 based on Foata normal form. 0/8697 useless extension candidates. Maximal degree in co-relation 10698. Up to 467 conditions per place. [2025-03-17 11:13:18,195 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 18 selfloop transitions, 2 changer transitions 0/617 dead transitions. [2025-03-17 11:13:18,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 617 transitions, 1355 flow [2025-03-17 11:13:18,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:18,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:18,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2003 transitions. [2025-03-17 11:13:18,198 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9470449172576832 [2025-03-17 11:13:18,199 INFO L175 Difference]: Start difference. First operand has 616 places, 619 transitions, 1317 flow. Second operand 3 states and 2003 transitions. [2025-03-17 11:13:18,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 617 transitions, 1355 flow [2025-03-17 11:13:18,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 617 transitions, 1352 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:13:18,208 INFO L231 Difference]: Finished difference. Result has 612 places, 615 transitions, 1316 flow [2025-03-17 11:13:18,209 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=613, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=611, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1316, PETRI_PLACES=612, PETRI_TRANSITIONS=615} [2025-03-17 11:13:18,209 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -50 predicate places. [2025-03-17 11:13:18,209 INFO L471 AbstractCegarLoop]: Abstraction has has 612 places, 615 transitions, 1316 flow [2025-03-17 11:13:18,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 660.3333333333334) internal successors, (1981), 3 states have internal predecessors, (1981), 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-17 11:13:18,210 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:18,210 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:18,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 11:13:18,210 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:18,211 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:18,211 INFO L85 PathProgramCache]: Analyzing trace with hash -531880659, now seen corresponding path program 1 times [2025-03-17 11:13:18,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:18,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992129141] [2025-03-17 11:13:18,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:18,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:18,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-17 11:13:18,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-17 11:13:18,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:18,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:18,590 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-17 11:13:18,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:18,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992129141] [2025-03-17 11:13:18,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992129141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:18,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:18,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:18,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906572784] [2025-03-17 11:13:18,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:18,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:18,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:18,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:18,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:18,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-03-17 11:13:18,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 612 places, 615 transitions, 1316 flow. Second operand has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 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-17 11:13:18,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:18,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-03-17 11:13:18,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:19,657 INFO L124 PetriNetUnfolderBase]: 233/5969 cut-off events. [2025-03-17 11:13:19,657 INFO L125 PetriNetUnfolderBase]: For 8/16 co-relation queries the response was YES. [2025-03-17 11:13:19,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6890 conditions, 5969 events. 233/5969 cut-off events. For 8/16 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 52332 event pairs, 8 based on Foata normal form. 0/5473 useless extension candidates. Maximal degree in co-relation 6784. Up to 228 conditions per place. [2025-03-17 11:13:19,700 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/616 dead transitions. [2025-03-17 11:13:19,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 614 places, 616 transitions, 1384 flow [2025-03-17 11:13:19,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:19,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:19,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-03-17 11:13:19,705 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-03-17 11:13:19,705 INFO L175 Difference]: Start difference. First operand has 612 places, 615 transitions, 1316 flow. Second operand 6 states and 3940 transitions. [2025-03-17 11:13:19,705 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 614 places, 616 transitions, 1384 flow [2025-03-17 11:13:19,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 614 places, 616 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:19,712 INFO L231 Difference]: Finished difference. Result has 614 places, 612 transitions, 1320 flow [2025-03-17 11:13:19,712 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1310, PETRI_DIFFERENCE_MINUEND_PLACES=609, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=607, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1320, PETRI_PLACES=614, PETRI_TRANSITIONS=612} [2025-03-17 11:13:19,713 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -48 predicate places. [2025-03-17 11:13:19,713 INFO L471 AbstractCegarLoop]: Abstraction has has 614 places, 612 transitions, 1320 flow [2025-03-17 11:13:19,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.6666666666666) internal successors, (3916), 6 states have internal predecessors, (3916), 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-17 11:13:19,713 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:19,714 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:19,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 11:13:19,714 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err18ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:19,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:19,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1170056079, now seen corresponding path program 1 times [2025-03-17 11:13:19,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:19,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833346371] [2025-03-17 11:13:19,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:19,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:19,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-17 11:13:19,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-17 11:13:19,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:19,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:20,036 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-17 11:13:20,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:20,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833346371] [2025-03-17 11:13:20,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833346371] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:20,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:20,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:13:20,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746047312] [2025-03-17 11:13:20,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:20,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:13:20,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:20,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:13:20,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:13:20,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 651 out of 705 [2025-03-17 11:13:20,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 614 places, 612 transitions, 1320 flow. Second operand has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 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-17 11:13:20,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:20,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 651 of 705 [2025-03-17 11:13:20,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:20,751 INFO L124 PetriNetUnfolderBase]: 160/4614 cut-off events. [2025-03-17 11:13:20,752 INFO L125 PetriNetUnfolderBase]: For 62/70 co-relation queries the response was YES. [2025-03-17 11:13:20,786 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5331 conditions, 4614 events. 160/4614 cut-off events. For 62/70 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 39460 event pairs, 0 based on Foata normal form. 0/4242 useless extension candidates. Maximal degree in co-relation 5224. Up to 171 conditions per place. [2025-03-17 11:13:20,794 INFO L140 encePairwiseOnDemand]: 697/705 looper letters, 26 selfloop transitions, 5 changer transitions 0/613 dead transitions. [2025-03-17 11:13:20,794 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 616 places, 613 transitions, 1388 flow [2025-03-17 11:13:20,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:13:20,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:13:20,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3940 transitions. [2025-03-17 11:13:20,799 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9314420803782506 [2025-03-17 11:13:20,799 INFO L175 Difference]: Start difference. First operand has 614 places, 612 transitions, 1320 flow. Second operand 6 states and 3940 transitions. [2025-03-17 11:13:20,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 616 places, 613 transitions, 1388 flow [2025-03-17 11:13:20,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 611 places, 613 transitions, 1378 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:20,806 INFO L231 Difference]: Finished difference. Result has 611 places, 609 transitions, 1314 flow [2025-03-17 11:13:20,807 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=609, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1314, PETRI_PLACES=611, PETRI_TRANSITIONS=609} [2025-03-17 11:13:20,807 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -51 predicate places. [2025-03-17 11:13:20,807 INFO L471 AbstractCegarLoop]: Abstraction has has 611 places, 609 transitions, 1314 flow [2025-03-17 11:13:20,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 652.8333333333334) internal successors, (3917), 6 states have internal predecessors, (3917), 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-17 11:13:20,808 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:20,808 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:20,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 11:13:20,808 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:20,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:20,809 INFO L85 PathProgramCache]: Analyzing trace with hash -673019833, now seen corresponding path program 1 times [2025-03-17 11:13:20,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:20,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563692533] [2025-03-17 11:13:20,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:20,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:20,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-17 11:13:20,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-17 11:13:20,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:20,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:20,849 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-17 11:13:20,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:20,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563692533] [2025-03-17 11:13:20,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563692533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:20,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:20,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:20,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436700972] [2025-03-17 11:13:20,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:20,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:20,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:20,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:20,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:20,871 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-17 11:13:20,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 611 places, 609 transitions, 1314 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:20,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:20,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-17 11:13:20,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:21,514 INFO L124 PetriNetUnfolderBase]: 208/6152 cut-off events. [2025-03-17 11:13:21,514 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2025-03-17 11:13:21,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7074 conditions, 6152 events. 208/6152 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 53504 event pairs, 32 based on Foata normal form. 0/5655 useless extension candidates. Maximal degree in co-relation 6969. Up to 163 conditions per place. [2025-03-17 11:13:21,562 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/609 dead transitions. [2025-03-17 11:13:21,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 612 places, 609 transitions, 1345 flow [2025-03-17 11:13:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-17 11:13:21,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-17 11:13:21,565 INFO L175 Difference]: Start difference. First operand has 611 places, 609 transitions, 1314 flow. Second operand 3 states and 2015 transitions. [2025-03-17 11:13:21,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 612 places, 609 transitions, 1345 flow [2025-03-17 11:13:21,569 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 609 transitions, 1335 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:13:21,572 INFO L231 Difference]: Finished difference. Result has 607 places, 608 transitions, 1306 flow [2025-03-17 11:13:21,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=608, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=606, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=607, PETRI_TRANSITIONS=608} [2025-03-17 11:13:21,573 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-17 11:13:21,573 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 608 transitions, 1306 flow [2025-03-17 11:13:21,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:21,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:21,574 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:21,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 11:13:21,574 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:21,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:21,575 INFO L85 PathProgramCache]: Analyzing trace with hash -185716661, now seen corresponding path program 1 times [2025-03-17 11:13:21,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:21,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603994005] [2025-03-17 11:13:21,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:21,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:21,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 11:13:21,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 11:13:21,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:21,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:21,607 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-17 11:13:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603994005] [2025-03-17 11:13:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603994005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:21,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:21,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:21,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846145914] [2025-03-17 11:13:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:21,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:21,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:21,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:21,634 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-17 11:13:21,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 608 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:21,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:21,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-17 11:13:21,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:22,109 INFO L124 PetriNetUnfolderBase]: 132/4345 cut-off events. [2025-03-17 11:13:22,109 INFO L125 PetriNetUnfolderBase]: For 93/101 co-relation queries the response was YES. [2025-03-17 11:13:22,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4909 conditions, 4345 events. 132/4345 cut-off events. For 93/101 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 35778 event pairs, 9 based on Foata normal form. 0/4018 useless extension candidates. Maximal degree in co-relation 4804. Up to 136 conditions per place. [2025-03-17 11:13:22,146 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 12 selfloop transitions, 2 changer transitions 1/608 dead transitions. [2025-03-17 11:13:22,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 608 transitions, 1337 flow [2025-03-17 11:13:22,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:22,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:22,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-17 11:13:22,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-17 11:13:22,148 INFO L175 Difference]: Start difference. First operand has 607 places, 608 transitions, 1306 flow. Second operand 3 states and 2015 transitions. [2025-03-17 11:13:22,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 608 transitions, 1337 flow [2025-03-17 11:13:22,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 608 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:22,154 INFO L231 Difference]: Finished difference. Result has 606 places, 607 transitions, 1304 flow [2025-03-17 11:13:22,155 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=607, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=606, PETRI_TRANSITIONS=607} [2025-03-17 11:13:22,155 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-03-17 11:13:22,155 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 607 transitions, 1304 flow [2025-03-17 11:13:22,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:22,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:22,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:22,156 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 11:13:22,156 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:22,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:22,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1054649307, now seen corresponding path program 1 times [2025-03-17 11:13:22,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:22,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375959478] [2025-03-17 11:13:22,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:22,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:22,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-03-17 11:13:22,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-03-17 11:13:22,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:22,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:22,193 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-17 11:13:22,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:22,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375959478] [2025-03-17 11:13:22,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375959478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:22,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:22,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:22,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219068344] [2025-03-17 11:13:22,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:22,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:22,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:22,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:22,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:22,199 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-03-17 11:13:22,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 607 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 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-17 11:13:22,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:22,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-03-17 11:13:22,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:22,881 INFO L124 PetriNetUnfolderBase]: 145/6321 cut-off events. [2025-03-17 11:13:22,881 INFO L125 PetriNetUnfolderBase]: For 20/24 co-relation queries the response was YES. [2025-03-17 11:13:22,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6942 conditions, 6321 events. 145/6321 cut-off events. For 20/24 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 54521 event pairs, 4 based on Foata normal form. 0/5861 useless extension candidates. Maximal degree in co-relation 6837. Up to 68 conditions per place. [2025-03-17 11:13:22,917 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 8 selfloop transitions, 1 changer transitions 0/609 dead transitions. [2025-03-17 11:13:22,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 609 transitions, 1328 flow [2025-03-17 11:13:22,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:22,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:22,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2032 transitions. [2025-03-17 11:13:22,919 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9607565011820332 [2025-03-17 11:13:22,919 INFO L175 Difference]: Start difference. First operand has 606 places, 607 transitions, 1304 flow. Second operand 3 states and 2032 transitions. [2025-03-17 11:13:22,919 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 609 transitions, 1328 flow [2025-03-17 11:13:22,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 609 transitions, 1324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:22,925 INFO L231 Difference]: Finished difference. Result has 606 places, 607 transitions, 1305 flow [2025-03-17 11:13:22,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1305, PETRI_PLACES=606, PETRI_TRANSITIONS=607} [2025-03-17 11:13:22,926 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-03-17 11:13:22,926 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 607 transitions, 1305 flow [2025-03-17 11:13:22,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.3333333333334) internal successors, (2026), 3 states have internal predecessors, (2026), 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-17 11:13:22,926 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:22,926 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:22,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 11:13:22,927 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err17ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:22,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash 467561577, now seen corresponding path program 1 times [2025-03-17 11:13:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282862465] [2025-03-17 11:13:22,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:22,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:22,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-17 11:13:22,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-17 11:13:22,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:22,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:22,962 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-17 11:13:22,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:22,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282862465] [2025-03-17 11:13:22,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282862465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:22,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:22,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:22,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128603606] [2025-03-17 11:13:22,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:22,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:22,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:22,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:22,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:22,968 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 674 out of 705 [2025-03-17 11:13:22,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 607 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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-17 11:13:22,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:22,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 674 of 705 [2025-03-17 11:13:22,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:23,766 INFO L124 PetriNetUnfolderBase]: 135/6249 cut-off events. [2025-03-17 11:13:23,766 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-17 11:13:23,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6830 conditions, 6249 events. 135/6249 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 52126 event pairs, 8 based on Foata normal form. 0/5823 useless extension candidates. Maximal degree in co-relation 6725. Up to 68 conditions per place. [2025-03-17 11:13:23,801 INFO L140 encePairwiseOnDemand]: 703/705 looper letters, 7 selfloop transitions, 1 changer transitions 0/608 dead transitions. [2025-03-17 11:13:23,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 608 transitions, 1324 flow [2025-03-17 11:13:23,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:23,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:23,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2031 transitions. [2025-03-17 11:13:23,804 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9602836879432625 [2025-03-17 11:13:23,804 INFO L175 Difference]: Start difference. First operand has 606 places, 607 transitions, 1305 flow. Second operand 3 states and 2031 transitions. [2025-03-17 11:13:23,804 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 608 transitions, 1324 flow [2025-03-17 11:13:23,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 608 transitions, 1324 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:23,811 INFO L231 Difference]: Finished difference. Result has 608 places, 607 transitions, 1310 flow [2025-03-17 11:13:23,812 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1303, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=605, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=607} [2025-03-17 11:13:23,812 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-17 11:13:23,812 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 607 transitions, 1310 flow [2025-03-17 11:13:23,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 675.6666666666666) internal successors, (2027), 3 states have internal predecessors, (2027), 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-17 11:13:23,813 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:23,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:23,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 11:13:23,813 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:23,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:23,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1731064388, now seen corresponding path program 1 times [2025-03-17 11:13:23,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:23,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342577432] [2025-03-17 11:13:23,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:23,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:23,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-17 11:13:23,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-17 11:13:23,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:23,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:23,859 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-17 11:13:23,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:23,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342577432] [2025-03-17 11:13:23,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342577432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:23,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:23,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:23,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143722888] [2025-03-17 11:13:23,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:23,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:23,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:23,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:23,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:23,885 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-17 11:13:23,887 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 607 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:23,887 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:23,887 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-17 11:13:23,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:24,958 INFO L124 PetriNetUnfolderBase]: 231/8833 cut-off events. [2025-03-17 11:13:24,958 INFO L125 PetriNetUnfolderBase]: For 85/85 co-relation queries the response was YES. [2025-03-17 11:13:24,995 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9834 conditions, 8833 events. 231/8833 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 80917 event pairs, 36 based on Foata normal form. 0/8203 useless extension candidates. Maximal degree in co-relation 9728. Up to 159 conditions per place. [2025-03-17 11:13:25,005 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/607 dead transitions. [2025-03-17 11:13:25,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 607 transitions, 1341 flow [2025-03-17 11:13:25,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:25,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:25,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-17 11:13:25,008 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-17 11:13:25,008 INFO L175 Difference]: Start difference. First operand has 608 places, 607 transitions, 1310 flow. Second operand 3 states and 2015 transitions. [2025-03-17 11:13:25,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 607 transitions, 1341 flow [2025-03-17 11:13:25,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 609 places, 607 transitions, 1341 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:13:25,013 INFO L231 Difference]: Finished difference. Result has 609 places, 606 transitions, 1312 flow [2025-03-17 11:13:25,014 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1308, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=606, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=604, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1312, PETRI_PLACES=609, PETRI_TRANSITIONS=606} [2025-03-17 11:13:25,014 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -53 predicate places. [2025-03-17 11:13:25,014 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 606 transitions, 1312 flow [2025-03-17 11:13:25,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:25,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:25,014 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:25,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 11:13:25,015 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:25,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:25,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1472477022, now seen corresponding path program 1 times [2025-03-17 11:13:25,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:25,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463679914] [2025-03-17 11:13:25,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:25,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:25,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-17 11:13:25,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-17 11:13:25,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:25,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:25,049 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-17 11:13:25,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:25,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463679914] [2025-03-17 11:13:25,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463679914] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:25,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:25,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:25,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127223094] [2025-03-17 11:13:25,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:25,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:25,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:25,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:25,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:25,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 667 out of 705 [2025-03-17 11:13:25,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 606 transitions, 1312 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:25,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:25,072 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 667 of 705 [2025-03-17 11:13:25,072 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:25,840 INFO L124 PetriNetUnfolderBase]: 147/6049 cut-off events. [2025-03-17 11:13:25,841 INFO L125 PetriNetUnfolderBase]: For 105/113 co-relation queries the response was YES. [2025-03-17 11:13:25,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6755 conditions, 6049 events. 147/6049 cut-off events. For 105/113 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 50544 event pairs, 22 based on Foata normal form. 0/5641 useless extension candidates. Maximal degree in co-relation 6648. Up to 150 conditions per place. [2025-03-17 11:13:25,901 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 13 selfloop transitions, 2 changer transitions 0/606 dead transitions. [2025-03-17 11:13:25,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 606 transitions, 1343 flow [2025-03-17 11:13:25,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:25,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2015 transitions. [2025-03-17 11:13:25,904 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527186761229315 [2025-03-17 11:13:25,904 INFO L175 Difference]: Start difference. First operand has 609 places, 606 transitions, 1312 flow. Second operand 3 states and 2015 transitions. [2025-03-17 11:13:25,904 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 606 transitions, 1343 flow [2025-03-17 11:13:25,906 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 606 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:25,909 INFO L231 Difference]: Finished difference. Result has 608 places, 605 transitions, 1310 flow [2025-03-17 11:13:25,910 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1306, PETRI_DIFFERENCE_MINUEND_PLACES=606, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=605, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=603, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1310, PETRI_PLACES=608, PETRI_TRANSITIONS=605} [2025-03-17 11:13:25,910 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -54 predicate places. [2025-03-17 11:13:25,910 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 605 transitions, 1310 flow [2025-03-17 11:13:25,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:25,911 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:25,911 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:25,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-17 11:13:25,911 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:25,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:25,912 INFO L85 PathProgramCache]: Analyzing trace with hash -980989465, now seen corresponding path program 1 times [2025-03-17 11:13:25,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:25,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823832654] [2025-03-17 11:13:25,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:25,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:25,921 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-17 11:13:25,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-17 11:13:25,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:25,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:25,947 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-17 11:13:25,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:25,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823832654] [2025-03-17 11:13:25,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823832654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:25,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:25,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:25,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342665441] [2025-03-17 11:13:25,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:25,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:25,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:25,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:25,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:25,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-03-17 11:13:25,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 605 transitions, 1310 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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-17 11:13:25,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:25,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-03-17 11:13:25,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:27,162 INFO L124 PetriNetUnfolderBase]: 281/10327 cut-off events. [2025-03-17 11:13:27,162 INFO L125 PetriNetUnfolderBase]: For 90/94 co-relation queries the response was YES. [2025-03-17 11:13:27,233 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11638 conditions, 10327 events. 281/10327 cut-off events. For 90/94 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 101550 event pairs, 64 based on Foata normal form. 0/9622 useless extension candidates. Maximal degree in co-relation 11531. Up to 254 conditions per place. [2025-03-17 11:13:27,251 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/605 dead transitions. [2025-03-17 11:13:27,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 605 transitions, 1355 flow [2025-03-17 11:13:27,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:27,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-03-17 11:13:27,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-03-17 11:13:27,253 INFO L175 Difference]: Start difference. First operand has 608 places, 605 transitions, 1310 flow. Second operand 3 states and 2004 transitions. [2025-03-17 11:13:27,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 605 transitions, 1355 flow [2025-03-17 11:13:27,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 607 places, 605 transitions, 1351 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:27,259 INFO L231 Difference]: Finished difference. Result has 607 places, 604 transitions, 1308 flow [2025-03-17 11:13:27,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1304, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=604, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=602, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1308, PETRI_PLACES=607, PETRI_TRANSITIONS=604} [2025-03-17 11:13:27,260 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -55 predicate places. [2025-03-17 11:13:27,260 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 604 transitions, 1308 flow [2025-03-17 11:13:27,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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-17 11:13:27,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:27,261 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:27,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-17 11:13:27,261 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:27,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1118002175, now seen corresponding path program 1 times [2025-03-17 11:13:27,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:27,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792636529] [2025-03-17 11:13:27,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:27,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:27,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 244 statements into 1 equivalence classes. [2025-03-17 11:13:27,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 244 of 244 statements. [2025-03-17 11:13:27,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:27,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:27,298 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-17 11:13:27,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:27,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792636529] [2025-03-17 11:13:27,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792636529] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:27,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:27,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:27,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918711704] [2025-03-17 11:13:27,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:27,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:27,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:27,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:27,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:27,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-17 11:13:27,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 604 transitions, 1308 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:27,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:27,325 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-17 11:13:27,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:28,029 INFO L124 PetriNetUnfolderBase]: 163/6447 cut-off events. [2025-03-17 11:13:28,029 INFO L125 PetriNetUnfolderBase]: For 111/119 co-relation queries the response was YES. [2025-03-17 11:13:28,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7257 conditions, 6447 events. 163/6447 cut-off events. For 111/119 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 56608 event pairs, 36 based on Foata normal form. 0/6034 useless extension candidates. Maximal degree in co-relation 7150. Up to 199 conditions per place. [2025-03-17 11:13:28,090 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/604 dead transitions. [2025-03-17 11:13:28,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 608 places, 604 transitions, 1343 flow [2025-03-17 11:13:28,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:28,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:28,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-17 11:13:28,092 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-17 11:13:28,092 INFO L175 Difference]: Start difference. First operand has 607 places, 604 transitions, 1308 flow. Second operand 3 states and 2014 transitions. [2025-03-17 11:13:28,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 608 places, 604 transitions, 1343 flow [2025-03-17 11:13:28,095 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 604 transitions, 1339 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:28,098 INFO L231 Difference]: Finished difference. Result has 606 places, 603 transitions, 1306 flow [2025-03-17 11:13:28,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1302, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=603, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=601, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1306, PETRI_PLACES=606, PETRI_TRANSITIONS=603} [2025-03-17 11:13:28,099 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -56 predicate places. [2025-03-17 11:13:28,099 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 603 transitions, 1306 flow [2025-03-17 11:13:28,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:28,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:28,100 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:28,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-17 11:13:28,100 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:28,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:28,101 INFO L85 PathProgramCache]: Analyzing trace with hash -622590539, now seen corresponding path program 1 times [2025-03-17 11:13:28,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:28,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364871637] [2025-03-17 11:13:28,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:28,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:28,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 246 statements into 1 equivalence classes. [2025-03-17 11:13:28,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 246 of 246 statements. [2025-03-17 11:13:28,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:28,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:28,137 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-17 11:13:28,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:28,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364871637] [2025-03-17 11:13:28,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364871637] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:28,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:28,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:28,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697243781] [2025-03-17 11:13:28,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:28,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:28,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:28,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:28,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:28,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 661 out of 705 [2025-03-17 11:13:28,181 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 603 transitions, 1306 flow. Second operand has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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-17 11:13:28,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:28,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 661 of 705 [2025-03-17 11:13:28,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:29,304 INFO L124 PetriNetUnfolderBase]: 283/10615 cut-off events. [2025-03-17 11:13:29,304 INFO L125 PetriNetUnfolderBase]: For 121/129 co-relation queries the response was YES. [2025-03-17 11:13:29,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11964 conditions, 10615 events. 283/10615 cut-off events. For 121/129 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102989 event pairs, 56 based on Foata normal form. 0/9913 useless extension candidates. Maximal degree in co-relation 11857. Up to 246 conditions per place. [2025-03-17 11:13:29,379 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 20 selfloop transitions, 2 changer transitions 0/603 dead transitions. [2025-03-17 11:13:29,379 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 603 transitions, 1351 flow [2025-03-17 11:13:29,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:29,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2004 transitions. [2025-03-17 11:13:29,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9475177304964539 [2025-03-17 11:13:29,380 INFO L175 Difference]: Start difference. First operand has 606 places, 603 transitions, 1306 flow. Second operand 3 states and 2004 transitions. [2025-03-17 11:13:29,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 603 transitions, 1351 flow [2025-03-17 11:13:29,383 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 605 places, 603 transitions, 1347 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:29,386 INFO L231 Difference]: Finished difference. Result has 605 places, 602 transitions, 1304 flow [2025-03-17 11:13:29,387 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=602, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=600, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1304, PETRI_PLACES=605, PETRI_TRANSITIONS=602} [2025-03-17 11:13:29,387 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -57 predicate places. [2025-03-17 11:13:29,387 INFO L471 AbstractCegarLoop]: Abstraction has has 605 places, 602 transitions, 1304 flow [2025-03-17 11:13:29,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 663.6666666666666) internal successors, (1991), 3 states have internal predecessors, (1991), 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-17 11:13:29,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:29,388 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:29,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-17 11:13:29,388 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:29,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:29,388 INFO L85 PathProgramCache]: Analyzing trace with hash -2093468686, now seen corresponding path program 1 times [2025-03-17 11:13:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:29,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838181629] [2025-03-17 11:13:29,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:29,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:29,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 248 statements into 1 equivalence classes. [2025-03-17 11:13:29,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 248 of 248 statements. [2025-03-17 11:13:29,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:29,402 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:29,424 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-17 11:13:29,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:29,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838181629] [2025-03-17 11:13:29,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838181629] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:29,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:29,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:29,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388950109] [2025-03-17 11:13:29,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:29,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:29,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:29,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:29,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:29,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-17 11:13:29,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 605 places, 602 transitions, 1304 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:29,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:29,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-17 11:13:29,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:30,415 INFO L124 PetriNetUnfolderBase]: 233/7345 cut-off events. [2025-03-17 11:13:30,415 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2025-03-17 11:13:30,463 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8396 conditions, 7345 events. 233/7345 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 67073 event pairs, 76 based on Foata normal form. 0/6909 useless extension candidates. Maximal degree in co-relation 8328. Up to 266 conditions per place. [2025-03-17 11:13:30,473 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 14 selfloop transitions, 2 changer transitions 0/602 dead transitions. [2025-03-17 11:13:30,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 602 transitions, 1337 flow [2025-03-17 11:13:30,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:30,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:30,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-17 11:13:30,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-17 11:13:30,475 INFO L175 Difference]: Start difference. First operand has 605 places, 602 transitions, 1304 flow. Second operand 3 states and 2014 transitions. [2025-03-17 11:13:30,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 602 transitions, 1337 flow [2025-03-17 11:13:30,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 602 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:30,482 INFO L231 Difference]: Finished difference. Result has 604 places, 601 transitions, 1302 flow [2025-03-17 11:13:30,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1298, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=601, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1302, PETRI_PLACES=604, PETRI_TRANSITIONS=601} [2025-03-17 11:13:30,483 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -58 predicate places. [2025-03-17 11:13:30,483 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 601 transitions, 1302 flow [2025-03-17 11:13:30,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:30,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:30,484 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:30,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-17 11:13:30,484 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:30,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:30,485 INFO L85 PathProgramCache]: Analyzing trace with hash -938249009, now seen corresponding path program 1 times [2025-03-17 11:13:30,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:30,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261056625] [2025-03-17 11:13:30,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:30,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:30,496 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-03-17 11:13:30,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-03-17 11:13:30,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:30,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:30,533 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-17 11:13:30,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:30,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261056625] [2025-03-17 11:13:30,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261056625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:30,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:30,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:30,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757392315] [2025-03-17 11:13:30,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:30,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:30,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:30,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:30,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-17 11:13:30,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 601 transitions, 1302 flow. Second operand has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:30,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:30,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-17 11:13:30,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:31,377 INFO L124 PetriNetUnfolderBase]: 155/6417 cut-off events. [2025-03-17 11:13:31,377 INFO L125 PetriNetUnfolderBase]: For 113/121 co-relation queries the response was YES. [2025-03-17 11:13:31,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7189 conditions, 6417 events. 155/6417 cut-off events. For 113/121 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 55361 event pairs, 32 based on Foata normal form. 0/6029 useless extension candidates. Maximal degree in co-relation 7082. Up to 185 conditions per place. [2025-03-17 11:13:31,443 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 15 selfloop transitions, 2 changer transitions 0/601 dead transitions. [2025-03-17 11:13:31,443 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 605 places, 601 transitions, 1337 flow [2025-03-17 11:13:31,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:31,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:31,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-17 11:13:31,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-17 11:13:31,444 INFO L175 Difference]: Start difference. First operand has 604 places, 601 transitions, 1302 flow. Second operand 3 states and 2014 transitions. [2025-03-17 11:13:31,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 605 places, 601 transitions, 1337 flow [2025-03-17 11:13:31,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 603 places, 601 transitions, 1333 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:31,450 INFO L231 Difference]: Finished difference. Result has 603 places, 600 transitions, 1300 flow [2025-03-17 11:13:31,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1296, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=600, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=598, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1300, PETRI_PLACES=603, PETRI_TRANSITIONS=600} [2025-03-17 11:13:31,451 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -59 predicate places. [2025-03-17 11:13:31,451 INFO L471 AbstractCegarLoop]: Abstraction has has 603 places, 600 transitions, 1300 flow [2025-03-17 11:13:31,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.0) internal successors, (2007), 3 states have internal predecessors, (2007), 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-17 11:13:31,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:13:31,452 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 11:13:31,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-17 11:13:31,452 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err23ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE (and 119 more)] === [2025-03-17 11:13:31,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:13:31,452 INFO L85 PathProgramCache]: Analyzing trace with hash -498573236, now seen corresponding path program 1 times [2025-03-17 11:13:31,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:13:31,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [526874240] [2025-03-17 11:13:31,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:13:31,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:13:31,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 254 statements into 1 equivalence classes. [2025-03-17 11:13:31,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 254 of 254 statements. [2025-03-17 11:13:31,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:13:31,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:13:31,486 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-17 11:13:31,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:13:31,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [526874240] [2025-03-17 11:13:31,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [526874240] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:13:31,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:13:31,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:13:31,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381605023] [2025-03-17 11:13:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:13:31,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:13:31,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:13:31,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:13:31,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:13:31,511 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 666 out of 705 [2025-03-17 11:13:31,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 603 places, 600 transitions, 1300 flow. Second operand has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:31,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:13:31,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 666 of 705 [2025-03-17 11:13:31,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:13:32,164 INFO L124 PetriNetUnfolderBase]: 175/6445 cut-off events. [2025-03-17 11:13:32,164 INFO L125 PetriNetUnfolderBase]: For 92/100 co-relation queries the response was YES. [2025-03-17 11:13:32,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7330 conditions, 6445 events. 175/6445 cut-off events. For 92/100 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56625 event pairs, 42 based on Foata normal form. 0/6066 useless extension candidates. Maximal degree in co-relation 7248. Up to 258 conditions per place. [2025-03-17 11:13:32,212 INFO L140 encePairwiseOnDemand]: 702/705 looper letters, 0 selfloop transitions, 0 changer transitions 600/600 dead transitions. [2025-03-17 11:13:32,212 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 604 places, 600 transitions, 1333 flow [2025-03-17 11:13:32,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:13:32,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:13:32,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2014 transitions. [2025-03-17 11:13:32,214 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9522458628841608 [2025-03-17 11:13:32,214 INFO L175 Difference]: Start difference. First operand has 603 places, 600 transitions, 1300 flow. Second operand 3 states and 2014 transitions. [2025-03-17 11:13:32,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 604 places, 600 transitions, 1333 flow [2025-03-17 11:13:32,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 602 places, 600 transitions, 1329 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:13:32,218 INFO L231 Difference]: Finished difference. Result has 602 places, 0 transitions, 0 flow [2025-03-17 11:13:32,219 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=705, PETRI_DIFFERENCE_MINUEND_FLOW=1294, PETRI_DIFFERENCE_MINUEND_PLACES=600, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=599, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=599, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=602, PETRI_TRANSITIONS=0} [2025-03-17 11:13:32,219 INFO L279 CegarLoopForPetriNet]: 662 programPoint places, -60 predicate places. [2025-03-17 11:13:32,219 INFO L471 AbstractCegarLoop]: Abstraction has has 602 places, 0 transitions, 0 flow [2025-03-17 11:13:32,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 669.3333333333334) internal successors, (2008), 3 states have internal predecessors, (2008), 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-17 11:13:32,221 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (122 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (121 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (120 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (119 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (118 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (117 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (116 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (115 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (114 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (113 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (112 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (111 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (110 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (109 of 123 remaining) [2025-03-17 11:13:32,222 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (108 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (107 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (106 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (105 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (104 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (103 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (102 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (101 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (100 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (99 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (98 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (97 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (96 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (95 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (94 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (93 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (92 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (91 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (90 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (89 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (88 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (87 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (86 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (85 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (84 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (83 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (82 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (81 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (80 of 123 remaining) [2025-03-17 11:13:32,223 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (79 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (78 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (77 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (76 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (75 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (74 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (73 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (72 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (71 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (70 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (69 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (68 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (67 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (66 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (65 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (64 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (63 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (62 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (61 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (60 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (59 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (58 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (57 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (56 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (55 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (54 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (53 of 123 remaining) [2025-03-17 11:13:32,224 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (52 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (51 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (50 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (49 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (48 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err23ASSERT_VIOLATIONDATA_RACE (47 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (46 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (45 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (44 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (43 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (42 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (41 of 123 remaining) [2025-03-17 11:13:32,225 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (40 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (39 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (38 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (36 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (34 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (33 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (32 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (31 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (30 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (29 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (28 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (27 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (26 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (25 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 123 remaining) [2025-03-17 11:13:32,226 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err23ASSERT_VIOLATIONDATA_RACE (23 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (22 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err22ASSERT_VIOLATIONDATA_RACE (21 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (20 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err21ASSERT_VIOLATIONDATA_RACE (19 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err20ASSERT_VIOLATIONDATA_RACE (18 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err19ASSERT_VIOLATIONDATA_RACE (17 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err18ASSERT_VIOLATIONDATA_RACE (16 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (15 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err17ASSERT_VIOLATIONDATA_RACE (14 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (13 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err16ASSERT_VIOLATIONDATA_RACE (12 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (11 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (10 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (9 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (8 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (7 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (6 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (5 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (4 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (3 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (2 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (1 of 123 remaining) [2025-03-17 11:13:32,227 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 123 remaining) [2025-03-17 11:13:32,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-17 11:13:32,228 INFO L422 BasicCegarLoop]: Path program 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] [2025-03-17 11:13:32,232 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-17 11:13:32,232 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-17 11:13:32,237 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.03 11:13:32 BasicIcfg [2025-03-17 11:13:32,237 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-17 11:13:32,238 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-17 11:13:32,238 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-17 11:13:32,238 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-17 11:13:32,239 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:13:10" (3/4) ... [2025-03-17 11:13:32,240 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-17 11:13:32,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-17 11:13:32,242 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-17 11:13:32,247 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-03-17 11:13:32,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-17 11:13:32,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-17 11:13:32,249 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-17 11:13:32,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-17 11:13:32,316 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-17 11:13:32,316 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-17 11:13:32,318 INFO L158 Benchmark]: Toolchain (without parser) took 22635.56ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 107.2MB in the beginning and 961.8MB in the end (delta: -854.6MB). Peak memory consumption was 487.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:32,318 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:32,319 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.33ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-17 11:13:32,319 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.60ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:32,319 INFO L158 Benchmark]: Boogie Preprocessor took 44.49ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 87.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-17 11:13:32,319 INFO L158 Benchmark]: IcfgBuilder took 769.76ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 44.7MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-03-17 11:13:32,320 INFO L158 Benchmark]: TraceAbstraction took 21449.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 44.7MB in the beginning and 970.2MB in the end (delta: -925.4MB). Peak memory consumption was 926.2MB. Max. memory is 16.1GB. [2025-03-17 11:13:32,320 INFO L158 Benchmark]: Witness Printer took 78.86ms. Allocated memory is still 1.5GB. Free memory was 970.2MB in the beginning and 961.8MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-17 11:13:32,321 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.33ms. Allocated memory is still 142.6MB. Free memory was 107.2MB in the beginning and 93.4MB in the end (delta: 13.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.60ms. Allocated memory is still 142.6MB. Free memory was 93.4MB in the beginning and 90.5MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 44.49ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 87.7MB in the end (delta: 2.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 769.76ms. Allocated memory is still 142.6MB. Free memory was 87.7MB in the beginning and 44.7MB in the end (delta: 43.0MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 21449.01ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 44.7MB in the beginning and 970.2MB in the end (delta: -925.4MB). Peak memory consumption was 926.2MB. Max. memory is 16.1GB. * Witness Printer took 78.86ms. Allocated memory is still 1.5GB. Free memory was 970.2MB in the beginning and 961.8MB 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: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 46]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 53]: 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: 63]: 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: 63]: 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: 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: 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: 75]: 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: 69]: 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: 69]: 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: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: 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: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 70]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: 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: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 114]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 102]: 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 5 procedures, 1100 locations, 1153 edges, 123 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: 21.3s, OverallIterations: 33, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.3s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1868 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 663 mSDsluCounter, 328 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 333 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2142 IncrementalHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 333 mSolverCounterUnsat, 328 mSDtfsCounter, 2142 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1384occurred in iteration=0, InterpolantAutomatonStates: 108, 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.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 4931 NumberOfCodeBlocks, 4931 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 4898 ConstructedInterpolants, 0 QuantifiedInterpolants, 5303 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 73 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-17 11:13:32,339 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