./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/chl-array-int-subst.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 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:04:14,734 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:04:14,786 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:04:14,790 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:04:14,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:04:14,812 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:04:14,813 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:04:14,813 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:04:14,814 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:04:14,814 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:04:14,814 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:04:14,815 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:04:14,815 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:04:14,815 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:04:14,815 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:04:14,815 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:04:14,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:04:14,815 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:04:14,815 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:04:14,816 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:04:14,817 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:14,817 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:04:14,817 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:04:14,817 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 -> 779f57e464f50d458e1b66270e0c9f2866c6247d4d7f63a3096c6ac13e286657 [2025-03-08 22:04:15,029 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:04:15,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:04:15,037 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:04:15,038 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:04:15,038 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:04:15,040 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-08 22:04:16,154 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34dd80934/04ed7d239bc64d08afc681203ee4c681/FLAGf6bd86c0e [2025-03-08 22:04:16,390 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:04:16,391 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-subst.wvr.c [2025-03-08 22:04:16,399 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34dd80934/04ed7d239bc64d08afc681203ee4c681/FLAGf6bd86c0e [2025-03-08 22:04:16,733 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/34dd80934/04ed7d239bc64d08afc681203ee4c681 [2025-03-08 22:04:16,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:04:16,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:04:16,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:16,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:04:16,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:04:16,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:16,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa33da1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16, skipping insertion in model container [2025-03-08 22:04:16,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:16,753 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:04:16,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:16,888 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:04:16,917 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:04:16,930 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:04:16,931 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16 WrapperNode [2025-03-08 22:04:16,931 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:04:16,932 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:16,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:04:16,933 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:04:16,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:16,946 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:16,973 INFO L138 Inliner]: procedures = 25, calls = 36, calls flagged for inlining = 15, calls inlined = 23, statements flattened = 476 [2025-03-08 22:04:16,974 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:04:16,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:04:16,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:04:16,975 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:04:16,983 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:16,984 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:16,988 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:16,988 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:17,005 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:17,006 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:17,013 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:17,015 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:17,017 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:04:17,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:04:17,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:04:17,018 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:04:17,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (1/1) ... [2025-03-08 22:04:17,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:04:17,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:17,050 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-08 22:04:17,053 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-08 22:04:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:04:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-03-08 22:04:17,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-03-08 22:04:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-03-08 22:04:17,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-03-08 22:04:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-03-08 22:04:17,073 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-03-08 22:04:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:04:17,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:04:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:04:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:04:17,074 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:04:17,074 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:04:17,075 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:04:17,173 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:04:17,175 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:04:17,794 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:04:17,794 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:04:17,819 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:04:17,819 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:04:17,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:17 BoogieIcfgContainer [2025-03-08 22:04:17,820 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:04:17,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:04:17,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:04:17,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:04:17,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:04:16" (1/3) ... [2025-03-08 22:04:17,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8668d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:17, skipping insertion in model container [2025-03-08 22:04:17,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:04:16" (2/3) ... [2025-03-08 22:04:17,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8668d97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:04:17, skipping insertion in model container [2025-03-08 22:04:17,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:17" (3/3) ... [2025-03-08 22:04:17,827 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-subst.wvr.c [2025-03-08 22:04:17,837 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:04:17,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-subst.wvr.c that has 4 procedures, 599 locations, 1 initial locations, 6 loop locations, and 59 error locations. [2025-03-08 22:04:17,839 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:04:17,974 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:04:18,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 608 places, 628 transitions, 1277 flow [2025-03-08 22:04:18,186 INFO L124 PetriNetUnfolderBase]: 30/625 cut-off events. [2025-03-08 22:04:18,189 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:18,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 638 conditions, 625 events. 30/625 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1565 event pairs, 0 based on Foata normal form. 0/536 useless extension candidates. Maximal degree in co-relation 464. Up to 3 conditions per place. [2025-03-08 22:04:18,204 INFO L82 GeneralOperation]: Start removeDead. Operand has 608 places, 628 transitions, 1277 flow [2025-03-08 22:04:18,216 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 587 places, 605 transitions, 1228 flow [2025-03-08 22:04:18,224 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:04:18,232 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;@6e80829a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:04:18,233 INFO L334 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2025-03-08 22:04:18,237 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:04:18,237 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-08 22:04:18,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:04:18,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:18,241 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-08 22:04:18,241 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:18,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:18,247 INFO L85 PathProgramCache]: Analyzing trace with hash 216662595, now seen corresponding path program 1 times [2025-03-08 22:04:18,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:18,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491252250] [2025-03-08 22:04:18,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:18,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:18,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-08 22:04:18,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 22:04:18,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:18,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:18,422 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-08 22:04:18,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:18,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491252250] [2025-03-08 22:04:18,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491252250] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:18,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:18,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:18,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377454702] [2025-03-08 22:04:18,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:18,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:18,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:18,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:18,505 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-03-08 22:04:18,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 587 places, 605 transitions, 1228 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-08 22:04:18,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:18,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-03-08 22:04:18,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:18,853 INFO L124 PetriNetUnfolderBase]: 56/1488 cut-off events. [2025-03-08 22:04:18,854 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-03-08 22:04:18,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1576 conditions, 1488 events. 56/1488 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 8344 event pairs, 20 based on Foata normal form. 39/1287 useless extension candidates. Maximal degree in co-relation 1200. Up to 51 conditions per place. [2025-03-08 22:04:18,882 INFO L140 encePairwiseOnDemand]: 609/628 looper letters, 14 selfloop transitions, 2 changer transitions 7/588 dead transitions. [2025-03-08 22:04:18,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 588 places, 588 transitions, 1226 flow [2025-03-08 22:04:18,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:18,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1809 transitions. [2025-03-08 22:04:18,900 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9601910828025477 [2025-03-08 22:04:18,901 INFO L175 Difference]: Start difference. First operand has 587 places, 605 transitions, 1228 flow. Second operand 3 states and 1809 transitions. [2025-03-08 22:04:18,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 588 places, 588 transitions, 1226 flow [2025-03-08 22:04:18,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 582 places, 588 transitions, 1214 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-03-08 22:04:18,919 INFO L231 Difference]: Finished difference. Result has 582 places, 581 transitions, 1172 flow [2025-03-08 22:04:18,922 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1182, PETRI_DIFFERENCE_MINUEND_PLACES=580, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=588, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=586, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1172, PETRI_PLACES=582, PETRI_TRANSITIONS=581} [2025-03-08 22:04:18,926 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -5 predicate places. [2025-03-08 22:04:18,926 INFO L471 AbstractCegarLoop]: Abstraction has has 582 places, 581 transitions, 1172 flow [2025-03-08 22:04:18,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-08 22:04:18,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:18,928 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-08 22:04:18,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:04:18,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:18,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:18,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1497021672, now seen corresponding path program 1 times [2025-03-08 22:04:18,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:18,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990805735] [2025-03-08 22:04:18,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:18,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:18,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 22:04:18,942 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 22:04:18,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:18,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:18,964 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-08 22:04:18,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:18,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990805735] [2025-03-08 22:04:18,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990805735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:18,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:18,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:18,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276380588] [2025-03-08 22:04:18,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:18,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:18,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:18,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:18,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:19,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-03-08 22:04:19,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 582 places, 581 transitions, 1172 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-08 22:04:19,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:19,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-03-08 22:04:19,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:19,169 INFO L124 PetriNetUnfolderBase]: 36/1024 cut-off events. [2025-03-08 22:04:19,169 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-08 22:04:19,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1076 conditions, 1024 events. 36/1024 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4602 event pairs, 12 based on Foata normal form. 0/876 useless extension candidates. Maximal degree in co-relation 1042. Up to 39 conditions per place. [2025-03-08 22:04:19,187 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/580 dead transitions. [2025-03-08 22:04:19,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 576 places, 580 transitions, 1202 flow [2025-03-08 22:04:19,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:19,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-03-08 22:04:19,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2025-03-08 22:04:19,194 INFO L175 Difference]: Start difference. First operand has 582 places, 581 transitions, 1172 flow. Second operand 3 states and 1793 transitions. [2025-03-08 22:04:19,195 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 576 places, 580 transitions, 1202 flow [2025-03-08 22:04:19,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 574 places, 580 transitions, 1198 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:19,202 INFO L231 Difference]: Finished difference. Result has 574 places, 580 transitions, 1170 flow [2025-03-08 22:04:19,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1166, PETRI_DIFFERENCE_MINUEND_PLACES=572, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1170, PETRI_PLACES=574, PETRI_TRANSITIONS=580} [2025-03-08 22:04:19,203 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -13 predicate places. [2025-03-08 22:04:19,204 INFO L471 AbstractCegarLoop]: Abstraction has has 574 places, 580 transitions, 1170 flow [2025-03-08 22:04:19,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-08 22:04:19,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:19,205 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-08 22:04:19,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:04:19,205 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:19,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1231009932, now seen corresponding path program 1 times [2025-03-08 22:04:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:19,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194086453] [2025-03-08 22:04:19,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:19,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-08 22:04:19,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-08 22:04:19,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:19,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:19,257 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-08 22:04:19,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:19,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194086453] [2025-03-08 22:04:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194086453] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:19,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342506321] [2025-03-08 22:04:19,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:19,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:19,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:19,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:19,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:19,287 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 592 out of 628 [2025-03-08 22:04:19,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 574 places, 580 transitions, 1170 flow. Second operand has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-08 22:04:19,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:19,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 592 of 628 [2025-03-08 22:04:19,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:19,521 INFO L124 PetriNetUnfolderBase]: 56/1455 cut-off events. [2025-03-08 22:04:19,522 INFO L125 PetriNetUnfolderBase]: For 13/16 co-relation queries the response was YES. [2025-03-08 22:04:19,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1517 conditions, 1455 events. 56/1455 cut-off events. For 13/16 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7812 event pairs, 20 based on Foata normal form. 0/1233 useless extension candidates. Maximal degree in co-relation 1475. Up to 51 conditions per place. [2025-03-08 22:04:19,538 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 14 selfloop transitions, 2 changer transitions 0/579 dead transitions. [2025-03-08 22:04:19,538 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 575 places, 579 transitions, 1200 flow [2025-03-08 22:04:19,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:19,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:19,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1793 transitions. [2025-03-08 22:04:19,542 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9516985138004246 [2025-03-08 22:04:19,542 INFO L175 Difference]: Start difference. First operand has 574 places, 580 transitions, 1170 flow. Second operand 3 states and 1793 transitions. [2025-03-08 22:04:19,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 575 places, 579 transitions, 1200 flow [2025-03-08 22:04:19,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 573 places, 579 transitions, 1196 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:19,549 INFO L231 Difference]: Finished difference. Result has 573 places, 579 transitions, 1168 flow [2025-03-08 22:04:19,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1164, PETRI_DIFFERENCE_MINUEND_PLACES=571, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1168, PETRI_PLACES=573, PETRI_TRANSITIONS=579} [2025-03-08 22:04:19,551 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -14 predicate places. [2025-03-08 22:04:19,551 INFO L471 AbstractCegarLoop]: Abstraction has has 573 places, 579 transitions, 1168 flow [2025-03-08 22:04:19,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.3333333333334) internal successors, (1780), 3 states have internal predecessors, (1780), 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-08 22:04:19,552 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:19,552 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:19,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:04:19,552 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:19,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:19,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1457272868, now seen corresponding path program 1 times [2025-03-08 22:04:19,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:19,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009106946] [2025-03-08 22:04:19,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:19,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:19,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-08 22:04:19,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-08 22:04:19,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:19,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:19,605 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-08 22:04:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009106946] [2025-03-08 22:04:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009106946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600886146] [2025-03-08 22:04:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:19,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:19,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:19,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:19,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:19,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-03-08 22:04:19,635 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 573 places, 579 transitions, 1168 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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-08 22:04:19,635 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:19,635 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-03-08 22:04:19,635 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:20,026 INFO L124 PetriNetUnfolderBase]: 132/2496 cut-off events. [2025-03-08 22:04:20,026 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:04:20,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2671 conditions, 2496 events. 132/2496 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 18555 event pairs, 64 based on Foata normal form. 0/2124 useless extension candidates. Maximal degree in co-relation 2621. Up to 138 conditions per place. [2025-03-08 22:04:20,052 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/574 dead transitions. [2025-03-08 22:04:20,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 574 transitions, 1192 flow [2025-03-08 22:04:20,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:20,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-03-08 22:04:20,055 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-03-08 22:04:20,055 INFO L175 Difference]: Start difference. First operand has 573 places, 579 transitions, 1168 flow. Second operand 3 states and 1786 transitions. [2025-03-08 22:04:20,055 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 574 transitions, 1192 flow [2025-03-08 22:04:20,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 568 places, 574 transitions, 1188 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:20,061 INFO L231 Difference]: Finished difference. Result has 568 places, 574 transitions, 1156 flow [2025-03-08 22:04:20,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1154, PETRI_DIFFERENCE_MINUEND_PLACES=566, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=573, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1156, PETRI_PLACES=568, PETRI_TRANSITIONS=574} [2025-03-08 22:04:20,062 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2025-03-08 22:04:20,062 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 574 transitions, 1156 flow [2025-03-08 22:04:20,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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-08 22:04:20,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:20,064 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] [2025-03-08 22:04:20,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:04:20,064 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:20,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1011671847, now seen corresponding path program 1 times [2025-03-08 22:04:20,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:20,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468675559] [2025-03-08 22:04:20,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:20,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:20,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 22:04:20,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 22:04:20,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:20,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:20,593 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-08 22:04:20,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:20,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468675559] [2025-03-08 22:04:20,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468675559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:20,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:20,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:20,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210104910] [2025-03-08 22:04:20,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:20,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:20,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:20,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:20,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:21,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 514 out of 628 [2025-03-08 22:04:21,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 574 transitions, 1156 flow. Second operand has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 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-08 22:04:21,090 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:21,090 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 514 of 628 [2025-03-08 22:04:21,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:27,464 INFO L124 PetriNetUnfolderBase]: 12107/56152 cut-off events. [2025-03-08 22:04:27,465 INFO L125 PetriNetUnfolderBase]: For 899/901 co-relation queries the response was YES. [2025-03-08 22:04:27,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73633 conditions, 56152 events. 12107/56152 cut-off events. For 899/901 co-relation queries the response was YES. Maximal size of possible extension queue 1068. Compared 784538 event pairs, 10080 based on Foata normal form. 0/48904 useless extension candidates. Maximal degree in co-relation 73584. Up to 17156 conditions per place. [2025-03-08 22:04:27,865 INFO L140 encePairwiseOnDemand]: 610/628 looper letters, 78 selfloop transitions, 15 changer transitions 0/571 dead transitions. [2025-03-08 22:04:27,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 571 transitions, 1336 flow [2025-03-08 22:04:27,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:27,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:27,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3180 transitions. [2025-03-08 22:04:27,872 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8439490445859873 [2025-03-08 22:04:27,873 INFO L175 Difference]: Start difference. First operand has 568 places, 574 transitions, 1156 flow. Second operand 6 states and 3180 transitions. [2025-03-08 22:04:27,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 571 transitions, 1336 flow [2025-03-08 22:04:27,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 571 transitions, 1335 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:27,882 INFO L231 Difference]: Finished difference. Result has 569 places, 571 transitions, 1179 flow [2025-03-08 22:04:27,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1149, PETRI_DIFFERENCE_MINUEND_PLACES=564, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=571, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1179, PETRI_PLACES=569, PETRI_TRANSITIONS=571} [2025-03-08 22:04:27,885 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2025-03-08 22:04:27,886 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 571 transitions, 1179 flow [2025-03-08 22:04:27,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 515.5) internal successors, (3093), 6 states have internal predecessors, (3093), 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-08 22:04:27,888 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:27,888 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] [2025-03-08 22:04:27,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:04:27,889 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:27,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:27,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1402852889, now seen corresponding path program 1 times [2025-03-08 22:04:27,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:27,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762323049] [2025-03-08 22:04:27,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:27,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:27,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-03-08 22:04:27,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-03-08 22:04:27,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:27,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:27,937 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-08 22:04:27,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:27,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762323049] [2025-03-08 22:04:27,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762323049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:27,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:27,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:27,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864071872] [2025-03-08 22:04:27,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:27,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:27,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:27,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:27,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:27,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-03-08 22:04:27,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 571 transitions, 1179 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-08 22:04:27,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:27,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-03-08 22:04:27,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:28,134 INFO L124 PetriNetUnfolderBase]: 62/1744 cut-off events. [2025-03-08 22:04:28,135 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-08 22:04:28,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1744 events. 62/1744 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9908 event pairs, 20 based on Foata normal form. 0/1484 useless extension candidates. Maximal degree in co-relation 1779. Up to 50 conditions per place. [2025-03-08 22:04:28,157 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/570 dead transitions. [2025-03-08 22:04:28,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 570 places, 570 transitions, 1207 flow [2025-03-08 22:04:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:28,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:28,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-03-08 22:04:28,160 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-03-08 22:04:28,160 INFO L175 Difference]: Start difference. First operand has 569 places, 571 transitions, 1179 flow. Second operand 3 states and 1795 transitions. [2025-03-08 22:04:28,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 570 places, 570 transitions, 1207 flow [2025-03-08 22:04:28,163 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 565 places, 570 transitions, 1177 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:28,166 INFO L231 Difference]: Finished difference. Result has 565 places, 570 transitions, 1151 flow [2025-03-08 22:04:28,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1147, PETRI_DIFFERENCE_MINUEND_PLACES=563, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=568, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1151, PETRI_PLACES=565, PETRI_TRANSITIONS=570} [2025-03-08 22:04:28,167 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -22 predicate places. [2025-03-08 22:04:28,167 INFO L471 AbstractCegarLoop]: Abstraction has has 565 places, 570 transitions, 1151 flow [2025-03-08 22:04:28,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-08 22:04:28,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:28,169 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] [2025-03-08 22:04:28,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:04:28,169 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:28,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:28,171 INFO L85 PathProgramCache]: Analyzing trace with hash 134168059, now seen corresponding path program 1 times [2025-03-08 22:04:28,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:28,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253010585] [2025-03-08 22:04:28,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:28,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:28,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-03-08 22:04:28,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-03-08 22:04:28,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:28,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:28,305 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-08 22:04:28,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:28,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253010585] [2025-03-08 22:04:28,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253010585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:28,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:28,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:28,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213441443] [2025-03-08 22:04:28,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:28,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:28,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:28,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:28,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:28,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-03-08 22:04:28,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 565 places, 570 transitions, 1151 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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-08 22:04:28,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:28,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-03-08 22:04:28,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:28,791 INFO L124 PetriNetUnfolderBase]: 78/1635 cut-off events. [2025-03-08 22:04:28,791 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:04:28,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1740 conditions, 1635 events. 78/1635 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9931 event pairs, 32 based on Foata normal form. 0/1412 useless extension candidates. Maximal degree in co-relation 1690. Up to 87 conditions per place. [2025-03-08 22:04:28,864 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/565 dead transitions. [2025-03-08 22:04:28,865 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 562 places, 565 transitions, 1175 flow [2025-03-08 22:04:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:28,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:28,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-03-08 22:04:28,871 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-03-08 22:04:28,871 INFO L175 Difference]: Start difference. First operand has 565 places, 570 transitions, 1151 flow. Second operand 3 states and 1786 transitions. [2025-03-08 22:04:28,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 562 places, 565 transitions, 1175 flow [2025-03-08 22:04:28,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 565 transitions, 1171 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:28,882 INFO L231 Difference]: Finished difference. Result has 560 places, 565 transitions, 1139 flow [2025-03-08 22:04:28,882 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=564, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=560, PETRI_TRANSITIONS=565} [2025-03-08 22:04:28,884 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2025-03-08 22:04:28,884 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 565 transitions, 1139 flow [2025-03-08 22:04:28,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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-08 22:04:28,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:28,885 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] [2025-03-08 22:04:28,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:04:28,886 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:28,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:28,886 INFO L85 PathProgramCache]: Analyzing trace with hash 217423265, now seen corresponding path program 1 times [2025-03-08 22:04:28,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:28,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442932355] [2025-03-08 22:04:28,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:28,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:28,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-08 22:04:28,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-08 22:04:28,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:28,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:28,958 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-08 22:04:28,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:28,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442932355] [2025-03-08 22:04:28,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442932355] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:28,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:28,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:28,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152014789] [2025-03-08 22:04:28,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:28,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:28,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:28,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:28,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:28,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-03-08 22:04:28,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 565 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-08 22:04:28,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:28,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-03-08 22:04:28,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:29,248 INFO L124 PetriNetUnfolderBase]: 36/1038 cut-off events. [2025-03-08 22:04:29,249 INFO L125 PetriNetUnfolderBase]: For 3/5 co-relation queries the response was YES. [2025-03-08 22:04:29,285 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1089 conditions, 1038 events. 36/1038 cut-off events. For 3/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4387 event pairs, 12 based on Foata normal form. 0/908 useless extension candidates. Maximal degree in co-relation 1039. Up to 38 conditions per place. [2025-03-08 22:04:29,294 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/564 dead transitions. [2025-03-08 22:04:29,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 564 transitions, 1167 flow [2025-03-08 22:04:29,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:29,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:29,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-03-08 22:04:29,302 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-03-08 22:04:29,302 INFO L175 Difference]: Start difference. First operand has 560 places, 565 transitions, 1139 flow. Second operand 3 states and 1795 transitions. [2025-03-08 22:04:29,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 564 transitions, 1167 flow [2025-03-08 22:04:29,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 560 places, 564 transitions, 1166 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:29,314 INFO L231 Difference]: Finished difference. Result has 560 places, 564 transitions, 1140 flow [2025-03-08 22:04:29,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1136, PETRI_DIFFERENCE_MINUEND_PLACES=558, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=564, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=562, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1140, PETRI_PLACES=560, PETRI_TRANSITIONS=564} [2025-03-08 22:04:29,316 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -27 predicate places. [2025-03-08 22:04:29,316 INFO L471 AbstractCegarLoop]: Abstraction has has 560 places, 564 transitions, 1140 flow [2025-03-08 22:04:29,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-08 22:04:29,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:29,317 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] [2025-03-08 22:04:29,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:04:29,318 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:29,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:29,318 INFO L85 PathProgramCache]: Analyzing trace with hash 959356261, now seen corresponding path program 1 times [2025-03-08 22:04:29,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:29,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751857702] [2025-03-08 22:04:29,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:29,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:29,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:04:29,338 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:04:29,338 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:29,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:29,387 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-08 22:04:29,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:29,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751857702] [2025-03-08 22:04:29,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751857702] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:29,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:29,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:29,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193020775] [2025-03-08 22:04:29,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:29,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:29,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:29,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:29,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:29,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 588 out of 628 [2025-03-08 22:04:29,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 560 places, 564 transitions, 1140 flow. Second operand has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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-08 22:04:29,414 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:29,414 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 588 of 628 [2025-03-08 22:04:29,415 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:29,812 INFO L124 PetriNetUnfolderBase]: 136/2442 cut-off events. [2025-03-08 22:04:29,812 INFO L125 PetriNetUnfolderBase]: For 35/39 co-relation queries the response was YES. [2025-03-08 22:04:29,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2598 conditions, 2442 events. 136/2442 cut-off events. For 35/39 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 17740 event pairs, 64 based on Foata normal form. 0/2112 useless extension candidates. Maximal degree in co-relation 2548. Up to 141 conditions per place. [2025-03-08 22:04:29,834 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 16 selfloop transitions, 1 changer transitions 0/559 dead transitions. [2025-03-08 22:04:29,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 557 places, 559 transitions, 1164 flow [2025-03-08 22:04:29,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:29,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:29,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1786 transitions. [2025-03-08 22:04:29,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9479830148619958 [2025-03-08 22:04:29,837 INFO L175 Difference]: Start difference. First operand has 560 places, 564 transitions, 1140 flow. Second operand 3 states and 1786 transitions. [2025-03-08 22:04:29,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 557 places, 559 transitions, 1164 flow [2025-03-08 22:04:29,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 559 transitions, 1160 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:29,843 INFO L231 Difference]: Finished difference. Result has 555 places, 559 transitions, 1128 flow [2025-03-08 22:04:29,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1126, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1128, PETRI_PLACES=555, PETRI_TRANSITIONS=559} [2025-03-08 22:04:29,844 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-03-08 22:04:29,844 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 559 transitions, 1128 flow [2025-03-08 22:04:29,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 589.0) internal successors, (1767), 3 states have internal predecessors, (1767), 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-08 22:04:29,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:29,845 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] [2025-03-08 22:04:29,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:04:29,845 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:29,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1527391021, now seen corresponding path program 1 times [2025-03-08 22:04:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:29,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361419270] [2025-03-08 22:04:29,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:29,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:29,853 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 22:04:29,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 22:04:29,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:29,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:29,891 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-08 22:04:29,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:29,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361419270] [2025-03-08 22:04:29,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361419270] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:29,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:29,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:29,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894992307] [2025-03-08 22:04:29,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:29,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:29,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:29,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:29,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:29,918 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 593 out of 628 [2025-03-08 22:04:29,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 559 transitions, 1128 flow. Second operand has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-08 22:04:29,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:29,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 593 of 628 [2025-03-08 22:04:29,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:30,004 INFO L124 PetriNetUnfolderBase]: 38/810 cut-off events. [2025-03-08 22:04:30,005 INFO L125 PetriNetUnfolderBase]: For 9/11 co-relation queries the response was YES. [2025-03-08 22:04:30,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 810 events. 38/810 cut-off events. For 9/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3034 event pairs, 20 based on Foata normal form. 0/723 useless extension candidates. Maximal degree in co-relation 822. Up to 50 conditions per place. [2025-03-08 22:04:30,020 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-08 22:04:30,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1156 flow [2025-03-08 22:04:30,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:30,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:30,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1795 transitions. [2025-03-08 22:04:30,023 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95276008492569 [2025-03-08 22:04:30,023 INFO L175 Difference]: Start difference. First operand has 555 places, 559 transitions, 1128 flow. Second operand 3 states and 1795 transitions. [2025-03-08 22:04:30,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1156 flow [2025-03-08 22:04:30,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 555 places, 558 transitions, 1155 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:30,029 INFO L231 Difference]: Finished difference. Result has 555 places, 558 transitions, 1129 flow [2025-03-08 22:04:30,030 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1125, PETRI_DIFFERENCE_MINUEND_PLACES=553, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=558, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=556, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1129, PETRI_PLACES=555, PETRI_TRANSITIONS=558} [2025-03-08 22:04:30,031 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-03-08 22:04:30,031 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 558 transitions, 1129 flow [2025-03-08 22:04:30,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 594.3333333333334) internal successors, (1783), 3 states have internal predecessors, (1783), 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-08 22:04:30,032 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:30,032 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] [2025-03-08 22:04:30,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:04:30,032 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:30,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:30,033 INFO L85 PathProgramCache]: Analyzing trace with hash 53839193, now seen corresponding path program 1 times [2025-03-08 22:04:30,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:30,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093542272] [2025-03-08 22:04:30,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:30,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:30,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 22:04:30,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 22:04:30,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:30,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:30,073 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-08 22:04:30,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:30,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093542272] [2025-03-08 22:04:30,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093542272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:30,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:30,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:30,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900531659] [2025-03-08 22:04:30,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:30,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:30,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:30,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:30,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:30,087 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 628 [2025-03-08 22:04:30,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 558 transitions, 1129 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 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-08 22:04:30,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:30,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 628 [2025-03-08 22:04:30,089 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:30,192 INFO L124 PetriNetUnfolderBase]: 34/990 cut-off events. [2025-03-08 22:04:30,192 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:04:30,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1043 conditions, 990 events. 34/990 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4370 event pairs, 6 based on Foata normal form. 0/878 useless extension candidates. Maximal degree in co-relation 994. Up to 23 conditions per place. [2025-03-08 22:04:30,206 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 12 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-03-08 22:04:30,207 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 559 transitions, 1161 flow [2025-03-08 22:04:30,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:30,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-08 22:04:30,210 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-08 22:04:30,210 INFO L175 Difference]: Start difference. First operand has 555 places, 558 transitions, 1129 flow. Second operand 3 states and 1806 transitions. [2025-03-08 22:04:30,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 559 transitions, 1161 flow [2025-03-08 22:04:30,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 559 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:30,216 INFO L231 Difference]: Finished difference. Result has 554 places, 557 transitions, 1127 flow [2025-03-08 22:04:30,217 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=557, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1127, PETRI_PLACES=554, PETRI_TRANSITIONS=557} [2025-03-08 22:04:30,218 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2025-03-08 22:04:30,218 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 557 transitions, 1127 flow [2025-03-08 22:04:30,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 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-08 22:04:30,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:30,219 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] [2025-03-08 22:04:30,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:04:30,219 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:30,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 146204518, now seen corresponding path program 1 times [2025-03-08 22:04:30,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:30,220 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424912674] [2025-03-08 22:04:30,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:30,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:30,232 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-08 22:04:30,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-08 22:04:30,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:30,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:30,268 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-08 22:04:30,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:30,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424912674] [2025-03-08 22:04:30,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424912674] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:30,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:30,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:30,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323243147] [2025-03-08 22:04:30,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:30,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:30,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:30,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:30,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:30,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:30,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 557 transitions, 1127 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 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-08 22:04:30,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:30,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:30,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:30,374 INFO L124 PetriNetUnfolderBase]: 31/876 cut-off events. [2025-03-08 22:04:30,374 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-03-08 22:04:30,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 925 conditions, 876 events. 31/876 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3410 event pairs, 6 based on Foata normal form. 1/783 useless extension candidates. Maximal degree in co-relation 876. Up to 24 conditions per place. [2025-03-08 22:04:30,387 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-08 22:04:30,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 558 transitions, 1161 flow [2025-03-08 22:04:30,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:30,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:30,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-03-08 22:04:30,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-03-08 22:04:30,390 INFO L175 Difference]: Start difference. First operand has 554 places, 557 transitions, 1127 flow. Second operand 3 states and 1804 transitions. [2025-03-08 22:04:30,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 558 transitions, 1161 flow [2025-03-08 22:04:30,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 558 transitions, 1157 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:30,396 INFO L231 Difference]: Finished difference. Result has 553 places, 556 transitions, 1125 flow [2025-03-08 22:04:30,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1125, PETRI_PLACES=553, PETRI_TRANSITIONS=556} [2025-03-08 22:04:30,397 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -34 predicate places. [2025-03-08 22:04:30,397 INFO L471 AbstractCegarLoop]: Abstraction has has 553 places, 556 transitions, 1125 flow [2025-03-08 22:04:30,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 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-08 22:04:30,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:30,398 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] [2025-03-08 22:04:30,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:04:30,398 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:30,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:30,399 INFO L85 PathProgramCache]: Analyzing trace with hash 183044137, now seen corresponding path program 1 times [2025-03-08 22:04:30,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:30,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574617023] [2025-03-08 22:04:30,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:30,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:30,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-08 22:04:30,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-08 22:04:30,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:30,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:30,452 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-08 22:04:30,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:30,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574617023] [2025-03-08 22:04:30,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574617023] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:30,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:30,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:30,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732927511] [2025-03-08 22:04:30,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:30,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:30,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:30,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:30,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:30,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:30,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 553 places, 556 transitions, 1125 flow. Second operand has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 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-08 22:04:30,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:30,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:30,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:30,554 INFO L124 PetriNetUnfolderBase]: 40/991 cut-off events. [2025-03-08 22:04:30,554 INFO L125 PetriNetUnfolderBase]: For 2/18 co-relation queries the response was YES. [2025-03-08 22:04:30,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1071 conditions, 991 events. 40/991 cut-off events. For 2/18 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4324 event pairs, 12 based on Foata normal form. 1/879 useless extension candidates. Maximal degree in co-relation 1022. Up to 39 conditions per place. [2025-03-08 22:04:30,567 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/559 dead transitions. [2025-03-08 22:04:30,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 559 transitions, 1167 flow [2025-03-08 22:04:30,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:30,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:30,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-08 22:04:30,570 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-08 22:04:30,570 INFO L175 Difference]: Start difference. First operand has 553 places, 556 transitions, 1125 flow. Second operand 3 states and 1806 transitions. [2025-03-08 22:04:30,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 559 transitions, 1167 flow [2025-03-08 22:04:30,573 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 559 transitions, 1163 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:30,578 INFO L231 Difference]: Finished difference. Result has 555 places, 557 transitions, 1139 flow [2025-03-08 22:04:30,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1121, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1139, PETRI_PLACES=555, PETRI_TRANSITIONS=557} [2025-03-08 22:04:30,580 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -32 predicate places. [2025-03-08 22:04:30,580 INFO L471 AbstractCegarLoop]: Abstraction has has 555 places, 557 transitions, 1139 flow [2025-03-08 22:04:30,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 597.6666666666666) internal successors, (1793), 3 states have internal predecessors, (1793), 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-08 22:04:30,581 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:30,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:30,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 22:04:30,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread3Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:30,582 INFO L85 PathProgramCache]: Analyzing trace with hash 482376399, now seen corresponding path program 1 times [2025-03-08 22:04:30,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:30,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84099787] [2025-03-08 22:04:30,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:30,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:30,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 22:04:30,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 22:04:30,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:30,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:30,667 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-08 22:04:30,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:30,667 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84099787] [2025-03-08 22:04:30,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84099787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:30,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:30,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:30,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27483636] [2025-03-08 22:04:30,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:30,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:30,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:30,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:30,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:30,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:30,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 555 places, 557 transitions, 1139 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-08 22:04:30,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:30,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:30,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:30,801 INFO L124 PetriNetUnfolderBase]: 28/766 cut-off events. [2025-03-08 22:04:30,801 INFO L125 PetriNetUnfolderBase]: For 13/15 co-relation queries the response was YES. [2025-03-08 22:04:30,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 817 conditions, 766 events. 28/766 cut-off events. For 13/15 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2604 event pairs, 6 based on Foata normal form. 0/691 useless extension candidates. Maximal degree in co-relation 767. Up to 24 conditions per place. [2025-03-08 22:04:30,812 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 13 selfloop transitions, 2 changer transitions 0/558 dead transitions. [2025-03-08 22:04:30,812 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 556 places, 558 transitions, 1173 flow [2025-03-08 22:04:30,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:30,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:30,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-03-08 22:04:30,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-03-08 22:04:30,816 INFO L175 Difference]: Start difference. First operand has 555 places, 557 transitions, 1139 flow. Second operand 3 states and 1804 transitions. [2025-03-08 22:04:30,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 556 places, 558 transitions, 1173 flow [2025-03-08 22:04:30,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 558 transitions, 1167 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:30,823 INFO L231 Difference]: Finished difference. Result has 554 places, 556 transitions, 1135 flow [2025-03-08 22:04:30,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1131, PETRI_DIFFERENCE_MINUEND_PLACES=552, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=554, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1135, PETRI_PLACES=554, PETRI_TRANSITIONS=556} [2025-03-08 22:04:30,824 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -33 predicate places. [2025-03-08 22:04:30,824 INFO L471 AbstractCegarLoop]: Abstraction has has 554 places, 556 transitions, 1135 flow [2025-03-08 22:04:30,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-08 22:04:30,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:30,826 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] [2025-03-08 22:04:30,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:04:30,826 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:30,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:30,827 INFO L85 PathProgramCache]: Analyzing trace with hash 66898888, now seen corresponding path program 1 times [2025-03-08 22:04:30,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:30,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781847880] [2025-03-08 22:04:30,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:30,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:30,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-03-08 22:04:30,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-03-08 22:04:30,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:30,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:30,878 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-08 22:04:30,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:30,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781847880] [2025-03-08 22:04:30,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781847880] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:30,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:30,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92818596] [2025-03-08 22:04:30,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:30,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:30,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:30,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:30,895 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-03-08 22:04:30,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 554 places, 556 transitions, 1135 flow. Second operand has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-08 22:04:30,898 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:30,898 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-03-08 22:04:30,898 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:31,248 INFO L124 PetriNetUnfolderBase]: 131/2145 cut-off events. [2025-03-08 22:04:31,248 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-03-08 22:04:31,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2376 conditions, 2145 events. 131/2145 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 14836 event pairs, 24 based on Foata normal form. 0/1899 useless extension candidates. Maximal degree in co-relation 2326. Up to 154 conditions per place. [2025-03-08 22:04:31,279 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 20 selfloop transitions, 2 changer transitions 0/559 dead transitions. [2025-03-08 22:04:31,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 552 places, 559 transitions, 1190 flow [2025-03-08 22:04:31,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:31,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:31,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2025-03-08 22:04:31,282 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2025-03-08 22:04:31,282 INFO L175 Difference]: Start difference. First operand has 554 places, 556 transitions, 1135 flow. Second operand 3 states and 1799 transitions. [2025-03-08 22:04:31,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 552 places, 559 transitions, 1190 flow [2025-03-08 22:04:31,285 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 559 transitions, 1186 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:31,289 INFO L231 Difference]: Finished difference. Result has 551 places, 554 transitions, 1137 flow [2025-03-08 22:04:31,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=548, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1137, PETRI_PLACES=551, PETRI_TRANSITIONS=554} [2025-03-08 22:04:31,290 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -36 predicate places. [2025-03-08 22:04:31,290 INFO L471 AbstractCegarLoop]: Abstraction has has 551 places, 554 transitions, 1137 flow [2025-03-08 22:04:31,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.3333333333334) internal successors, (1777), 3 states have internal predecessors, (1777), 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-08 22:04:31,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:31,291 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] [2025-03-08 22:04:31,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 22:04:31,291 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:31,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:31,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1418788181, now seen corresponding path program 1 times [2025-03-08 22:04:31,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:31,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007600426] [2025-03-08 22:04:31,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:31,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:31,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-08 22:04:31,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-08 22:04:31,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:31,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:31,505 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-08 22:04:31,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:31,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007600426] [2025-03-08 22:04:31,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007600426] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:31,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:31,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:31,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357209775] [2025-03-08 22:04:31,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:31,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:31,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:31,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:31,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:31,984 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-08 22:04:31,993 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 551 places, 554 transitions, 1137 flow. Second operand has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 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-08 22:04:31,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:31,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-08 22:04:31,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:32,358 INFO L124 PetriNetUnfolderBase]: 98/1577 cut-off events. [2025-03-08 22:04:32,358 INFO L125 PetriNetUnfolderBase]: For 6/38 co-relation queries the response was YES. [2025-03-08 22:04:32,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1577 events. 98/1577 cut-off events. For 6/38 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8606 event pairs, 45 based on Foata normal form. 5/1448 useless extension candidates. Maximal degree in co-relation 1889. Up to 158 conditions per place. [2025-03-08 22:04:32,380 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 69 selfloop transitions, 15 changer transitions 0/592 dead transitions. [2025-03-08 22:04:32,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 561 places, 592 transitions, 1397 flow [2025-03-08 22:04:32,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:32,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:32,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2025-03-08 22:04:32,388 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118413433700058 [2025-03-08 22:04:32,388 INFO L175 Difference]: Start difference. First operand has 551 places, 554 transitions, 1137 flow. Second operand 11 states and 6299 transitions. [2025-03-08 22:04:32,388 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 561 places, 592 transitions, 1397 flow [2025-03-08 22:04:32,392 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 592 transitions, 1397 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:32,396 INFO L231 Difference]: Finished difference. Result has 566 places, 562 transitions, 1213 flow [2025-03-08 22:04:32,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1137, PETRI_DIFFERENCE_MINUEND_PLACES=551, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=554, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1213, PETRI_PLACES=566, PETRI_TRANSITIONS=562} [2025-03-08 22:04:32,397 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -21 predicate places. [2025-03-08 22:04:32,397 INFO L471 AbstractCegarLoop]: Abstraction has has 566 places, 562 transitions, 1213 flow [2025-03-08 22:04:32,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.125) internal successors, (4553), 8 states have internal predecessors, (4553), 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-08 22:04:32,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:32,398 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] [2025-03-08 22:04:32,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:04:32,398 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:32,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:32,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1779505831, now seen corresponding path program 1 times [2025-03-08 22:04:32,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:32,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023073807] [2025-03-08 22:04:32,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:32,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:32,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 22:04:32,416 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 22:04:32,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:32,417 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:32,452 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-08 22:04:32,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:32,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023073807] [2025-03-08 22:04:32,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023073807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:32,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:32,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:32,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580029809] [2025-03-08 22:04:32,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:32,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:32,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:32,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:32,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:32,462 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:32,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 566 places, 562 transitions, 1213 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 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-08 22:04:32,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:32,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:32,464 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:32,754 INFO L124 PetriNetUnfolderBase]: 132/1836 cut-off events. [2025-03-08 22:04:32,754 INFO L125 PetriNetUnfolderBase]: For 91/154 co-relation queries the response was YES. [2025-03-08 22:04:32,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2121 conditions, 1836 events. 132/1836 cut-off events. For 91/154 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 10758 event pairs, 48 based on Foata normal form. 0/1618 useless extension candidates. Maximal degree in co-relation 2062. Up to 149 conditions per place. [2025-03-08 22:04:32,778 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/565 dead transitions. [2025-03-08 22:04:32,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 568 places, 565 transitions, 1255 flow [2025-03-08 22:04:32,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:32,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:32,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-08 22:04:32,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-08 22:04:32,781 INFO L175 Difference]: Start difference. First operand has 566 places, 562 transitions, 1213 flow. Second operand 3 states and 1806 transitions. [2025-03-08 22:04:32,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 568 places, 565 transitions, 1255 flow [2025-03-08 22:04:32,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 565 transitions, 1251 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:32,790 INFO L231 Difference]: Finished difference. Result has 569 places, 563 transitions, 1227 flow [2025-03-08 22:04:32,790 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1209, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=559, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1227, PETRI_PLACES=569, PETRI_TRANSITIONS=563} [2025-03-08 22:04:32,790 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -18 predicate places. [2025-03-08 22:04:32,791 INFO L471 AbstractCegarLoop]: Abstraction has has 569 places, 563 transitions, 1227 flow [2025-03-08 22:04:32,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 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-08 22:04:32,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:32,795 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] [2025-03-08 22:04:32,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:04:32,795 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:32,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:32,796 INFO L85 PathProgramCache]: Analyzing trace with hash 652246130, now seen corresponding path program 1 times [2025-03-08 22:04:32,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:32,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990613029] [2025-03-08 22:04:32,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:32,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:32,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 22:04:32,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 22:04:32,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:32,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:32,848 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-08 22:04:32,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:32,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990613029] [2025-03-08 22:04:32,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990613029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:32,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:32,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:32,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433061529] [2025-03-08 22:04:32,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:32,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:32,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:32,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:32,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:32,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 569 places, 563 transitions, 1227 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-08 22:04:32,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:32,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:32,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:33,218 INFO L124 PetriNetUnfolderBase]: 137/1985 cut-off events. [2025-03-08 22:04:33,218 INFO L125 PetriNetUnfolderBase]: For 68/101 co-relation queries the response was YES. [2025-03-08 22:04:33,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2366 conditions, 1985 events. 137/1985 cut-off events. For 68/101 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 13041 event pairs, 48 based on Foata normal form. 0/1779 useless extension candidates. Maximal degree in co-relation 2307. Up to 152 conditions per place. [2025-03-08 22:04:33,258 INFO L140 encePairwiseOnDemand]: 624/628 looper letters, 14 selfloop transitions, 3 changer transitions 0/566 dead transitions. [2025-03-08 22:04:33,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 566 transitions, 1269 flow [2025-03-08 22:04:33,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:33,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1806 transitions. [2025-03-08 22:04:33,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9585987261146497 [2025-03-08 22:04:33,261 INFO L175 Difference]: Start difference. First operand has 569 places, 563 transitions, 1227 flow. Second operand 3 states and 1806 transitions. [2025-03-08 22:04:33,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 566 transitions, 1269 flow [2025-03-08 22:04:33,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 566 transitions, 1263 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:33,269 INFO L231 Difference]: Finished difference. Result has 571 places, 564 transitions, 1239 flow [2025-03-08 22:04:33,269 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1221, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=563, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=560, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=571, PETRI_TRANSITIONS=564} [2025-03-08 22:04:33,270 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -16 predicate places. [2025-03-08 22:04:33,270 INFO L471 AbstractCegarLoop]: Abstraction has has 571 places, 564 transitions, 1239 flow [2025-03-08 22:04:33,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-08 22:04:33,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:33,270 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] [2025-03-08 22:04:33,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:04:33,270 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:33,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:33,271 INFO L85 PathProgramCache]: Analyzing trace with hash 1130831038, now seen corresponding path program 1 times [2025-03-08 22:04:33,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:33,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747234311] [2025-03-08 22:04:33,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:33,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 22:04:33,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 22:04:33,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:33,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:33,325 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-08 22:04:33,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:33,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747234311] [2025-03-08 22:04:33,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747234311] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:33,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:33,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:33,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983482919] [2025-03-08 22:04:33,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:33,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:33,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:33,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:33,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:33,341 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-03-08 22:04:33,343 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 571 places, 564 transitions, 1239 flow. Second operand has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 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-08 22:04:33,343 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:33,343 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-03-08 22:04:33,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:33,895 INFO L124 PetriNetUnfolderBase]: 187/3283 cut-off events. [2025-03-08 22:04:33,895 INFO L125 PetriNetUnfolderBase]: For 58/76 co-relation queries the response was YES. [2025-03-08 22:04:33,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3793 conditions, 3283 events. 187/3283 cut-off events. For 58/76 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 25234 event pairs, 33 based on Foata normal form. 0/2960 useless extension candidates. Maximal degree in co-relation 3733. Up to 220 conditions per place. [2025-03-08 22:04:33,947 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 20 selfloop transitions, 2 changer transitions 0/567 dead transitions. [2025-03-08 22:04:33,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 567 transitions, 1294 flow [2025-03-08 22:04:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:33,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:33,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1799 transitions. [2025-03-08 22:04:33,950 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9548832271762208 [2025-03-08 22:04:33,950 INFO L175 Difference]: Start difference. First operand has 571 places, 564 transitions, 1239 flow. Second operand 3 states and 1799 transitions. [2025-03-08 22:04:33,950 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 567 transitions, 1294 flow [2025-03-08 22:04:33,954 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 567 places, 567 transitions, 1288 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:04:33,957 INFO L231 Difference]: Finished difference. Result has 568 places, 562 transitions, 1239 flow [2025-03-08 22:04:33,958 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1225, PETRI_DIFFERENCE_MINUEND_PLACES=565, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=558, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1239, PETRI_PLACES=568, PETRI_TRANSITIONS=562} [2025-03-08 22:04:33,958 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -19 predicate places. [2025-03-08 22:04:33,958 INFO L471 AbstractCegarLoop]: Abstraction has has 568 places, 562 transitions, 1239 flow [2025-03-08 22:04:33,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 593.0) internal successors, (1779), 3 states have internal predecessors, (1779), 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-08 22:04:33,959 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:33,959 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] [2025-03-08 22:04:33,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 22:04:33,959 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:33,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:33,960 INFO L85 PathProgramCache]: Analyzing trace with hash 483392728, now seen corresponding path program 1 times [2025-03-08 22:04:33,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:33,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349390345] [2025-03-08 22:04:33,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:33,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:33,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 22:04:33,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 22:04:33,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:33,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:34,139 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-08 22:04:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:34,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349390345] [2025-03-08 22:04:34,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349390345] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:34,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:34,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:34,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490186160] [2025-03-08 22:04:34,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:34,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:34,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:34,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:34,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:34,676 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-08 22:04:34,679 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 568 places, 562 transitions, 1239 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 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-08 22:04:34,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:34,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-08 22:04:34,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:35,159 INFO L124 PetriNetUnfolderBase]: 170/2424 cut-off events. [2025-03-08 22:04:35,159 INFO L125 PetriNetUnfolderBase]: For 82/134 co-relation queries the response was YES. [2025-03-08 22:04:35,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3024 conditions, 2424 events. 170/2424 cut-off events. For 82/134 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 16243 event pairs, 79 based on Foata normal form. 3/2187 useless extension candidates. Maximal degree in co-relation 2962. Up to 259 conditions per place. [2025-03-08 22:04:35,189 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 69 selfloop transitions, 15 changer transitions 0/595 dead transitions. [2025-03-08 22:04:35,189 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 578 places, 595 transitions, 1489 flow [2025-03-08 22:04:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:35,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6299 transitions. [2025-03-08 22:04:35,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118413433700058 [2025-03-08 22:04:35,196 INFO L175 Difference]: Start difference. First operand has 568 places, 562 transitions, 1239 flow. Second operand 11 states and 6299 transitions. [2025-03-08 22:04:35,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 578 places, 595 transitions, 1489 flow [2025-03-08 22:04:35,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 578 places, 595 transitions, 1489 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:35,203 INFO L231 Difference]: Finished difference. Result has 581 places, 565 transitions, 1294 flow [2025-03-08 22:04:35,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1239, PETRI_DIFFERENCE_MINUEND_PLACES=568, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=547, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1294, PETRI_PLACES=581, PETRI_TRANSITIONS=565} [2025-03-08 22:04:35,204 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -6 predicate places. [2025-03-08 22:04:35,204 INFO L471 AbstractCegarLoop]: Abstraction has has 581 places, 565 transitions, 1294 flow [2025-03-08 22:04:35,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 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-08 22:04:35,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:35,205 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] [2025-03-08 22:04:35,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 22:04:35,205 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:35,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:35,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1867904671, now seen corresponding path program 1 times [2025-03-08 22:04:35,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:35,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125352423] [2025-03-08 22:04:35,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:35,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:35,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-08 22:04:35,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-08 22:04:35,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:35,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:35,336 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-08 22:04:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:35,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125352423] [2025-03-08 22:04:35,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125352423] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:35,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:35,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94208341] [2025-03-08 22:04:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:35,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:35,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:35,338 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:35,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:35,725 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-08 22:04:35,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 581 places, 565 transitions, 1294 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 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-08 22:04:35,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:35,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-08 22:04:35,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:36,197 INFO L124 PetriNetUnfolderBase]: 245/3127 cut-off events. [2025-03-08 22:04:36,197 INFO L125 PetriNetUnfolderBase]: For 227/285 co-relation queries the response was YES. [2025-03-08 22:04:36,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3984 conditions, 3127 events. 245/3127 cut-off events. For 227/285 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 24270 event pairs, 103 based on Foata normal form. 10/2849 useless extension candidates. Maximal degree in co-relation 3915. Up to 347 conditions per place. [2025-03-08 22:04:36,239 INFO L140 encePairwiseOnDemand]: 614/628 looper letters, 65 selfloop transitions, 15 changer transitions 0/594 dead transitions. [2025-03-08 22:04:36,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 594 transitions, 1528 flow [2025-03-08 22:04:36,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:36,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:36,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6290 transitions. [2025-03-08 22:04:36,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9105385060799074 [2025-03-08 22:04:36,245 INFO L175 Difference]: Start difference. First operand has 581 places, 565 transitions, 1294 flow. Second operand 11 states and 6290 transitions. [2025-03-08 22:04:36,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 594 transitions, 1528 flow [2025-03-08 22:04:36,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 584 places, 594 transitions, 1507 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:04:36,252 INFO L231 Difference]: Finished difference. Result has 589 places, 573 transitions, 1349 flow [2025-03-08 22:04:36,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1273, PETRI_DIFFERENCE_MINUEND_PLACES=574, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=565, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1349, PETRI_PLACES=589, PETRI_TRANSITIONS=573} [2025-03-08 22:04:36,252 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 2 predicate places. [2025-03-08 22:04:36,253 INFO L471 AbstractCegarLoop]: Abstraction has has 589 places, 573 transitions, 1349 flow [2025-03-08 22:04:36,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 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-08 22:04:36,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:36,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:36,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 22:04:36,253 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:36,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:36,254 INFO L85 PathProgramCache]: Analyzing trace with hash 230720775, now seen corresponding path program 1 times [2025-03-08 22:04:36,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:36,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27725441] [2025-03-08 22:04:36,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:36,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:36,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-03-08 22:04:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-03-08 22:04:36,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:36,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:36,385 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-08 22:04:36,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:36,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27725441] [2025-03-08 22:04:36,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27725441] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:36,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:36,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:36,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691057675] [2025-03-08 22:04:36,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:36,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:36,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:36,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:36,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:36,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-08 22:04:36,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 589 places, 573 transitions, 1349 flow. Second operand has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 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-08 22:04:36,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:36,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-08 22:04:36,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:37,099 INFO L124 PetriNetUnfolderBase]: 147/2380 cut-off events. [2025-03-08 22:04:37,099 INFO L125 PetriNetUnfolderBase]: For 118/172 co-relation queries the response was YES. [2025-03-08 22:04:37,125 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3233 conditions, 2380 events. 147/2380 cut-off events. For 118/172 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 15087 event pairs, 55 based on Foata normal form. 2/2219 useless extension candidates. Maximal degree in co-relation 3157. Up to 233 conditions per place. [2025-03-08 22:04:37,134 INFO L140 encePairwiseOnDemand]: 613/628 looper letters, 71 selfloop transitions, 18 changer transitions 0/603 dead transitions. [2025-03-08 22:04:37,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 599 places, 603 transitions, 1627 flow [2025-03-08 22:04:37,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:37,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6292 transitions. [2025-03-08 22:04:37,142 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.910828025477707 [2025-03-08 22:04:37,142 INFO L175 Difference]: Start difference. First operand has 589 places, 573 transitions, 1349 flow. Second operand 11 states and 6292 transitions. [2025-03-08 22:04:37,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 599 places, 603 transitions, 1627 flow [2025-03-08 22:04:37,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 598 places, 603 transitions, 1623 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:37,150 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1440 flow [2025-03-08 22:04:37,151 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1345, PETRI_DIFFERENCE_MINUEND_PLACES=588, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=573, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=555, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1440, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2025-03-08 22:04:37,151 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2025-03-08 22:04:37,151 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1440 flow [2025-03-08 22:04:37,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.25) internal successors, (4554), 8 states have internal predecessors, (4554), 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-08 22:04:37,152 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:37,152 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] [2025-03-08 22:04:37,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 22:04:37,153 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:37,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1422570956, now seen corresponding path program 1 times [2025-03-08 22:04:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:37,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318730860] [2025-03-08 22:04:37,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:37,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-03-08 22:04:37,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-03-08 22:04:37,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:37,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:37,299 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-08 22:04:37,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:37,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318730860] [2025-03-08 22:04:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318730860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:37,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:37,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236020074] [2025-03-08 22:04:37,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:37,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:37,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:37,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:37,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:37,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-08 22:04:37,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1440 flow. Second operand has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 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-08 22:04:37,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:37,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-08 22:04:37,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:38,473 INFO L124 PetriNetUnfolderBase]: 338/4947 cut-off events. [2025-03-08 22:04:38,473 INFO L125 PetriNetUnfolderBase]: For 466/624 co-relation queries the response was YES. [2025-03-08 22:04:38,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6675 conditions, 4947 events. 338/4947 cut-off events. For 466/624 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 43041 event pairs, 159 based on Foata normal form. 2/4532 useless extension candidates. Maximal degree in co-relation 6594. Up to 453 conditions per place. [2025-03-08 22:04:38,552 INFO L140 encePairwiseOnDemand]: 613/628 looper letters, 67 selfloop transitions, 18 changer transitions 0/605 dead transitions. [2025-03-08 22:04:38,552 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 605 transitions, 1702 flow [2025-03-08 22:04:38,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:38,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:38,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2025-03-08 22:04:38,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9095251881876085 [2025-03-08 22:04:38,555 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1440 flow. Second operand 11 states and 6283 transitions. [2025-03-08 22:04:38,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 605 transitions, 1702 flow [2025-03-08 22:04:38,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 605 transitions, 1681 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:04:38,565 INFO L231 Difference]: Finished difference. Result has 609 places, 590 transitions, 1535 flow [2025-03-08 22:04:38,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1419, PETRI_DIFFERENCE_MINUEND_PLACES=594, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1535, PETRI_PLACES=609, PETRI_TRANSITIONS=590} [2025-03-08 22:04:38,566 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 22 predicate places. [2025-03-08 22:04:38,566 INFO L471 AbstractCegarLoop]: Abstraction has has 609 places, 590 transitions, 1535 flow [2025-03-08 22:04:38,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.375) internal successors, (4555), 8 states have internal predecessors, (4555), 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-08 22:04:38,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:38,567 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] [2025-03-08 22:04:38,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 22:04:38,567 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:38,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:38,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1785025775, now seen corresponding path program 1 times [2025-03-08 22:04:38,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:38,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58031625] [2025-03-08 22:04:38,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:38,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-03-08 22:04:38,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-03-08 22:04:38,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:38,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:38,697 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-08 22:04:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:38,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58031625] [2025-03-08 22:04:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58031625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 22:04:38,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945191721] [2025-03-08 22:04:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:38,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 22:04:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:38,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 22:04:38,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 22:04:39,054 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 565 out of 628 [2025-03-08 22:04:39,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 609 places, 590 transitions, 1535 flow. Second operand has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 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-08 22:04:39,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:39,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 565 of 628 [2025-03-08 22:04:39,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:39,761 INFO L124 PetriNetUnfolderBase]: 296/3695 cut-off events. [2025-03-08 22:04:39,761 INFO L125 PetriNetUnfolderBase]: For 622/681 co-relation queries the response was YES. [2025-03-08 22:04:39,784 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5215 conditions, 3695 events. 296/3695 cut-off events. For 622/681 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 30118 event pairs, 127 based on Foata normal form. 0/3423 useless extension candidates. Maximal degree in co-relation 5127. Up to 433 conditions per place. [2025-03-08 22:04:39,791 INFO L140 encePairwiseOnDemand]: 613/628 looper letters, 67 selfloop transitions, 18 changer transitions 0/611 dead transitions. [2025-03-08 22:04:39,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 619 places, 611 transitions, 1787 flow [2025-03-08 22:04:39,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 22:04:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-03-08 22:04:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 6283 transitions. [2025-03-08 22:04:39,794 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9095251881876085 [2025-03-08 22:04:39,794 INFO L175 Difference]: Start difference. First operand has 609 places, 590 transitions, 1535 flow. Second operand 11 states and 6283 transitions. [2025-03-08 22:04:39,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 619 places, 611 transitions, 1787 flow [2025-03-08 22:04:39,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 618 places, 611 transitions, 1783 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:39,804 INFO L231 Difference]: Finished difference. Result has 621 places, 596 transitions, 1626 flow [2025-03-08 22:04:39,804 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1531, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=572, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1626, PETRI_PLACES=621, PETRI_TRANSITIONS=596} [2025-03-08 22:04:39,805 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 34 predicate places. [2025-03-08 22:04:39,805 INFO L471 AbstractCegarLoop]: Abstraction has has 621 places, 596 transitions, 1626 flow [2025-03-08 22:04:39,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 569.5) internal successors, (4556), 8 states have internal predecessors, (4556), 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-08 22:04:39,806 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:39,806 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] [2025-03-08 22:04:39,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 22:04:39,806 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:39,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:39,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1344974173, now seen corresponding path program 1 times [2025-03-08 22:04:39,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:39,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193416592] [2025-03-08 22:04:39,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:39,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:39,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-03-08 22:04:39,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-03-08 22:04:39,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:39,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:40,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:40,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:40,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193416592] [2025-03-08 22:04:40,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193416592] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:40,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:40,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:40,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937164200] [2025-03-08 22:04:40,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:40,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:40,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:40,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:40,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:40,483 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-08 22:04:40,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 621 places, 596 transitions, 1626 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 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-08 22:04:40,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:40,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-08 22:04:40,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:40,968 INFO L124 PetriNetUnfolderBase]: 157/3538 cut-off events. [2025-03-08 22:04:40,968 INFO L125 PetriNetUnfolderBase]: For 561/605 co-relation queries the response was YES. [2025-03-08 22:04:41,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4986 conditions, 3538 events. 157/3538 cut-off events. For 561/605 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 25998 event pairs, 22 based on Foata normal form. 12/3338 useless extension candidates. Maximal degree in co-relation 4894. Up to 173 conditions per place. [2025-03-08 22:04:41,012 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 41 selfloop transitions, 5 changer transitions 0/605 dead transitions. [2025-03-08 22:04:41,012 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 624 places, 605 transitions, 1747 flow [2025-03-08 22:04:41,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:41,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:41,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2025-03-08 22:04:41,014 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929140127388535 [2025-03-08 22:04:41,014 INFO L175 Difference]: Start difference. First operand has 621 places, 596 transitions, 1626 flow. Second operand 6 states and 3501 transitions. [2025-03-08 22:04:41,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 624 places, 605 transitions, 1747 flow [2025-03-08 22:04:41,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 617 places, 605 transitions, 1726 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-03-08 22:04:41,024 INFO L231 Difference]: Finished difference. Result has 617 places, 594 transitions, 1611 flow [2025-03-08 22:04:41,024 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=612, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=594, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=589, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1611, PETRI_PLACES=617, PETRI_TRANSITIONS=594} [2025-03-08 22:04:41,024 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 30 predicate places. [2025-03-08 22:04:41,024 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 594 transitions, 1611 flow [2025-03-08 22:04:41,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 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-08 22:04:41,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:41,025 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] [2025-03-08 22:04:41,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 22:04:41,025 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:41,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:41,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1727189528, now seen corresponding path program 1 times [2025-03-08 22:04:41,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:41,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795952168] [2025-03-08 22:04:41,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:41,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:41,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 22:04:41,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 22:04:41,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:41,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:41,324 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:41,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:41,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795952168] [2025-03-08 22:04:41,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795952168] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:41,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:41,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:41,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943158507] [2025-03-08 22:04:41,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:41,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:41,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:41,821 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-08 22:04:41,822 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 594 transitions, 1611 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 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-08 22:04:41,822 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,822 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-08 22:04:41,822 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:42,336 INFO L124 PetriNetUnfolderBase]: 186/3895 cut-off events. [2025-03-08 22:04:42,336 INFO L125 PetriNetUnfolderBase]: For 644/742 co-relation queries the response was YES. [2025-03-08 22:04:42,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5423 conditions, 3895 events. 186/3895 cut-off events. For 644/742 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 30247 event pairs, 30 based on Foata normal form. 8/3651 useless extension candidates. Maximal degree in co-relation 5332. Up to 197 conditions per place. [2025-03-08 22:04:42,400 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 40 selfloop transitions, 5 changer transitions 0/602 dead transitions. [2025-03-08 22:04:42,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 620 places, 602 transitions, 1727 flow [2025-03-08 22:04:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2025-03-08 22:04:42,402 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288747346072187 [2025-03-08 22:04:42,402 INFO L175 Difference]: Start difference. First operand has 617 places, 594 transitions, 1611 flow. Second operand 6 states and 3500 transitions. [2025-03-08 22:04:42,402 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 620 places, 602 transitions, 1727 flow [2025-03-08 22:04:42,409 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 615 places, 602 transitions, 1717 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:42,412 INFO L231 Difference]: Finished difference. Result has 615 places, 592 transitions, 1607 flow [2025-03-08 22:04:42,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1597, PETRI_DIFFERENCE_MINUEND_PLACES=610, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=587, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1607, PETRI_PLACES=615, PETRI_TRANSITIONS=592} [2025-03-08 22:04:42,413 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 28 predicate places. [2025-03-08 22:04:42,413 INFO L471 AbstractCegarLoop]: Abstraction has has 615 places, 592 transitions, 1607 flow [2025-03-08 22:04:42,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 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-08 22:04:42,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:42,414 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] [2025-03-08 22:04:42,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 22:04:42,414 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:42,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:42,415 INFO L85 PathProgramCache]: Analyzing trace with hash 601504449, now seen corresponding path program 1 times [2025-03-08 22:04:42,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:42,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875774057] [2025-03-08 22:04:42,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:42,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:42,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:04:42,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:04:42,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:42,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:42,705 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:42,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:42,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875774057] [2025-03-08 22:04:42,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875774057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:42,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:42,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:42,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017338435] [2025-03-08 22:04:42,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:42,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:42,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:42,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:42,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:43,219 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-08 22:04:43,220 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 615 places, 592 transitions, 1607 flow. Second operand has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 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-08 22:04:43,220 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:43,220 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-08 22:04:43,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:43,707 INFO L124 PetriNetUnfolderBase]: 134/3605 cut-off events. [2025-03-08 22:04:43,707 INFO L125 PetriNetUnfolderBase]: For 539/612 co-relation queries the response was YES. [2025-03-08 22:04:43,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4989 conditions, 3605 events. 134/3605 cut-off events. For 539/612 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 26226 event pairs, 22 based on Foata normal form. 11/3409 useless extension candidates. Maximal degree in co-relation 4898. Up to 183 conditions per place. [2025-03-08 22:04:43,752 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 41 selfloop transitions, 5 changer transitions 0/601 dead transitions. [2025-03-08 22:04:43,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 618 places, 601 transitions, 1728 flow [2025-03-08 22:04:43,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:43,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:43,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3501 transitions. [2025-03-08 22:04:43,754 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.929140127388535 [2025-03-08 22:04:43,754 INFO L175 Difference]: Start difference. First operand has 615 places, 592 transitions, 1607 flow. Second operand 6 states and 3501 transitions. [2025-03-08 22:04:43,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 618 places, 601 transitions, 1728 flow [2025-03-08 22:04:43,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 613 places, 601 transitions, 1718 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:43,763 INFO L231 Difference]: Finished difference. Result has 613 places, 590 transitions, 1603 flow [2025-03-08 22:04:43,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1593, PETRI_DIFFERENCE_MINUEND_PLACES=608, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=590, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=585, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1603, PETRI_PLACES=613, PETRI_TRANSITIONS=590} [2025-03-08 22:04:43,764 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 26 predicate places. [2025-03-08 22:04:43,764 INFO L471 AbstractCegarLoop]: Abstraction has has 613 places, 590 transitions, 1603 flow [2025-03-08 22:04:43,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 578.8333333333334) internal successors, (3473), 6 states have internal predecessors, (3473), 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-08 22:04:43,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:43,764 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] [2025-03-08 22:04:43,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-08 22:04:43,765 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:43,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:43,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1971804409, now seen corresponding path program 1 times [2025-03-08 22:04:43,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:43,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800102044] [2025-03-08 22:04:43,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:43,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:43,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-03-08 22:04:43,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-03-08 22:04:43,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:43,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:43,800 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:43,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:43,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800102044] [2025-03-08 22:04:43,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800102044] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:43,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:43,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:43,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024139654] [2025-03-08 22:04:43,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:43,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:43,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:43,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:43,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:43,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 591 out of 628 [2025-03-08 22:04:43,815 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 613 places, 590 transitions, 1603 flow. Second operand has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 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-08 22:04:43,815 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:43,815 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 591 of 628 [2025-03-08 22:04:43,815 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:44,773 INFO L124 PetriNetUnfolderBase]: 411/6715 cut-off events. [2025-03-08 22:04:44,774 INFO L125 PetriNetUnfolderBase]: For 510/538 co-relation queries the response was YES. [2025-03-08 22:04:44,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8428 conditions, 6715 events. 411/6715 cut-off events. For 510/538 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 61186 event pairs, 63 based on Foata normal form. 0/6202 useless extension candidates. Maximal degree in co-relation 8338. Up to 469 conditions per place. [2025-03-08 22:04:44,874 INFO L140 encePairwiseOnDemand]: 622/628 looper letters, 19 selfloop transitions, 2 changer transitions 0/592 dead transitions. [2025-03-08 22:04:44,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 611 places, 592 transitions, 1653 flow [2025-03-08 22:04:44,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:44,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:44,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1798 transitions. [2025-03-08 22:04:44,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9543524416135881 [2025-03-08 22:04:44,876 INFO L175 Difference]: Start difference. First operand has 613 places, 590 transitions, 1603 flow. Second operand 3 states and 1798 transitions. [2025-03-08 22:04:44,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 611 places, 592 transitions, 1653 flow [2025-03-08 22:04:44,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 592 transitions, 1643 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:44,886 INFO L231 Difference]: Finished difference. Result has 607 places, 588 transitions, 1599 flow [2025-03-08 22:04:44,887 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1585, PETRI_DIFFERENCE_MINUEND_PLACES=604, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=584, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1599, PETRI_PLACES=607, PETRI_TRANSITIONS=588} [2025-03-08 22:04:44,887 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 20 predicate places. [2025-03-08 22:04:44,887 INFO L471 AbstractCegarLoop]: Abstraction has has 607 places, 588 transitions, 1599 flow [2025-03-08 22:04:44,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 592.6666666666666) internal successors, (1778), 3 states have internal predecessors, (1778), 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-08 22:04:44,887 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:44,888 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] [2025-03-08 22:04:44,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-08 22:04:44,888 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread3Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:44,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:44,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1844809425, now seen corresponding path program 1 times [2025-03-08 22:04:44,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:44,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118032018] [2025-03-08 22:04:44,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:44,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:44,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-03-08 22:04:44,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-03-08 22:04:44,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:44,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:45,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:45,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:45,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118032018] [2025-03-08 22:04:45,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118032018] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:45,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:45,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:45,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186297076] [2025-03-08 22:04:45,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:45,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:45,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:45,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:45,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:45,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-08 22:04:45,615 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 607 places, 588 transitions, 1599 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 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-08 22:04:45,615 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:45,615 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-08 22:04:45,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:46,134 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1609] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][477], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 838#true, 622#(= |#race~n1~0| 0), 174#L79-16true, Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 840#(= |#race~a3~0| 0), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 844#(= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0), Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), 471#L105true, Black: 697#true]) [2025-03-08 22:04:46,134 INFO L294 olderBase$Statistics]: this new event has 335 ancestors and is cut-off event [2025-03-08 22:04:46,134 INFO L297 olderBase$Statistics]: existing Event has 304 ancestors and is cut-off event [2025-03-08 22:04:46,134 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-08 22:04:46,135 INFO L297 olderBase$Statistics]: existing Event has 335 ancestors and is cut-off event [2025-03-08 22:04:46,141 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1609] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][482], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 840#(= |#race~a3~0| 0), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), 551#L79-15true, Black: 706#(<= ~n1~0 0), Black: 658#true, 634#(= |#race~n2~0| 0), 845#(and (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), 471#L105true, Black: 697#true]) [2025-03-08 22:04:46,141 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2025-03-08 22:04:46,141 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-03-08 22:04:46,141 INFO L297 olderBase$Statistics]: existing Event has 336 ancestors and is cut-off event [2025-03-08 22:04:46,141 INFO L297 olderBase$Statistics]: existing Event has 305 ancestors and is cut-off event [2025-03-08 22:04:46,146 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1609] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][489], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 331#L79-14true, Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 840#(= |#race~a3~0| 0), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 846#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), 471#L105true, Black: 697#true]) [2025-03-08 22:04:46,146 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2025-03-08 22:04:46,146 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-03-08 22:04:46,146 INFO L297 olderBase$Statistics]: existing Event has 306 ancestors and is cut-off event [2025-03-08 22:04:46,146 INFO L297 olderBase$Statistics]: existing Event has 337 ancestors and is cut-off event [2025-03-08 22:04:46,150 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1609] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][494], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 365#L79-12true, 840#(= |#race~a3~0| 0), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 847#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), 471#L105true, Black: 697#true]) [2025-03-08 22:04:46,150 INFO L294 olderBase$Statistics]: this new event has 338 ancestors and is cut-off event [2025-03-08 22:04:46,150 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-03-08 22:04:46,150 INFO L297 olderBase$Statistics]: existing Event has 338 ancestors and is cut-off event [2025-03-08 22:04:46,150 INFO L297 olderBase$Statistics]: existing Event has 307 ancestors and is cut-off event [2025-03-08 22:04:46,153 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1609] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][494], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 840#(= |#race~a3~0| 0), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 847#(and (= 0 (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 2))) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 1)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4) 3)) 0) (= (select (select |#race| ~a2~0.base) (+ ~a2~0.offset (* |thread3Thread1of1ForFork2_~i~2#1| 4))) 0)), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 310#L79-13true, Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), 471#L105true, Black: 697#true]) [2025-03-08 22:04:46,154 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2025-03-08 22:04:46,154 INFO L297 olderBase$Statistics]: existing Event has 308 ancestors and is cut-off event [2025-03-08 22:04:46,154 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-03-08 22:04:46,154 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2025-03-08 22:04:46,213 INFO L124 PetriNetUnfolderBase]: 260/4215 cut-off events. [2025-03-08 22:04:46,213 INFO L125 PetriNetUnfolderBase]: For 772/816 co-relation queries the response was YES. [2025-03-08 22:04:46,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5902 conditions, 4215 events. 260/4215 cut-off events. For 772/816 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 34422 event pairs, 32 based on Foata normal form. 8/4017 useless extension candidates. Maximal degree in co-relation 5811. Up to 200 conditions per place. [2025-03-08 22:04:46,272 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 39 selfloop transitions, 5 changer transitions 0/595 dead transitions. [2025-03-08 22:04:46,273 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 610 places, 595 transitions, 1710 flow [2025-03-08 22:04:46,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:46,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-03-08 22:04:46,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9286093418259024 [2025-03-08 22:04:46,274 INFO L175 Difference]: Start difference. First operand has 607 places, 588 transitions, 1599 flow. Second operand 6 states and 3499 transitions. [2025-03-08 22:04:46,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 610 places, 595 transitions, 1710 flow [2025-03-08 22:04:46,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 610 places, 595 transitions, 1710 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:46,284 INFO L231 Difference]: Finished difference. Result has 610 places, 586 transitions, 1605 flow [2025-03-08 22:04:46,284 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1595, PETRI_DIFFERENCE_MINUEND_PLACES=605, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=581, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1605, PETRI_PLACES=610, PETRI_TRANSITIONS=586} [2025-03-08 22:04:46,285 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 23 predicate places. [2025-03-08 22:04:46,285 INFO L471 AbstractCegarLoop]: Abstraction has has 610 places, 586 transitions, 1605 flow [2025-03-08 22:04:46,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 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-08 22:04:46,285 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:46,285 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] [2025-03-08 22:04:46,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-08 22:04:46,285 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:46,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:46,287 INFO L85 PathProgramCache]: Analyzing trace with hash 412556796, now seen corresponding path program 1 times [2025-03-08 22:04:46,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:46,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23531789] [2025-03-08 22:04:46,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:46,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:46,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-08 22:04:46,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-08 22:04:46,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:46,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:46,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:46,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23531789] [2025-03-08 22:04:46,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23531789] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:46,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:46,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:46,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465295901] [2025-03-08 22:04:46,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:46,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:46,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:46,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:46,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:46,910 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-08 22:04:46,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 610 places, 586 transitions, 1605 flow. Second operand has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 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-08 22:04:46,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:46,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-08 22:04:46,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:47,556 INFO L124 PetriNetUnfolderBase]: 195/4259 cut-off events. [2025-03-08 22:04:47,556 INFO L125 PetriNetUnfolderBase]: For 629/721 co-relation queries the response was YES. [2025-03-08 22:04:47,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5896 conditions, 4259 events. 195/4259 cut-off events. For 629/721 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 33722 event pairs, 29 based on Foata normal form. 7/4060 useless extension candidates. Maximal degree in co-relation 5804. Up to 196 conditions per place. [2025-03-08 22:04:47,621 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 40 selfloop transitions, 5 changer transitions 0/594 dead transitions. [2025-03-08 22:04:47,621 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 613 places, 594 transitions, 1721 flow [2025-03-08 22:04:47,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:47,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:47,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3500 transitions. [2025-03-08 22:04:47,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9288747346072187 [2025-03-08 22:04:47,623 INFO L175 Difference]: Start difference. First operand has 610 places, 586 transitions, 1605 flow. Second operand 6 states and 3500 transitions. [2025-03-08 22:04:47,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 613 places, 594 transitions, 1721 flow [2025-03-08 22:04:47,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 608 places, 594 transitions, 1711 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:47,632 INFO L231 Difference]: Finished difference. Result has 608 places, 584 transitions, 1601 flow [2025-03-08 22:04:47,633 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1591, PETRI_DIFFERENCE_MINUEND_PLACES=603, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=579, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1601, PETRI_PLACES=608, PETRI_TRANSITIONS=584} [2025-03-08 22:04:47,633 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 21 predicate places. [2025-03-08 22:04:47,633 INFO L471 AbstractCegarLoop]: Abstraction has has 608 places, 584 transitions, 1601 flow [2025-03-08 22:04:47,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.0) internal successors, (3474), 6 states have internal predecessors, (3474), 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-08 22:04:47,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:47,633 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] [2025-03-08 22:04:47,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-08 22:04:47,634 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:47,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:47,635 INFO L85 PathProgramCache]: Analyzing trace with hash -541492340, now seen corresponding path program 1 times [2025-03-08 22:04:47,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:47,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000557029] [2025-03-08 22:04:47,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:47,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:47,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 226 statements into 1 equivalence classes. [2025-03-08 22:04:47,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 226 of 226 statements. [2025-03-08 22:04:47,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:47,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:47,666 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-08 22:04:47,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:47,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000557029] [2025-03-08 22:04:47,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000557029] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:47,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:47,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:47,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859660603] [2025-03-08 22:04:47,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:47,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:47,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:47,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:47,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:47,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 599 out of 628 [2025-03-08 22:04:47,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 608 places, 584 transitions, 1601 flow. Second operand has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 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-08 22:04:47,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:47,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 599 of 628 [2025-03-08 22:04:47,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:48,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1608] thread3EXIT-->L107-5: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][331], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), 840#(= |#race~a3~0| 0), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 658#true, Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), 224#L107-5true, 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), 848#true, Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 697#true, 854#true]) [2025-03-08 22:04:48,237 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-08 22:04:48,237 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-08 22:04:48,237 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-08 22:04:48,237 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-08 22:04:48,292 INFO L124 PetriNetUnfolderBase]: 130/4207 cut-off events. [2025-03-08 22:04:48,292 INFO L125 PetriNetUnfolderBase]: For 517/559 co-relation queries the response was YES. [2025-03-08 22:04:48,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5600 conditions, 4207 events. 130/4207 cut-off events. For 517/559 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 31556 event pairs, 22 based on Foata normal form. 0/4036 useless extension candidates. Maximal degree in co-relation 5509. Up to 124 conditions per place. [2025-03-08 22:04:48,368 INFO L140 encePairwiseOnDemand]: 626/628 looper letters, 9 selfloop transitions, 1 changer transitions 0/583 dead transitions. [2025-03-08 22:04:48,369 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 609 places, 583 transitions, 1619 flow [2025-03-08 22:04:48,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:48,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1808 transitions. [2025-03-08 22:04:48,370 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9596602972399151 [2025-03-08 22:04:48,370 INFO L175 Difference]: Start difference. First operand has 608 places, 584 transitions, 1601 flow. Second operand 3 states and 1808 transitions. [2025-03-08 22:04:48,370 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 609 places, 583 transitions, 1619 flow [2025-03-08 22:04:48,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 604 places, 583 transitions, 1609 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:48,380 INFO L231 Difference]: Finished difference. Result has 604 places, 583 transitions, 1591 flow [2025-03-08 22:04:48,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1589, PETRI_DIFFERENCE_MINUEND_PLACES=602, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=583, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=582, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1591, PETRI_PLACES=604, PETRI_TRANSITIONS=583} [2025-03-08 22:04:48,381 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 17 predicate places. [2025-03-08 22:04:48,381 INFO L471 AbstractCegarLoop]: Abstraction has has 604 places, 583 transitions, 1591 flow [2025-03-08 22:04:48,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 602.0) internal successors, (1806), 3 states have internal predecessors, (1806), 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-08 22:04:48,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:48,381 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] [2025-03-08 22:04:48,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-03-08 22:04:48,382 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:48,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash 1210146707, now seen corresponding path program 1 times [2025-03-08 22:04:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:48,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720229304] [2025-03-08 22:04:48,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:48,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:48,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 22:04:48,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 22:04:48,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:48,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:48,663 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:48,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:48,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720229304] [2025-03-08 22:04:48,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720229304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:48,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:48,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113072443] [2025-03-08 22:04:48,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:48,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:48,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:48,664 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:48,664 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:49,111 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 576 out of 628 [2025-03-08 22:04:49,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 604 places, 583 transitions, 1591 flow. Second operand has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 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-08 22:04:49,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:49,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 576 of 628 [2025-03-08 22:04:49,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:49,657 INFO L124 PetriNetUnfolderBase]: 220/4123 cut-off events. [2025-03-08 22:04:49,657 INFO L125 PetriNetUnfolderBase]: For 732/761 co-relation queries the response was YES. [2025-03-08 22:04:49,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5748 conditions, 4123 events. 220/4123 cut-off events. For 732/761 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 32547 event pairs, 32 based on Foata normal form. 0/3979 useless extension candidates. Maximal degree in co-relation 5656. Up to 204 conditions per place. [2025-03-08 22:04:49,708 INFO L140 encePairwiseOnDemand]: 621/628 looper letters, 39 selfloop transitions, 5 changer transitions 0/590 dead transitions. [2025-03-08 22:04:49,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 607 places, 590 transitions, 1702 flow [2025-03-08 22:04:49,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:49,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3499 transitions. [2025-03-08 22:04:49,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9286093418259024 [2025-03-08 22:04:49,710 INFO L175 Difference]: Start difference. First operand has 604 places, 583 transitions, 1591 flow. Second operand 6 states and 3499 transitions. [2025-03-08 22:04:49,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 607 places, 590 transitions, 1702 flow [2025-03-08 22:04:49,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 606 places, 590 transitions, 1701 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:49,719 INFO L231 Difference]: Finished difference. Result has 606 places, 581 transitions, 1596 flow [2025-03-08 22:04:49,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1586, PETRI_DIFFERENCE_MINUEND_PLACES=601, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=581, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=576, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1596, PETRI_PLACES=606, PETRI_TRANSITIONS=581} [2025-03-08 22:04:49,720 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 19 predicate places. [2025-03-08 22:04:49,720 INFO L471 AbstractCegarLoop]: Abstraction has has 606 places, 581 transitions, 1596 flow [2025-03-08 22:04:49,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 579.1666666666666) internal successors, (3475), 6 states have internal predecessors, (3475), 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-08 22:04:49,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:49,721 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] [2025-03-08 22:04:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-03-08 22:04:49,721 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:49,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:49,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1242705646, now seen corresponding path program 1 times [2025-03-08 22:04:49,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545688360] [2025-03-08 22:04:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:49,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 22:04:49,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 22:04:49,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:49,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:49,750 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-08 22:04:49,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:49,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545688360] [2025-03-08 22:04:49,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545688360] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:49,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:49,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:49,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620830123] [2025-03-08 22:04:49,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:49,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:49,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:49,752 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:49,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:49,762 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:49,763 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 606 places, 581 transitions, 1596 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 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-08 22:04:49,763 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:49,763 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:49,763 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:50,221 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1608] thread3EXIT-->L107-5: Formula: (and (= 0 v_thread3Thread1of1ForFork2_thidvar1_4) (= 0 v_thread3Thread1of1ForFork2_thidvar3_4) (= 0 v_thread3Thread1of1ForFork2_thidvar2_4) (= |v_ULTIMATE.start_main_~t3~0#1_6| v_thread3Thread1of1ForFork2_thidvar0_4)) InVars {thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} OutVars{thread3Thread1of1ForFork2_thidvar3=v_thread3Thread1of1ForFork2_thidvar3_4, thread3Thread1of1ForFork2_thidvar2=v_thread3Thread1of1ForFork2_thidvar2_4, thread3Thread1of1ForFork2_thidvar1=v_thread3Thread1of1ForFork2_thidvar1_4, ULTIMATE.start_main_~t3~0#1=|v_ULTIMATE.start_main_~t3~0#1_6|, thread3Thread1of1ForFork2_thidvar0=v_thread3Thread1of1ForFork2_thidvar0_4} AuxVars[] AssignedVars[][331], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 840#(= |#race~a3~0| 0), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), 224#L107-5true, 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 667#(<= ~n1~0 0), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), 863#true, Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 697#true, 857#true]) [2025-03-08 22:04:50,222 INFO L294 olderBase$Statistics]: this new event has 331 ancestors and is not cut-off event [2025-03-08 22:04:50,222 INFO L297 olderBase$Statistics]: existing Event has 362 ancestors and is not cut-off event [2025-03-08 22:04:50,222 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-08 22:04:50,222 INFO L297 olderBase$Statistics]: existing Event has 331 ancestors and is not cut-off event [2025-03-08 22:04:50,275 INFO L124 PetriNetUnfolderBase]: 120/3723 cut-off events. [2025-03-08 22:04:50,275 INFO L125 PetriNetUnfolderBase]: For 431/497 co-relation queries the response was YES. [2025-03-08 22:04:50,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5029 conditions, 3723 events. 120/3723 cut-off events. For 431/497 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 26385 event pairs, 27 based on Foata normal form. 0/3615 useless extension candidates. Maximal degree in co-relation 4938. Up to 133 conditions per place. [2025-03-08 22:04:50,320 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 11 selfloop transitions, 1 changer transitions 0/579 dead transitions. [2025-03-08 22:04:50,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 606 places, 579 transitions, 1616 flow [2025-03-08 22:04:50,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:50,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:50,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1802 transitions. [2025-03-08 22:04:50,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564755838641189 [2025-03-08 22:04:50,321 INFO L175 Difference]: Start difference. First operand has 606 places, 581 transitions, 1596 flow. Second operand 3 states and 1802 transitions. [2025-03-08 22:04:50,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 606 places, 579 transitions, 1616 flow [2025-03-08 22:04:50,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 601 places, 579 transitions, 1606 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:50,329 INFO L231 Difference]: Finished difference. Result has 601 places, 579 transitions, 1584 flow [2025-03-08 22:04:50,330 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1582, PETRI_DIFFERENCE_MINUEND_PLACES=599, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=579, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=578, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1584, PETRI_PLACES=601, PETRI_TRANSITIONS=579} [2025-03-08 22:04:50,330 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 14 predicate places. [2025-03-08 22:04:50,330 INFO L471 AbstractCegarLoop]: Abstraction has has 601 places, 579 transitions, 1584 flow [2025-03-08 22:04:50,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 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-08 22:04:50,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:50,331 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-08 22:04:50,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-03-08 22:04:50,331 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:50,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:50,332 INFO L85 PathProgramCache]: Analyzing trace with hash 646046115, now seen corresponding path program 1 times [2025-03-08 22:04:50,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:50,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852770860] [2025-03-08 22:04:50,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:50,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:50,340 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-08 22:04:50,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-08 22:04:50,343 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:50,343 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:50,365 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-08 22:04:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:50,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852770860] [2025-03-08 22:04:50,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852770860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:50,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:50,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:50,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692541634] [2025-03-08 22:04:50,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:50,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:50,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:50,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:50,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:50,376 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:50,377 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 601 places, 579 transitions, 1584 flow. Second operand has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 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-08 22:04:50,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:50,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:50,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:50,800 INFO L124 PetriNetUnfolderBase]: 120/3068 cut-off events. [2025-03-08 22:04:50,800 INFO L125 PetriNetUnfolderBase]: For 339/379 co-relation queries the response was YES. [2025-03-08 22:04:50,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4110 conditions, 3068 events. 120/3068 cut-off events. For 339/379 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 20631 event pairs, 33 based on Foata normal form. 15/3009 useless extension candidates. Maximal degree in co-relation 4019. Up to 144 conditions per place. [2025-03-08 22:04:50,840 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 7 selfloop transitions, 0 changer transitions 24/577 dead transitions. [2025-03-08 22:04:50,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 601 places, 577 transitions, 1602 flow [2025-03-08 22:04:50,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:50,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-08 22:04:50,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-03-08 22:04:50,841 INFO L175 Difference]: Start difference. First operand has 601 places, 579 transitions, 1584 flow. Second operand 3 states and 1801 transitions. [2025-03-08 22:04:50,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 601 places, 577 transitions, 1602 flow [2025-03-08 22:04:50,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 600 places, 577 transitions, 1601 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:04:50,849 INFO L231 Difference]: Finished difference. Result has 600 places, 553 transitions, 1474 flow [2025-03-08 22:04:50,849 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1579, PETRI_DIFFERENCE_MINUEND_PLACES=598, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=577, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=577, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=600, PETRI_TRANSITIONS=553} [2025-03-08 22:04:50,850 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, 13 predicate places. [2025-03-08 22:04:50,850 INFO L471 AbstractCegarLoop]: Abstraction has has 600 places, 553 transitions, 1474 flow [2025-03-08 22:04:50,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 599.0) internal successors, (1797), 3 states have internal predecessors, (1797), 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-08 22:04:50,850 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:50,850 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:50,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-03-08 22:04:50,850 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:50,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:50,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1912086248, now seen corresponding path program 1 times [2025-03-08 22:04:50,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:50,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168843267] [2025-03-08 22:04:50,852 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:50,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:50,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-08 22:04:50,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-08 22:04:50,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:50,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-08 22:04:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:50,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168843267] [2025-03-08 22:04:50,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168843267] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:50,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:50,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:50,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736483345] [2025-03-08 22:04:50,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:50,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:50,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:50,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:50,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:50,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 597 out of 628 [2025-03-08 22:04:50,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 600 places, 553 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 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-08 22:04:50,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:50,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 597 of 628 [2025-03-08 22:04:50,905 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:51,366 INFO L124 PetriNetUnfolderBase]: 140/3562 cut-off events. [2025-03-08 22:04:51,366 INFO L125 PetriNetUnfolderBase]: For 330/350 co-relation queries the response was YES. [2025-03-08 22:04:51,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 3562 events. 140/3562 cut-off events. For 330/350 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 23838 event pairs, 20 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4672. Up to 93 conditions per place. [2025-03-08 22:04:51,417 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 10 selfloop transitions, 2 changer transitions 12/554 dead transitions. [2025-03-08 22:04:51,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 554 transitions, 1502 flow [2025-03-08 22:04:51,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:51,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1804 transitions. [2025-03-08 22:04:51,418 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9575371549893843 [2025-03-08 22:04:51,418 INFO L175 Difference]: Start difference. First operand has 600 places, 553 transitions, 1474 flow. Second operand 3 states and 1804 transitions. [2025-03-08 22:04:51,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 554 transitions, 1502 flow [2025-03-08 22:04:51,424 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 580 places, 554 transitions, 1490 flow, removed 6 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:51,428 INFO L231 Difference]: Finished difference. Result has 580 places, 540 transitions, 1382 flow [2025-03-08 22:04:51,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=578, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=552, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=550, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1382, PETRI_PLACES=580, PETRI_TRANSITIONS=540} [2025-03-08 22:04:51,428 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -7 predicate places. [2025-03-08 22:04:51,428 INFO L471 AbstractCegarLoop]: Abstraction has has 580 places, 540 transitions, 1382 flow [2025-03-08 22:04:51,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.6666666666666) internal successors, (1796), 3 states have internal predecessors, (1796), 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-08 22:04:51,429 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:51,429 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:51,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-03-08 22:04:51,429 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:51,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:51,430 INFO L85 PathProgramCache]: Analyzing trace with hash 585266672, now seen corresponding path program 1 times [2025-03-08 22:04:51,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:51,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262135815] [2025-03-08 22:04:51,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:51,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:51,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 267 statements into 1 equivalence classes. [2025-03-08 22:04:51,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 267 of 267 statements. [2025-03-08 22:04:51,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:51,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:51,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-08 22:04:51,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:51,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262135815] [2025-03-08 22:04:51,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262135815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:51,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:51,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:51,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139173255] [2025-03-08 22:04:51,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:51,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:51,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:51,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:51,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:51,488 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:51,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 580 places, 540 transitions, 1382 flow. Second operand has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-08 22:04:51,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:51,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:51,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:51,843 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1298] L51-13-->L51-11: Formula: (= |v_#race~a2~0_6| 0) InVars {} OutVars{#race~a2~0=|v_#race~a2~0_6|} AuxVars[] AssignedVars[#race~a2~0][373], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 869#true, Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 840#(= |#race~a3~0| 0), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 15#L65-19true, Black: 658#true, 634#(= |#race~n2~0| 0), Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 866#true, Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 378#L51-11true, 699#(= |#race~a2~0| 0), 29#L102-1true, 640#(= |#race~n3~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 729#(<= ~n2~0 0), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 660#(= |#race~a1~0| 0), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), 556#L79-19true, 872#true, Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), Black: 697#true]) [2025-03-08 22:04:51,843 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2025-03-08 22:04:51,843 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-08 22:04:51,843 INFO L297 olderBase$Statistics]: existing Event has 309 ancestors and is cut-off event [2025-03-08 22:04:51,843 INFO L297 olderBase$Statistics]: existing Event has 340 ancestors and is cut-off event [2025-03-08 22:04:51,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1609] thread2EXIT-->L105: Formula: (and (= v_thread2Thread1of1ForFork0_thidvar2_4 0) (= |v_ULTIMATE.start_main_~t2~0#1_6| v_thread2Thread1of1ForFork0_thidvar0_4) (= v_thread2Thread1of1ForFork0_thidvar1_4 0)) InVars {thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} OutVars{thread2Thread1of1ForFork0_thidvar2=v_thread2Thread1of1ForFork0_thidvar2_4, thread2Thread1of1ForFork0_thidvar1=v_thread2Thread1of1ForFork0_thidvar1_4, thread2Thread1of1ForFork0_thidvar0=v_thread2Thread1of1ForFork0_thidvar0_4, ULTIMATE.start_main_~t2~0#1=|v_ULTIMATE.start_main_~t2~0#1_6|} AuxVars[] AssignedVars[][352], [Black: 754#(<= ~n2~0 0), Black: 755#(and (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 768#(and (not |thread1Thread1of1ForFork1_#t~short2#1|) (<= ~n2~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 869#true, Black: 838#true, 622#(= |#race~n1~0| 0), Black: 652#(not |thread1Thread1of1ForFork1_#t~short2#1|), 840#(= |#race~a3~0| 0), Black: 707#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0)), Black: 720#(and (<= ~n1~0 0) (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|)), Black: 706#(<= ~n1~0 0), 634#(= |#race~n2~0| 0), Black: 658#true, Black: 778#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (<= ~n3~0 0)), Black: 791#(and (= |thread2Thread1of1ForFork0_~i~1#1| 0) (not |thread2Thread1of1ForFork0_#t~short11#1|) (<= ~n3~0 0)), Black: 783#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), 866#true, Black: 785#(and (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n3~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n3~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 777#(<= ~n3~0 0), 699#(= |#race~a2~0| 0), Black: 735#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), 640#(= |#race~n3~0| 0), Black: 729#(<= ~n2~0 0), Black: 730#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0)), Black: 673#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 667#(<= ~n1~0 0), Black: 743#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n2~0 0) (not |thread3Thread1of1ForFork2_#t~short20#1|)), Black: 681#(and (<= ~n1~0 0) (not |thread1Thread1of1ForFork1_#t~short2#1|) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), Black: 737#(and (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= ~n2~0 0) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0) (<= ~n2~0 |ULTIMATE.start_create_fresh_int_array_~size#1|)), Black: 668#(and (<= ~n1~0 0) (= |thread1Thread1of1ForFork1_~i~0#1| 0)), 660#(= |#race~a1~0| 0), Black: 675#(and (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= ~n1~0 0) (<= ~n1~0 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~3#1| 0)), Black: 802#(<= ~n3~0 0), Black: 816#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (not |thread3Thread1of1ForFork2_#t~short20#1|) (<= ~n3~0 0)), Black: 689#(not |thread3Thread1of1ForFork2_#t~short20#1|), 556#L79-19true, Black: 803#(and (= |thread3Thread1of1ForFork2_~i~2#1| 0) (<= ~n3~0 0)), 872#true, Black: 694#(not |thread2Thread1of1ForFork0_#t~short11#1|), 471#L105true, Black: 697#true]) [2025-03-08 22:04:51,882 INFO L294 olderBase$Statistics]: this new event has 369 ancestors and is cut-off event [2025-03-08 22:04:51,882 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-03-08 22:04:51,882 INFO L297 olderBase$Statistics]: existing Event has 332 ancestors and is cut-off event [2025-03-08 22:04:51,882 INFO L297 olderBase$Statistics]: existing Event has 363 ancestors and is cut-off event [2025-03-08 22:04:51,887 INFO L124 PetriNetUnfolderBase]: 135/2905 cut-off events. [2025-03-08 22:04:51,887 INFO L125 PetriNetUnfolderBase]: For 200/223 co-relation queries the response was YES. [2025-03-08 22:04:51,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3752 conditions, 2905 events. 135/2905 cut-off events. For 200/223 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 18539 event pairs, 27 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 3718. Up to 90 conditions per place. [2025-03-08 22:04:51,939 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 10 selfloop transitions, 2 changer transitions 11/541 dead transitions. [2025-03-08 22:04:51,939 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 574 places, 541 transitions, 1410 flow [2025-03-08 22:04:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:51,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:51,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-08 22:04:51,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-03-08 22:04:51,940 INFO L175 Difference]: Start difference. First operand has 580 places, 540 transitions, 1382 flow. Second operand 3 states and 1801 transitions. [2025-03-08 22:04:51,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 574 places, 541 transitions, 1410 flow [2025-03-08 22:04:51,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 561 places, 541 transitions, 1364 flow, removed 13 selfloop flow, removed 13 redundant places. [2025-03-08 22:04:51,949 INFO L231 Difference]: Finished difference. Result has 561 places, 528 transitions, 1266 flow [2025-03-08 22:04:51,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1334, PETRI_DIFFERENCE_MINUEND_PLACES=559, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=537, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1266, PETRI_PLACES=561, PETRI_TRANSITIONS=528} [2025-03-08 22:04:51,949 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -26 predicate places. [2025-03-08 22:04:51,950 INFO L471 AbstractCegarLoop]: Abstraction has has 561 places, 528 transitions, 1266 flow [2025-03-08 22:04:51,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.0) internal successors, (1794), 3 states have internal predecessors, (1794), 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-08 22:04:51,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:51,950 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:04:51,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-03-08 22:04:51,950 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 100 more)] === [2025-03-08 22:04:51,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:51,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1291365908, now seen corresponding path program 1 times [2025-03-08 22:04:51,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:51,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194570344] [2025-03-08 22:04:51,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:51,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:51,964 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-03-08 22:04:51,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-03-08 22:04:51,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:51,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:51,997 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 22:04:51,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:51,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194570344] [2025-03-08 22:04:51,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194570344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:51,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:51,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:04:51,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141158492] [2025-03-08 22:04:51,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:51,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:51,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:51,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:51,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:52,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 596 out of 628 [2025-03-08 22:04:52,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 561 places, 528 transitions, 1266 flow. Second operand has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 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-08 22:04:52,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:52,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 596 of 628 [2025-03-08 22:04:52,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:52,231 INFO L124 PetriNetUnfolderBase]: 107/1753 cut-off events. [2025-03-08 22:04:52,231 INFO L125 PetriNetUnfolderBase]: For 69/91 co-relation queries the response was YES. [2025-03-08 22:04:52,253 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 1753 events. 107/1753 cut-off events. For 69/91 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 9623 event pairs, 21 based on Foata normal form. 1/1680 useless extension candidates. Maximal degree in co-relation 2177. Up to 71 conditions per place. [2025-03-08 22:04:52,254 INFO L140 encePairwiseOnDemand]: 625/628 looper letters, 0 selfloop transitions, 0 changer transitions 529/529 dead transitions. [2025-03-08 22:04:52,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 529 transitions, 1294 flow [2025-03-08 22:04:52,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:52,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:52,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1801 transitions. [2025-03-08 22:04:52,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559447983014862 [2025-03-08 22:04:52,255 INFO L175 Difference]: Start difference. First operand has 561 places, 528 transitions, 1266 flow. Second operand 3 states and 1801 transitions. [2025-03-08 22:04:52,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 529 transitions, 1294 flow [2025-03-08 22:04:52,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 542 places, 529 transitions, 1252 flow, removed 11 selfloop flow, removed 13 redundant places. [2025-03-08 22:04:52,259 INFO L231 Difference]: Finished difference. Result has 542 places, 0 transitions, 0 flow [2025-03-08 22:04:52,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=628, PETRI_DIFFERENCE_MINUEND_FLOW=1222, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=527, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=542, PETRI_TRANSITIONS=0} [2025-03-08 22:04:52,260 INFO L279 CegarLoopForPetriNet]: 587 programPoint places, -45 predicate places. [2025-03-08 22:04:52,260 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 0 transitions, 0 flow [2025-03-08 22:04:52,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 598.3333333333334) internal successors, (1795), 3 states have internal predecessors, (1795), 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-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (103 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (102 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (101 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (100 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (99 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (98 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (97 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (96 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (95 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (94 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (93 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (92 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (91 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (90 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (89 of 104 remaining) [2025-03-08 22:04:52,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (88 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (87 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (86 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (85 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (84 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (83 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (82 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (81 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (80 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (79 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (78 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (77 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (76 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (75 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (74 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (73 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (72 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (71 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (70 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (69 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (68 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (67 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (66 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (65 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (64 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (63 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (62 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (61 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (60 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (59 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (58 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (57 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (56 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (55 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (54 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (53 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (52 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (51 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (50 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (49 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (48 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (47 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (46 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (45 of 104 remaining) [2025-03-08 22:04:52,263 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (41 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (40 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (39 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (38 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (37 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (36 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (35 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (34 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (33 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (32 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (31 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (30 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (29 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (28 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (27 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (26 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (25 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (24 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (23 of 104 remaining) [2025-03-08 22:04:52,264 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (22 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (21 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (20 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (19 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (18 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (17 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (16 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (15 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (14 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (13 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (12 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (11 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (6 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (5 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (4 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (3 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (2 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (1 of 104 remaining) [2025-03-08 22:04:52,265 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (0 of 104 remaining) [2025-03-08 22:04:52,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-03-08 22:04:52,265 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, 1, 1, 1, 1] [2025-03-08 22:04:52,269 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-03-08 22:04:52,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 22:04:52,272 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 10:04:52 BasicIcfg [2025-03-08 22:04:52,272 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 22:04:52,273 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 22:04:52,273 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 22:04:52,273 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 22:04:52,274 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:04:17" (3/4) ... [2025-03-08 22:04:52,275 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 22:04:52,277 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-03-08 22:04:52,277 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-03-08 22:04:52,277 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-03-08 22:04:52,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2025-03-08 22:04:52,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-03-08 22:04:52,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 22:04:52,281 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 22:04:52,346 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 22:04:52,346 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 22:04:52,346 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 22:04:52,347 INFO L158 Benchmark]: Toolchain (without parser) took 35611.41ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 128.7MB in the beginning and 828.9MB in the end (delta: -700.2MB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-03-08 22:04:52,348 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 192.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:52,348 INFO L158 Benchmark]: CACSL2BoogieTranslator took 195.08ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 114.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-08 22:04:52,349 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.42ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 111.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:52,350 INFO L158 Benchmark]: Boogie Preprocessor took 42.95ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 107.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 22:04:52,350 INFO L158 Benchmark]: IcfgBuilder took 802.08ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 62.9MB in the end (delta: 45.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-03-08 22:04:52,351 INFO L158 Benchmark]: TraceAbstraction took 34451.13ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 62.2MB in the beginning and 837.3MB in the end (delta: -775.2MB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. [2025-03-08 22:04:52,351 INFO L158 Benchmark]: Witness Printer took 73.37ms. Allocated memory is still 3.0GB. Free memory was 837.3MB in the beginning and 828.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 22:04:52,352 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.21ms. Allocated memory is still 192.9MB. Free memory is still 117.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 195.08ms. Allocated memory is still 167.8MB. Free memory was 128.3MB in the beginning and 114.7MB in the end (delta: 13.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.42ms. Allocated memory is still 167.8MB. Free memory was 114.7MB in the beginning and 111.0MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.95ms. Allocated memory is still 167.8MB. Free memory was 111.0MB in the beginning and 107.9MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 802.08ms. Allocated memory is still 167.8MB. Free memory was 107.9MB in the beginning and 62.9MB in the end (delta: 45.0MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * TraceAbstraction took 34451.13ms. Allocated memory was 167.8MB in the beginning and 3.0GB in the end (delta: 2.8GB). Free memory was 62.2MB in the beginning and 837.3MB in the end (delta: -775.2MB). Peak memory consumption was 2.0GB. Max. memory is 16.1GB. * Witness Printer took 73.37ms. Allocated memory is still 3.0GB. Free memory was 837.3MB in the beginning and 828.9MB 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: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: 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: 52]: 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: 52]: 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: 63]: 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: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: 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: 120]: 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: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 107]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 108]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 932 locations, 979 edges, 104 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: 34.3s, OverallIterations: 37, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 29.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6663 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4298 mSDsluCounter, 6631 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6341 mSDsCounter, 1288 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10721 IncrementalHoareTripleChecker+Invalid, 12009 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1288 mSolverCounterUnsat, 290 mSDtfsCounter, 10721 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1626occurred in iteration=24, InterpolantAutomatonStates: 180, 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.4s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 6303 NumberOfCodeBlocks, 6303 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 6266 ConstructedInterpolants, 0 QuantifiedInterpolants, 8598 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 PerfectInterpolantSequences, 36/36 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 59 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-08 22:04:52,377 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