./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:28:24,625 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:28:24,667 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:28:24,670 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:28:24,670 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:28:24,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:28:24,683 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:28:24,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:28:24,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:28:24,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:28:24,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:28:24,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:28:24,684 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:28:24,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:28:24,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:28:24,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:28:24,686 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:24,686 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:28:24,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:28:24,687 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:28:24,687 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:28:24,687 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:28:24,687 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:28:24,687 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f36f5593156fc25b34b4c706b0d898a2d66ee8bab5f6d91cd69ff9cf3c129193 [2025-02-06 09:28:24,901 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:28:24,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:28:24,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:28:24,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:28:24,912 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:28:24,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-02-06 09:28:26,060 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccd86f68f/81892230f61c4a32b954bff5453eae67/FLAG60f3e7bb8 [2025-02-06 09:28:26,326 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:28:26,327 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-trans.wvr.c [2025-02-06 09:28:26,343 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccd86f68f/81892230f61c4a32b954bff5453eae67/FLAG60f3e7bb8 [2025-02-06 09:28:26,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ccd86f68f/81892230f61c4a32b954bff5453eae67 [2025-02-06 09:28:26,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:28:26,658 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:28:26,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:26,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:28:26,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:28:26,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d2e6837 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26, skipping insertion in model container [2025-02-06 09:28:26,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:28:26,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:26,837 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:28:26,878 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:28:26,893 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:28:26,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26 WrapperNode [2025-02-06 09:28:26,895 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:28:26,895 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:26,895 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:28:26,896 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:28:26,900 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,910 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,950 INFO L138 Inliner]: procedures = 25, calls = 32, calls flagged for inlining = 17, calls inlined = 25, statements flattened = 424 [2025-02-06 09:28:26,950 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:28:26,951 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:28:26,951 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:28:26,951 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:28:26,962 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,962 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,969 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,969 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,991 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,996 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:26,999 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:27,004 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:27,011 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:28:27,012 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:28:27,014 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:28:27,014 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:28:27,015 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (1/1) ... [2025-02-06 09:28:27,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:27,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:27,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:28:27,062 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:28:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:28:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:28:27,081 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:28:27,081 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:28:27,082 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:28:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:28:27,082 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:28:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:28:27,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:28:27,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:28:27,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:28:27,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:28:27,083 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:28:27,084 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:28:27,192 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:28:27,193 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:28:27,710 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:28:27,710 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:28:27,725 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:28:27,726 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:28:27,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:27 BoogieIcfgContainer [2025-02-06 09:28:27,726 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:28:27,728 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:28:27,728 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:28:27,731 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:28:27,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:28:26" (1/3) ... [2025-02-06 09:28:27,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a03639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:27, skipping insertion in model container [2025-02-06 09:28:27,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:28:26" (2/3) ... [2025-02-06 09:28:27,732 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56a03639 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:28:27, skipping insertion in model container [2025-02-06 09:28:27,732 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:27" (3/3) ... [2025-02-06 09:28:27,732 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-trans.wvr.c [2025-02-06 09:28:27,742 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:28:27,743 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-trans.wvr.c that has 4 procedures, 548 locations, 1 initial locations, 6 loop locations, and 45 error locations. [2025-02-06 09:28:27,743 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:28:27,860 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:28:27,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 557 places, 574 transitions, 1169 flow [2025-02-06 09:28:28,024 INFO L124 PetriNetUnfolderBase]: 27/571 cut-off events. [2025-02-06 09:28:28,026 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:28,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 571 events. 27/571 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1280 event pairs, 0 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 431. Up to 2 conditions per place. [2025-02-06 09:28:28,040 INFO L82 GeneralOperation]: Start removeDead. Operand has 557 places, 574 transitions, 1169 flow [2025-02-06 09:28:28,050 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 535 places, 550 transitions, 1118 flow [2025-02-06 09:28:28,059 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:28:28,069 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;@178d252, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:28:28,070 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2025-02-06 09:28:28,080 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:28:28,081 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2025-02-06 09:28:28,081 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:28:28,081 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:28,082 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:28,082 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:28,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:28,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1829140298, now seen corresponding path program 1 times [2025-02-06 09:28:28,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:28,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882619956] [2025-02-06 09:28:28,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:28,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:28,214 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:28:28,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:28:28,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:28,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:28,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:28,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:28,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882619956] [2025-02-06 09:28:28,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882619956] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:28,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:28,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:28,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25688943] [2025-02-06 09:28:28,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:28,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:28,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:28,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:28,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:29,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 485 out of 574 [2025-02-06 09:28:29,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 550 transitions, 1118 flow. Second operand has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 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-02-06 09:28:29,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:29,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 485 of 574 [2025-02-06 09:28:29,221 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:31,205 INFO L124 PetriNetUnfolderBase]: 2075/15242 cut-off events. [2025-02-06 09:28:31,206 INFO L125 PetriNetUnfolderBase]: For 631/633 co-relation queries the response was YES. [2025-02-06 09:28:31,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18445 conditions, 15242 events. 2075/15242 cut-off events. For 631/633 co-relation queries the response was YES. Maximal size of possible extension queue 313. Compared 185103 event pairs, 1520 based on Foata normal form. 641/13502 useless extension candidates. Maximal degree in co-relation 16217. Up to 2820 conditions per place. [2025-02-06 09:28:31,352 INFO L140 encePairwiseOnDemand]: 541/574 looper letters, 54 selfloop transitions, 15 changer transitions 6/532 dead transitions. [2025-02-06 09:28:31,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 532 transitions, 1220 flow [2025-02-06 09:28:31,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:31,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:31,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2997 transitions. [2025-02-06 09:28:31,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8702090592334495 [2025-02-06 09:28:31,371 INFO L175 Difference]: Start difference. First operand has 535 places, 550 transitions, 1118 flow. Second operand 6 states and 2997 transitions. [2025-02-06 09:28:31,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 532 transitions, 1220 flow [2025-02-06 09:28:31,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 531 places, 532 transitions, 1208 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:28:31,386 INFO L231 Difference]: Finished difference. Result has 531 places, 526 transitions, 1088 flow [2025-02-06 09:28:31,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=526, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1088, PETRI_PLACES=531, PETRI_TRANSITIONS=526} [2025-02-06 09:28:31,391 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -4 predicate places. [2025-02-06 09:28:31,391 INFO L471 AbstractCegarLoop]: Abstraction has has 531 places, 526 transitions, 1088 flow [2025-02-06 09:28:31,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 486.5) internal successors, (2919), 6 states have internal predecessors, (2919), 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-02-06 09:28:31,393 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:31,393 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:31,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:28:31,393 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:31,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:31,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1233924963, now seen corresponding path program 1 times [2025-02-06 09:28:31,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:31,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576469943] [2025-02-06 09:28:31,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:31,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:31,402 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:28:31,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:28:31,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:31,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:31,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576469943] [2025-02-06 09:28:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576469943] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:31,424 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:31,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:31,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088193889] [2025-02-06 09:28:31,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:31,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:31,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:31,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:31,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:31,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-02-06 09:28:31,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 531 places, 526 transitions, 1088 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:31,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:31,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-02-06 09:28:31,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:31,556 INFO L124 PetriNetUnfolderBase]: 19/741 cut-off events. [2025-02-06 09:28:31,557 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-06 09:28:31,562 INFO L83 FinitePrefix]: Finished finitePrefix Result has 787 conditions, 741 events. 19/741 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2705 event pairs, 5 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 739. Up to 22 conditions per place. [2025-02-06 09:28:31,566 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/525 dead transitions. [2025-02-06 09:28:31,566 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 525 transitions, 1112 flow [2025-02-06 09:28:31,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:31,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:31,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:31,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:31,569 INFO L175 Difference]: Start difference. First operand has 531 places, 526 transitions, 1088 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:31,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 525 transitions, 1112 flow [2025-02-06 09:28:31,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 521 places, 525 transitions, 1082 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:31,575 INFO L231 Difference]: Finished difference. Result has 521 places, 525 transitions, 1060 flow [2025-02-06 09:28:31,576 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1056, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=525, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1060, PETRI_PLACES=521, PETRI_TRANSITIONS=525} [2025-02-06 09:28:31,577 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -14 predicate places. [2025-02-06 09:28:31,577 INFO L471 AbstractCegarLoop]: Abstraction has has 521 places, 525 transitions, 1060 flow [2025-02-06 09:28:31,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:31,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:31,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:31,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:28:31,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:31,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:31,579 INFO L85 PathProgramCache]: Analyzing trace with hash 1149260577, now seen corresponding path program 1 times [2025-02-06 09:28:31,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:31,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322632223] [2025-02-06 09:28:31,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:31,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:31,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-02-06 09:28:31,589 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-02-06 09:28:31,589 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:31,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:31,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:31,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322632223] [2025-02-06 09:28:31,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322632223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:31,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:31,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:31,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418675279] [2025-02-06 09:28:31,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:31,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:31,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:31,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:31,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:31,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-02-06 09:28:31,630 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 521 places, 525 transitions, 1060 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:31,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:31,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-02-06 09:28:31,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:31,742 INFO L124 PetriNetUnfolderBase]: 25/947 cut-off events. [2025-02-06 09:28:31,742 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-06 09:28:31,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 985 conditions, 947 events. 25/947 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3861 event pairs, 7 based on Foata normal form. 0/820 useless extension candidates. Maximal degree in co-relation 912. Up to 25 conditions per place. [2025-02-06 09:28:31,752 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-02-06 09:28:31,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 524 transitions, 1084 flow [2025-02-06 09:28:31,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:31,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:31,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:31,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:31,755 INFO L175 Difference]: Start difference. First operand has 521 places, 525 transitions, 1060 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:31,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 524 transitions, 1084 flow [2025-02-06 09:28:31,758 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 520 places, 524 transitions, 1080 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:31,761 INFO L231 Difference]: Finished difference. Result has 520 places, 524 transitions, 1058 flow [2025-02-06 09:28:31,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1054, PETRI_DIFFERENCE_MINUEND_PLACES=518, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=524, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=522, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1058, PETRI_PLACES=520, PETRI_TRANSITIONS=524} [2025-02-06 09:28:31,762 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -15 predicate places. [2025-02-06 09:28:31,762 INFO L471 AbstractCegarLoop]: Abstraction has has 520 places, 524 transitions, 1058 flow [2025-02-06 09:28:31,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:31,763 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:31,763 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-02-06 09:28:31,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:28:31,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:31,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:31,764 INFO L85 PathProgramCache]: Analyzing trace with hash 958076376, now seen corresponding path program 1 times [2025-02-06 09:28:31,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:31,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274662362] [2025-02-06 09:28:31,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:31,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:31,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-02-06 09:28:31,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-02-06 09:28:31,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:31,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:31,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:31,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:31,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274662362] [2025-02-06 09:28:31,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274662362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:31,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:31,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:31,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842829695] [2025-02-06 09:28:31,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:31,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:31,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:31,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:31,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:31,877 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-02-06 09:28:31,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 520 places, 524 transitions, 1058 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:31,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:31,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-02-06 09:28:31,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:31,947 INFO L124 PetriNetUnfolderBase]: 19/637 cut-off events. [2025-02-06 09:28:31,947 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-06 09:28:31,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 672 conditions, 637 events. 19/637 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2041 event pairs, 7 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 552. Up to 25 conditions per place. [2025-02-06 09:28:31,955 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/523 dead transitions. [2025-02-06 09:28:31,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 523 transitions, 1082 flow [2025-02-06 09:28:31,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:31,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:31,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:31,958 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:31,958 INFO L175 Difference]: Start difference. First operand has 520 places, 524 transitions, 1058 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:31,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 523 transitions, 1082 flow [2025-02-06 09:28:31,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 523 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:31,964 INFO L231 Difference]: Finished difference. Result has 519 places, 523 transitions, 1056 flow [2025-02-06 09:28:31,966 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=517, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=523, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=521, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=519, PETRI_TRANSITIONS=523} [2025-02-06 09:28:31,967 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -16 predicate places. [2025-02-06 09:28:31,967 INFO L471 AbstractCegarLoop]: Abstraction has has 519 places, 523 transitions, 1056 flow [2025-02-06 09:28:31,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:31,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:31,968 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] [2025-02-06 09:28:31,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:28:31,968 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:31,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:31,968 INFO L85 PathProgramCache]: Analyzing trace with hash -954992240, now seen corresponding path program 1 times [2025-02-06 09:28:31,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:31,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505266056] [2025-02-06 09:28:31,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:31,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:31,985 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 09:28:31,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 09:28:31,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:31,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:32,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505266056] [2025-02-06 09:28:32,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505266056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:32,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897515932] [2025-02-06 09:28:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:32,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:32,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:32,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:32,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-02-06 09:28:32,049 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 519 places, 523 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:32,049 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:32,049 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-02-06 09:28:32,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:32,123 INFO L124 PetriNetUnfolderBase]: 21/826 cut-off events. [2025-02-06 09:28:32,124 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:28:32,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 859 conditions, 826 events. 21/826 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3388 event pairs, 5 based on Foata normal form. 0/720 useless extension candidates. Maximal degree in co-relation 692. Up to 22 conditions per place. [2025-02-06 09:28:32,132 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-02-06 09:28:32,132 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 520 places, 522 transitions, 1080 flow [2025-02-06 09:28:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:32,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:32,135 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:32,135 INFO L175 Difference]: Start difference. First operand has 519 places, 523 transitions, 1056 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:32,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 520 places, 522 transitions, 1080 flow [2025-02-06 09:28:32,137 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 518 places, 522 transitions, 1076 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:32,140 INFO L231 Difference]: Finished difference. Result has 518 places, 522 transitions, 1054 flow [2025-02-06 09:28:32,141 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=516, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1054, PETRI_PLACES=518, PETRI_TRANSITIONS=522} [2025-02-06 09:28:32,141 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-02-06 09:28:32,141 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 522 transitions, 1054 flow [2025-02-06 09:28:32,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:32,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:32,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:32,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:28:32,143 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:32,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:32,143 INFO L85 PathProgramCache]: Analyzing trace with hash -937154319, now seen corresponding path program 1 times [2025-02-06 09:28:32,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:32,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561874274] [2025-02-06 09:28:32,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:32,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:32,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-06 09:28:32,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-06 09:28:32,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:32,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:32,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:32,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:32,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561874274] [2025-02-06 09:28:32,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561874274] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:32,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:32,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:32,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618043904] [2025-02-06 09:28:32,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:32,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:32,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:32,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:32,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:32,209 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-02-06 09:28:32,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 522 transitions, 1054 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:32,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:32,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-02-06 09:28:32,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:32,311 INFO L124 PetriNetUnfolderBase]: 27/1034 cut-off events. [2025-02-06 09:28:32,312 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-02-06 09:28:32,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1072 conditions, 1034 events. 27/1034 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 4725 event pairs, 7 based on Foata normal form. 0/894 useless extension candidates. Maximal degree in co-relation 897. Up to 25 conditions per place. [2025-02-06 09:28:32,325 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-02-06 09:28:32,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 521 transitions, 1078 flow [2025-02-06 09:28:32,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:32,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:32,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:32,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:32,330 INFO L175 Difference]: Start difference. First operand has 518 places, 522 transitions, 1054 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:32,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 521 transitions, 1078 flow [2025-02-06 09:28:32,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1074 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:32,337 INFO L231 Difference]: Finished difference. Result has 517 places, 521 transitions, 1052 flow [2025-02-06 09:28:32,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1048, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=519, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1052, PETRI_PLACES=517, PETRI_TRANSITIONS=521} [2025-02-06 09:28:32,338 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-02-06 09:28:32,339 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 521 transitions, 1052 flow [2025-02-06 09:28:32,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:32,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:32,340 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:32,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:28:32,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:32,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:32,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1300924044, now seen corresponding path program 1 times [2025-02-06 09:28:32,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:32,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440680427] [2025-02-06 09:28:32,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:32,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:32,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-02-06 09:28:32,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-02-06 09:28:32,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:32,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:32,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:32,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:32,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440680427] [2025-02-06 09:28:32,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440680427] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:32,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:32,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:32,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840384261] [2025-02-06 09:28:32,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:32,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:32,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:32,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:32,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:32,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 542 out of 574 [2025-02-06 09:28:32,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 521 transitions, 1052 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:32,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:32,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 542 of 574 [2025-02-06 09:28:32,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:32,486 INFO L124 PetriNetUnfolderBase]: 25/898 cut-off events. [2025-02-06 09:28:32,486 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-02-06 09:28:32,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 933 conditions, 898 events. 25/898 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3243 event pairs, 7 based on Foata normal form. 0/783 useless extension candidates. Maximal degree in co-relation 750. Up to 25 conditions per place. [2025-02-06 09:28:32,496 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 11 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-02-06 09:28:32,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 518 places, 520 transitions, 1076 flow [2025-02-06 09:28:32,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:32,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:32,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:32,499 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:32,499 INFO L175 Difference]: Start difference. First operand has 517 places, 521 transitions, 1052 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:32,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 518 places, 520 transitions, 1076 flow [2025-02-06 09:28:32,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 520 transitions, 1072 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:32,504 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1050 flow [2025-02-06 09:28:32,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1046, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=518, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1050, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-02-06 09:28:32,507 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-02-06 09:28:32,507 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1050 flow [2025-02-06 09:28:32,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:32,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:32,508 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] [2025-02-06 09:28:32,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:28:32,508 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:32,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:32,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1130005336, now seen corresponding path program 1 times [2025-02-06 09:28:32,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:32,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656116899] [2025-02-06 09:28:32,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:32,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:32,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-02-06 09:28:32,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-02-06 09:28:32,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:32,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:32,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:32,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656116899] [2025-02-06 09:28:32,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656116899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:32,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:32,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:32,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445399587] [2025-02-06 09:28:32,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:32,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:32,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:32,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:32,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-02-06 09:28:32,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1050 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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-02-06 09:28:32,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:32,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-02-06 09:28:32,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:32,742 INFO L124 PetriNetUnfolderBase]: 36/1226 cut-off events. [2025-02-06 09:28:32,742 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:28:32,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1273 conditions, 1226 events. 36/1226 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6567 event pairs, 8 based on Foata normal form. 0/1064 useless extension candidates. Maximal degree in co-relation 1082. Up to 31 conditions per place. [2025-02-06 09:28:32,756 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-02-06 09:28:32,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 522 transitions, 1086 flow [2025-02-06 09:28:32,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:32,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:32,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-02-06 09:28:32,758 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-02-06 09:28:32,758 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1050 flow. Second operand 3 states and 1649 transitions. [2025-02-06 09:28:32,758 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 522 transitions, 1086 flow [2025-02-06 09:28:32,760 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 522 transitions, 1082 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:32,765 INFO L231 Difference]: Finished difference. Result has 515 places, 520 transitions, 1056 flow [2025-02-06 09:28:32,766 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=512, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1056, PETRI_PLACES=515, PETRI_TRANSITIONS=520} [2025-02-06 09:28:32,766 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -20 predicate places. [2025-02-06 09:28:32,767 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 520 transitions, 1056 flow [2025-02-06 09:28:32,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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-02-06 09:28:32,767 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:32,767 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] [2025-02-06 09:28:32,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:28:32,767 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:32,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:32,768 INFO L85 PathProgramCache]: Analyzing trace with hash 280863627, now seen corresponding path program 1 times [2025-02-06 09:28:32,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:32,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322396922] [2025-02-06 09:28:32,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:32,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:32,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-06 09:28:32,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-06 09:28:32,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:32,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:32,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:32,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:32,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322396922] [2025-02-06 09:28:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322396922] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:32,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443060796] [2025-02-06 09:28:32,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:32,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:32,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:32,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:32,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:32,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-02-06 09:28:32,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 520 transitions, 1056 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:32,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:32,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-02-06 09:28:32,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:32,937 INFO L124 PetriNetUnfolderBase]: 49/1359 cut-off events. [2025-02-06 09:28:32,937 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:28:32,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1428 conditions, 1359 events. 49/1359 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 8202 event pairs, 5 based on Foata normal form. 0/1184 useless extension candidates. Maximal degree in co-relation 1127. Up to 43 conditions per place. [2025-02-06 09:28:32,952 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/522 dead transitions. [2025-02-06 09:28:32,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 522 transitions, 1092 flow [2025-02-06 09:28:32,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:32,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:32,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-02-06 09:28:32,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-02-06 09:28:32,954 INFO L175 Difference]: Start difference. First operand has 515 places, 520 transitions, 1056 flow. Second operand 3 states and 1649 transitions. [2025-02-06 09:28:32,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 522 transitions, 1092 flow [2025-02-06 09:28:32,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 522 transitions, 1092 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:32,960 INFO L231 Difference]: Finished difference. Result has 516 places, 520 transitions, 1066 flow [2025-02-06 09:28:32,960 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1052, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1066, PETRI_PLACES=516, PETRI_TRANSITIONS=520} [2025-02-06 09:28:32,961 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-02-06 09:28:32,961 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 520 transitions, 1066 flow [2025-02-06 09:28:32,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:32,962 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:32,962 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-02-06 09:28:32,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:28:32,962 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:32,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:32,962 INFO L85 PathProgramCache]: Analyzing trace with hash 450560803, now seen corresponding path program 1 times [2025-02-06 09:28:32,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:32,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971771745] [2025-02-06 09:28:32,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:32,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:32,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-02-06 09:28:32,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-02-06 09:28:32,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:32,980 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:33,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:33,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971771745] [2025-02-06 09:28:33,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971771745] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:33,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:33,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:33,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970815058] [2025-02-06 09:28:33,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:33,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:33,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:33,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:33,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:33,033 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:28:33,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 520 transitions, 1066 flow. Second operand has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 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-02-06 09:28:33,034 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:33,034 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:28:33,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:33,152 INFO L124 PetriNetUnfolderBase]: 51/1185 cut-off events. [2025-02-06 09:28:33,152 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:28:33,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1303 conditions, 1185 events. 51/1185 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6459 event pairs, 18 based on Foata normal form. 0/1038 useless extension candidates. Maximal degree in co-relation 1002. Up to 57 conditions per place. [2025-02-06 09:28:33,165 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-02-06 09:28:33,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-02-06 09:28:33,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:33,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:33,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-02-06 09:28:33,168 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-02-06 09:28:33,168 INFO L175 Difference]: Start difference. First operand has 516 places, 520 transitions, 1066 flow. Second operand 3 states and 1641 transitions. [2025-02-06 09:28:33,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-02-06 09:28:33,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 521 transitions, 1104 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:33,173 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1068 flow [2025-02-06 09:28:33,173 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1064, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=519, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=517, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1068, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-02-06 09:28:33,174 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-02-06 09:28:33,174 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1068 flow [2025-02-06 09:28:33,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.3333333333334) internal successors, (1627), 3 states have internal predecessors, (1627), 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-02-06 09:28:33,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:33,175 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] [2025-02-06 09:28:33,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:28:33,175 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:33,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:33,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1796698736, now seen corresponding path program 1 times [2025-02-06 09:28:33,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:33,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215372028] [2025-02-06 09:28:33,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:33,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:33,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-02-06 09:28:33,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-02-06 09:28:33,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:33,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:33,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:33,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:33,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215372028] [2025-02-06 09:28:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215372028] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:33,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:33,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:33,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526616509] [2025-02-06 09:28:33,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:33,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:33,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:33,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:33,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:33,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-02-06 09:28:33,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1068 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:33,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:33,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-02-06 09:28:33,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:33,431 INFO L124 PetriNetUnfolderBase]: 68/1866 cut-off events. [2025-02-06 09:28:33,435 INFO L125 PetriNetUnfolderBase]: For 16/21 co-relation queries the response was YES. [2025-02-06 09:28:33,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1954 conditions, 1866 events. 68/1866 cut-off events. For 16/21 co-relation queries the response was YES. Maximal size of possible extension queue 41. Compared 12153 event pairs, 15 based on Foata normal form. 0/1612 useless extension candidates. Maximal degree in co-relation 1556. Up to 56 conditions per place. [2025-02-06 09:28:33,458 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/521 dead transitions. [2025-02-06 09:28:33,459 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 517 places, 521 transitions, 1104 flow [2025-02-06 09:28:33,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:33,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:33,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-02-06 09:28:33,461 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-02-06 09:28:33,461 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1068 flow. Second operand 3 states and 1649 transitions. [2025-02-06 09:28:33,461 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 517 places, 521 transitions, 1104 flow [2025-02-06 09:28:33,463 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 521 transitions, 1100 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:33,473 INFO L231 Difference]: Finished difference. Result has 516 places, 519 transitions, 1074 flow [2025-02-06 09:28:33,473 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1060, PETRI_DIFFERENCE_MINUEND_PLACES=513, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1074, PETRI_PLACES=516, PETRI_TRANSITIONS=519} [2025-02-06 09:28:33,474 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -19 predicate places. [2025-02-06 09:28:33,474 INFO L471 AbstractCegarLoop]: Abstraction has has 516 places, 519 transitions, 1074 flow [2025-02-06 09:28:33,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:33,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:33,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:33,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:28:33,475 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:33,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:33,479 INFO L85 PathProgramCache]: Analyzing trace with hash 287383189, now seen corresponding path program 1 times [2025-02-06 09:28:33,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:33,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846065218] [2025-02-06 09:28:33,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:33,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:33,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-06 09:28:33,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-06 09:28:33,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:33,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:33,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:33,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:33,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846065218] [2025-02-06 09:28:33,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846065218] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:33,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:33,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:33,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035037409] [2025-02-06 09:28:33,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:33,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:33,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:33,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:33,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:33,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-02-06 09:28:33,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 516 places, 519 transitions, 1074 flow. Second operand has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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-02-06 09:28:33,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:33,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-02-06 09:28:33,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:34,008 INFO L124 PetriNetUnfolderBase]: 101/2286 cut-off events. [2025-02-06 09:28:34,008 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-02-06 09:28:34,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2434 conditions, 2286 events. 101/2286 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 15754 event pairs, 6 based on Foata normal form. 0/1974 useless extension candidates. Maximal degree in co-relation 1997. Up to 104 conditions per place. [2025-02-06 09:28:34,034 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-02-06 09:28:34,034 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 524 transitions, 1125 flow [2025-02-06 09:28:34,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:34,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:34,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-02-06 09:28:34,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-02-06 09:28:34,037 INFO L175 Difference]: Start difference. First operand has 516 places, 519 transitions, 1074 flow. Second operand 3 states and 1652 transitions. [2025-02-06 09:28:34,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 524 transitions, 1125 flow [2025-02-06 09:28:34,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 524 transitions, 1125 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:34,042 INFO L231 Difference]: Finished difference. Result has 517 places, 519 transitions, 1084 flow [2025-02-06 09:28:34,042 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1070, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=515, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1084, PETRI_PLACES=517, PETRI_TRANSITIONS=519} [2025-02-06 09:28:34,044 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-02-06 09:28:34,045 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 519 transitions, 1084 flow [2025-02-06 09:28:34,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.3333333333334) internal successors, (1636), 3 states have internal predecessors, (1636), 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-02-06 09:28:34,045 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:34,046 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-02-06 09:28:34,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:28:34,046 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:34,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:34,046 INFO L85 PathProgramCache]: Analyzing trace with hash 318976233, now seen corresponding path program 1 times [2025-02-06 09:28:34,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:34,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257168223] [2025-02-06 09:28:34,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:34,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:34,055 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:28:34,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:28:34,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:34,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:34,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:34,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:34,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257168223] [2025-02-06 09:28:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257168223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:34,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:34,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443439377] [2025-02-06 09:28:34,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:34,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:34,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:34,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:34,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:34,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-02-06 09:28:34,119 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 519 transitions, 1084 flow. Second operand has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-06 09:28:34,119 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:34,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-02-06 09:28:34,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:34,479 INFO L124 PetriNetUnfolderBase]: 118/2771 cut-off events. [2025-02-06 09:28:34,480 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-02-06 09:28:34,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3033 conditions, 2771 events. 118/2771 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 20090 event pairs, 15 based on Foata normal form. 0/2426 useless extension candidates. Maximal degree in co-relation 2596. Up to 57 conditions per place. [2025-02-06 09:28:34,501 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-02-06 09:28:34,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 516 places, 521 transitions, 1130 flow [2025-02-06 09:28:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:34,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:34,504 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:34,504 INFO L175 Difference]: Start difference. First operand has 517 places, 519 transitions, 1084 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:34,504 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 516 places, 521 transitions, 1130 flow [2025-02-06 09:28:34,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 516 places, 521 transitions, 1130 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:34,511 INFO L231 Difference]: Finished difference. Result has 518 places, 519 transitions, 1110 flow [2025-02-06 09:28:34,512 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1078, PETRI_DIFFERENCE_MINUEND_PLACES=514, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=516, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1110, PETRI_PLACES=518, PETRI_TRANSITIONS=519} [2025-02-06 09:28:34,512 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -17 predicate places. [2025-02-06 09:28:34,513 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 519 transitions, 1110 flow [2025-02-06 09:28:34,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.3333333333334) internal successors, (1621), 3 states have internal predecessors, (1621), 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-02-06 09:28:34,513 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:34,514 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-02-06 09:28:34,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:28:34,514 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:34,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:34,515 INFO L85 PathProgramCache]: Analyzing trace with hash 327059527, now seen corresponding path program 1 times [2025-02-06 09:28:34,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:34,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528669016] [2025-02-06 09:28:34,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:34,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:34,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-06 09:28:34,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-06 09:28:34,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:34,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:34,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:34,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528669016] [2025-02-06 09:28:34,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528669016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:34,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:34,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:34,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216273019] [2025-02-06 09:28:34,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:34,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:34,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:34,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:34,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:34,605 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:28:34,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 519 transitions, 1110 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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-02-06 09:28:34,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:34,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:28:34,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:35,018 INFO L124 PetriNetUnfolderBase]: 92/2232 cut-off events. [2025-02-06 09:28:35,018 INFO L125 PetriNetUnfolderBase]: For 36/118 co-relation queries the response was YES. [2025-02-06 09:28:35,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2428 conditions, 2232 events. 92/2232 cut-off events. For 36/118 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 14682 event pairs, 22 based on Foata normal form. 2/1934 useless extension candidates. Maximal degree in co-relation 1879. Up to 58 conditions per place. [2025-02-06 09:28:35,060 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/520 dead transitions. [2025-02-06 09:28:35,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 520 transitions, 1148 flow [2025-02-06 09:28:35,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:35,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:35,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-02-06 09:28:35,063 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-02-06 09:28:35,063 INFO L175 Difference]: Start difference. First operand has 518 places, 519 transitions, 1110 flow. Second operand 3 states and 1641 transitions. [2025-02-06 09:28:35,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 520 transitions, 1148 flow [2025-02-06 09:28:35,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 517 places, 520 transitions, 1138 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:35,071 INFO L231 Difference]: Finished difference. Result has 517 places, 518 transitions, 1102 flow [2025-02-06 09:28:35,072 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1098, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=518, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1102, PETRI_PLACES=517, PETRI_TRANSITIONS=518} [2025-02-06 09:28:35,073 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -18 predicate places. [2025-02-06 09:28:35,073 INFO L471 AbstractCegarLoop]: Abstraction has has 517 places, 518 transitions, 1102 flow [2025-02-06 09:28:35,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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-02-06 09:28:35,074 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:35,074 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-02-06 09:28:35,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:28:35,074 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:35,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:35,076 INFO L85 PathProgramCache]: Analyzing trace with hash -2110907524, now seen corresponding path program 1 times [2025-02-06 09:28:35,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:35,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933053834] [2025-02-06 09:28:35,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:35,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:35,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-06 09:28:35,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-06 09:28:35,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:35,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:35,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:35,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:35,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933053834] [2025-02-06 09:28:35,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933053834] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:35,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:35,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:28:35,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450030695] [2025-02-06 09:28:35,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:35,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:28:35,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:35,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:28:35,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:28:35,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-02-06 09:28:35,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 517 places, 518 transitions, 1102 flow. Second operand has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 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-02-06 09:28:35,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:35,211 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-02-06 09:28:35,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:35,804 INFO L124 PetriNetUnfolderBase]: 124/3253 cut-off events. [2025-02-06 09:28:35,804 INFO L125 PetriNetUnfolderBase]: For 7/13 co-relation queries the response was YES. [2025-02-06 09:28:35,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3601 conditions, 3253 events. 124/3253 cut-off events. For 7/13 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 24219 event pairs, 24 based on Foata normal form. 2/2851 useless extension candidates. Maximal degree in co-relation 3439. Up to 67 conditions per place. [2025-02-06 09:28:35,849 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 27 selfloop transitions, 4 changer transitions 0/534 dead transitions. [2025-02-06 09:28:35,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 521 places, 534 transitions, 1206 flow [2025-02-06 09:28:35,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:35,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2747 transitions. [2025-02-06 09:28:35,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9571428571428572 [2025-02-06 09:28:35,854 INFO L175 Difference]: Start difference. First operand has 517 places, 518 transitions, 1102 flow. Second operand 5 states and 2747 transitions. [2025-02-06 09:28:35,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 521 places, 534 transitions, 1206 flow [2025-02-06 09:28:35,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 519 places, 534 transitions, 1202 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:35,860 INFO L231 Difference]: Finished difference. Result has 522 places, 520 transitions, 1123 flow [2025-02-06 09:28:35,861 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1094, PETRI_DIFFERENCE_MINUEND_PLACES=515, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1123, PETRI_PLACES=522, PETRI_TRANSITIONS=520} [2025-02-06 09:28:35,861 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -13 predicate places. [2025-02-06 09:28:35,861 INFO L471 AbstractCegarLoop]: Abstraction has has 522 places, 520 transitions, 1123 flow [2025-02-06 09:28:35,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.25) internal successors, (2177), 4 states have internal predecessors, (2177), 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-02-06 09:28:35,863 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:35,863 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] [2025-02-06 09:28:35,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:28:35,863 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:35,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:35,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1491004835, now seen corresponding path program 1 times [2025-02-06 09:28:35,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:35,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384844493] [2025-02-06 09:28:35,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:35,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:35,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-06 09:28:35,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-06 09:28:35,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:35,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:35,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:35,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:35,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384844493] [2025-02-06 09:28:35,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384844493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:35,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:35,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:35,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748496903] [2025-02-06 09:28:35,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:35,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 09:28:35,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:35,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 09:28:35,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 09:28:36,095 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 524 out of 574 [2025-02-06 09:28:36,097 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 522 places, 520 transitions, 1123 flow. Second operand has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 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-02-06 09:28:36,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:36,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 524 of 574 [2025-02-06 09:28:36,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:36,377 INFO L124 PetriNetUnfolderBase]: 47/1670 cut-off events. [2025-02-06 09:28:36,378 INFO L125 PetriNetUnfolderBase]: For 11/22 co-relation queries the response was YES. [2025-02-06 09:28:36,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1835 conditions, 1670 events. 47/1670 cut-off events. For 11/22 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8752 event pairs, 3 based on Foata normal form. 3/1481 useless extension candidates. Maximal degree in co-relation 1699. Up to 30 conditions per place. [2025-02-06 09:28:36,391 INFO L140 encePairwiseOnDemand]: 553/574 looper letters, 18 selfloop transitions, 18 changer transitions 0/523 dead transitions. [2025-02-06 09:28:36,392 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 526 places, 523 transitions, 1201 flow [2025-02-06 09:28:36,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:36,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:36,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2659 transitions. [2025-02-06 09:28:36,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9264808362369338 [2025-02-06 09:28:36,396 INFO L175 Difference]: Start difference. First operand has 522 places, 520 transitions, 1123 flow. Second operand 5 states and 2659 transitions. [2025-02-06 09:28:36,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 526 places, 523 transitions, 1201 flow [2025-02-06 09:28:36,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 526 places, 523 transitions, 1201 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:36,400 INFO L231 Difference]: Finished difference. Result has 527 places, 523 transitions, 1183 flow [2025-02-06 09:28:36,401 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1123, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=502, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1183, PETRI_PLACES=527, PETRI_TRANSITIONS=523} [2025-02-06 09:28:36,401 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -8 predicate places. [2025-02-06 09:28:36,401 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 523 transitions, 1183 flow [2025-02-06 09:28:36,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 529.0) internal successors, (2645), 5 states have internal predecessors, (2645), 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-02-06 09:28:36,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:36,402 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-02-06 09:28:36,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:28:36,402 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:36,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash 434895472, now seen corresponding path program 1 times [2025-02-06 09:28:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:36,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14592542] [2025-02-06 09:28:36,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:36,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:36,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 09:28:36,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 09:28:36,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:36,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:36,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-06 09:28:36,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:36,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14592542] [2025-02-06 09:28:36,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14592542] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:36,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:36,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:36,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321094916] [2025-02-06 09:28:36,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:36,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:36,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:36,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:36,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:36,489 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:28:36,490 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 523 transitions, 1183 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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-02-06 09:28:36,490 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:36,490 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:28:36,490 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:37,111 INFO L124 PetriNetUnfolderBase]: 188/4808 cut-off events. [2025-02-06 09:28:37,111 INFO L125 PetriNetUnfolderBase]: For 59/79 co-relation queries the response was YES. [2025-02-06 09:28:37,163 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5351 conditions, 4808 events. 188/4808 cut-off events. For 59/79 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39516 event pairs, 45 based on Foata normal form. 4/4214 useless extension candidates. Maximal degree in co-relation 5122. Up to 128 conditions per place. [2025-02-06 09:28:37,180 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/524 dead transitions. [2025-02-06 09:28:37,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 528 places, 524 transitions, 1225 flow [2025-02-06 09:28:37,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:37,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-02-06 09:28:37,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-02-06 09:28:37,183 INFO L175 Difference]: Start difference. First operand has 527 places, 523 transitions, 1183 flow. Second operand 3 states and 1641 transitions. [2025-02-06 09:28:37,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 528 places, 524 transitions, 1225 flow [2025-02-06 09:28:37,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 525 places, 524 transitions, 1195 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-06 09:28:37,190 INFO L231 Difference]: Finished difference. Result has 525 places, 522 transitions, 1155 flow [2025-02-06 09:28:37,191 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=520, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1155, PETRI_PLACES=525, PETRI_TRANSITIONS=522} [2025-02-06 09:28:37,191 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -10 predicate places. [2025-02-06 09:28:37,191 INFO L471 AbstractCegarLoop]: Abstraction has has 525 places, 522 transitions, 1155 flow [2025-02-06 09:28:37,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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-02-06 09:28:37,196 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:37,196 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-02-06 09:28:37,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:28:37,196 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:37,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:37,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1304898259, now seen corresponding path program 1 times [2025-02-06 09:28:37,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:37,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820704351] [2025-02-06 09:28:37,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:37,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:37,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 09:28:37,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 09:28:37,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:37,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:37,363 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:28:37,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820704351] [2025-02-06 09:28:37,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820704351] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:28:37,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073187426] [2025-02-06 09:28:37,364 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:37,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:37,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:37,369 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:28:37,372 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 09:28:37,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-02-06 09:28:37,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-02-06 09:28:37,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:37,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:37,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 09:28:37,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:28:37,615 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:28:37,615 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:28:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-06 09:28:37,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073187426] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:28:37,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:28:37,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-06 09:28:37,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139134449] [2025-02-06 09:28:37,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:28:37,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 09:28:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:37,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 09:28:37,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-06 09:28:38,184 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-02-06 09:28:38,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 525 places, 522 transitions, 1155 flow. Second operand has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 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-02-06 09:28:38,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:38,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-02-06 09:28:38,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:38,583 INFO L124 PetriNetUnfolderBase]: 47/1715 cut-off events. [2025-02-06 09:28:38,583 INFO L125 PetriNetUnfolderBase]: For 20/31 co-relation queries the response was YES. [2025-02-06 09:28:38,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1942 conditions, 1715 events. 47/1715 cut-off events. For 20/31 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 8595 event pairs, 3 based on Foata normal form. 6/1535 useless extension candidates. Maximal degree in co-relation 1800. Up to 30 conditions per place. [2025-02-06 09:28:38,600 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 30 selfloop transitions, 39 changer transitions 0/546 dead transitions. [2025-02-06 09:28:38,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 546 transitions, 1347 flow [2025-02-06 09:28:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-06 09:28:38,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-06 09:28:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 5740 transitions. [2025-02-06 09:28:38,606 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9090909090909091 [2025-02-06 09:28:38,606 INFO L175 Difference]: Start difference. First operand has 525 places, 522 transitions, 1155 flow. Second operand 11 states and 5740 transitions. [2025-02-06 09:28:38,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 546 transitions, 1347 flow [2025-02-06 09:28:38,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 546 transitions, 1343 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:38,611 INFO L231 Difference]: Finished difference. Result has 536 places, 540 transitions, 1331 flow [2025-02-06 09:28:38,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1151, PETRI_DIFFERENCE_MINUEND_PLACES=523, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=522, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=492, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1331, PETRI_PLACES=536, PETRI_TRANSITIONS=540} [2025-02-06 09:28:38,612 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 1 predicate places. [2025-02-06 09:28:38,612 INFO L471 AbstractCegarLoop]: Abstraction has has 536 places, 540 transitions, 1331 flow [2025-02-06 09:28:38,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 518.4666666666667) internal successors, (7777), 15 states have internal predecessors, (7777), 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-02-06 09:28:38,614 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:38,614 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:38,621 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 09:28:38,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-06 09:28:38,814 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:38,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:38,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1818241427, now seen corresponding path program 2 times [2025-02-06 09:28:38,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:38,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5910896] [2025-02-06 09:28:38,816 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:28:38,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:38,840 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 306 statements into 2 equivalence classes. [2025-02-06 09:28:38,847 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 171 of 306 statements. [2025-02-06 09:28:38,847 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:28:38,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:39,154 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:39,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:39,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5910896] [2025-02-06 09:28:39,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5910896] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:39,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:39,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:39,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605787747] [2025-02-06 09:28:39,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:39,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:39,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:39,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:39,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:39,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-02-06 09:28:39,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 536 places, 540 transitions, 1331 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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-02-06 09:28:39,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:39,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-02-06 09:28:39,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:39,810 INFO L124 PetriNetUnfolderBase]: 100/2643 cut-off events. [2025-02-06 09:28:39,810 INFO L125 PetriNetUnfolderBase]: For 63/70 co-relation queries the response was YES. [2025-02-06 09:28:39,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3127 conditions, 2643 events. 100/2643 cut-off events. For 63/70 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 17454 event pairs, 9 based on Foata normal form. 0/2363 useless extension candidates. Maximal degree in co-relation 2992. Up to 79 conditions per place. [2025-02-06 09:28:39,848 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/547 dead transitions. [2025-02-06 09:28:39,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 547 transitions, 1425 flow [2025-02-06 09:28:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:39,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-02-06 09:28:39,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-02-06 09:28:39,852 INFO L175 Difference]: Start difference. First operand has 536 places, 540 transitions, 1331 flow. Second operand 6 states and 3210 transitions. [2025-02-06 09:28:39,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 547 transitions, 1425 flow [2025-02-06 09:28:39,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 547 transitions, 1389 flow, removed 6 selfloop flow, removed 3 redundant places. [2025-02-06 09:28:39,859 INFO L231 Difference]: Finished difference. Result has 537 places, 539 transitions, 1305 flow [2025-02-06 09:28:39,860 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1305, PETRI_PLACES=537, PETRI_TRANSITIONS=539} [2025-02-06 09:28:39,860 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-02-06 09:28:39,860 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 539 transitions, 1305 flow [2025-02-06 09:28:39,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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-02-06 09:28:39,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:39,861 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:39,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:28:39,861 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:39,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:39,862 INFO L85 PathProgramCache]: Analyzing trace with hash 716294824, now seen corresponding path program 1 times [2025-02-06 09:28:39,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:39,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711692079] [2025-02-06 09:28:39,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:39,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:39,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-02-06 09:28:39,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-02-06 09:28:39,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:39,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:39,939 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:39,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:39,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711692079] [2025-02-06 09:28:39,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711692079] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:39,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:39,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:39,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958068293] [2025-02-06 09:28:39,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:39,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:39,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:39,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:39,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:39,949 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-02-06 09:28:39,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 539 transitions, 1305 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:39,950 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:39,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-02-06 09:28:39,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:40,461 INFO L124 PetriNetUnfolderBase]: 125/3167 cut-off events. [2025-02-06 09:28:40,461 INFO L125 PetriNetUnfolderBase]: For 66/87 co-relation queries the response was YES. [2025-02-06 09:28:40,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3685 conditions, 3167 events. 125/3167 cut-off events. For 66/87 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 22694 event pairs, 15 based on Foata normal form. 1/2847 useless extension candidates. Maximal degree in co-relation 3355. Up to 118 conditions per place. [2025-02-06 09:28:40,506 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 16 selfloop transitions, 2 changer transitions 0/544 dead transitions. [2025-02-06 09:28:40,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 544 transitions, 1356 flow [2025-02-06 09:28:40,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:40,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:40,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1652 transitions. [2025-02-06 09:28:40,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.959349593495935 [2025-02-06 09:28:40,509 INFO L175 Difference]: Start difference. First operand has 537 places, 539 transitions, 1305 flow. Second operand 3 states and 1652 transitions. [2025-02-06 09:28:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 544 transitions, 1356 flow [2025-02-06 09:28:40,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 544 transitions, 1344 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:40,515 INFO L231 Difference]: Finished difference. Result has 533 places, 539 transitions, 1303 flow [2025-02-06 09:28:40,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1289, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=535, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1303, PETRI_PLACES=533, PETRI_TRANSITIONS=539} [2025-02-06 09:28:40,515 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-02-06 09:28:40,515 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 539 transitions, 1303 flow [2025-02-06 09:28:40,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:40,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:40,516 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:40,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:28:40,516 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:40,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:40,517 INFO L85 PathProgramCache]: Analyzing trace with hash 730335133, now seen corresponding path program 1 times [2025-02-06 09:28:40,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:40,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457032789] [2025-02-06 09:28:40,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:40,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:40,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 09:28:40,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 09:28:40,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:40,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:40,595 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:40,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:40,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457032789] [2025-02-06 09:28:40,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457032789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:40,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:40,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:40,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465687147] [2025-02-06 09:28:40,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:40,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:40,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:40,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:40,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:40,610 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-02-06 09:28:40,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 539 transitions, 1303 flow. Second operand has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 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-02-06 09:28:40,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:40,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-02-06 09:28:40,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:41,387 INFO L124 PetriNetUnfolderBase]: 181/4377 cut-off events. [2025-02-06 09:28:41,387 INFO L125 PetriNetUnfolderBase]: For 75/238 co-relation queries the response was YES. [2025-02-06 09:28:41,475 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4905 conditions, 4377 events. 181/4377 cut-off events. For 75/238 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 33264 event pairs, 26 based on Foata normal form. 0/3856 useless extension candidates. Maximal degree in co-relation 4576. Up to 82 conditions per place. [2025-02-06 09:28:41,492 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 15 selfloop transitions, 5 changer transitions 0/541 dead transitions. [2025-02-06 09:28:41,493 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 532 places, 541 transitions, 1349 flow [2025-02-06 09:28:41,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:41,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1640 transitions. [2025-02-06 09:28:41,497 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9523809523809523 [2025-02-06 09:28:41,497 INFO L175 Difference]: Start difference. First operand has 533 places, 539 transitions, 1303 flow. Second operand 3 states and 1640 transitions. [2025-02-06 09:28:41,497 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 532 places, 541 transitions, 1349 flow [2025-02-06 09:28:41,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 532 places, 541 transitions, 1349 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:41,503 INFO L231 Difference]: Finished difference. Result has 534 places, 539 transitions, 1329 flow [2025-02-06 09:28:41,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1297, PETRI_DIFFERENCE_MINUEND_PLACES=530, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=536, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=531, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1329, PETRI_PLACES=534, PETRI_TRANSITIONS=539} [2025-02-06 09:28:41,504 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -1 predicate places. [2025-02-06 09:28:41,504 INFO L471 AbstractCegarLoop]: Abstraction has has 534 places, 539 transitions, 1329 flow [2025-02-06 09:28:41,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 540.6666666666666) internal successors, (1622), 3 states have internal predecessors, (1622), 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-02-06 09:28:41,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:41,504 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:41,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:28:41,504 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:41,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:41,505 INFO L85 PathProgramCache]: Analyzing trace with hash -912214923, now seen corresponding path program 1 times [2025-02-06 09:28:41,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:41,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236905576] [2025-02-06 09:28:41,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:41,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:41,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 307 statements into 1 equivalence classes. [2025-02-06 09:28:41,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 307 of 307 statements. [2025-02-06 09:28:41,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:41,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:41,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236905576] [2025-02-06 09:28:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236905576] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:41,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472505354] [2025-02-06 09:28:41,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:41,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:41,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:41,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:41,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:28:41,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 534 places, 539 transitions, 1329 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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-02-06 09:28:41,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:41,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:28:41,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:42,156 INFO L124 PetriNetUnfolderBase]: 270/3660 cut-off events. [2025-02-06 09:28:42,156 INFO L125 PetriNetUnfolderBase]: For 219/273 co-relation queries the response was YES. [2025-02-06 09:28:42,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4395 conditions, 3660 events. 270/3660 cut-off events. For 219/273 co-relation queries the response was YES. Maximal size of possible extension queue 105. Compared 29770 event pairs, 61 based on Foata normal form. 0/3168 useless extension candidates. Maximal degree in co-relation 4064. Up to 360 conditions per place. [2025-02-06 09:28:42,214 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 15 selfloop transitions, 2 changer transitions 0/540 dead transitions. [2025-02-06 09:28:42,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 535 places, 540 transitions, 1367 flow [2025-02-06 09:28:42,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:42,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:42,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-02-06 09:28:42,217 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-02-06 09:28:42,217 INFO L175 Difference]: Start difference. First operand has 534 places, 539 transitions, 1329 flow. Second operand 3 states and 1641 transitions. [2025-02-06 09:28:42,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 535 places, 540 transitions, 1367 flow [2025-02-06 09:28:42,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 540 transitions, 1357 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:42,224 INFO L231 Difference]: Finished difference. Result has 533 places, 538 transitions, 1321 flow [2025-02-06 09:28:42,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1317, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=536, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1321, PETRI_PLACES=533, PETRI_TRANSITIONS=538} [2025-02-06 09:28:42,225 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, -2 predicate places. [2025-02-06 09:28:42,225 INFO L471 AbstractCegarLoop]: Abstraction has has 533 places, 538 transitions, 1321 flow [2025-02-06 09:28:42,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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-02-06 09:28:42,225 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:42,225 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:42,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:28:42,226 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:42,226 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -859510833, now seen corresponding path program 1 times [2025-02-06 09:28:42,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:42,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152740586] [2025-02-06 09:28:42,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:42,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:42,245 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 310 statements into 1 equivalence classes. [2025-02-06 09:28:42,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 310 of 310 statements. [2025-02-06 09:28:42,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:42,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152740586] [2025-02-06 09:28:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152740586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:42,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:28:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661933287] [2025-02-06 09:28:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:42,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:28:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:42,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:28:42,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:28:42,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-02-06 09:28:42,363 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 533 places, 538 transitions, 1321 flow. Second operand has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 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-02-06 09:28:42,363 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:42,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-02-06 09:28:42,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:43,276 INFO L124 PetriNetUnfolderBase]: 197/4935 cut-off events. [2025-02-06 09:28:43,276 INFO L125 PetriNetUnfolderBase]: For 97/304 co-relation queries the response was YES. [2025-02-06 09:28:43,351 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5635 conditions, 4935 events. 197/4935 cut-off events. For 97/304 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 40067 event pairs, 45 based on Foata normal form. 4/4378 useless extension candidates. Maximal degree in co-relation 5304. Up to 105 conditions per place. [2025-02-06 09:28:43,368 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 25 selfloop transitions, 4 changer transitions 0/552 dead transitions. [2025-02-06 09:28:43,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 537 places, 552 transitions, 1415 flow [2025-02-06 09:28:43,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:43,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2745 transitions. [2025-02-06 09:28:43,371 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9564459930313589 [2025-02-06 09:28:43,371 INFO L175 Difference]: Start difference. First operand has 533 places, 538 transitions, 1321 flow. Second operand 5 states and 2745 transitions. [2025-02-06 09:28:43,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 537 places, 552 transitions, 1415 flow [2025-02-06 09:28:43,374 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 535 places, 552 transitions, 1411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:43,378 INFO L231 Difference]: Finished difference. Result has 538 places, 540 transitions, 1342 flow [2025-02-06 09:28:43,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1313, PETRI_DIFFERENCE_MINUEND_PLACES=531, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=537, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1342, PETRI_PLACES=538, PETRI_TRANSITIONS=540} [2025-02-06 09:28:43,379 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-02-06 09:28:43,379 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 540 transitions, 1342 flow [2025-02-06 09:28:43,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.5) internal successors, (2178), 4 states have internal predecessors, (2178), 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-02-06 09:28:43,380 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:43,380 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:43,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:28:43,380 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:43,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:43,381 INFO L85 PathProgramCache]: Analyzing trace with hash 250169363, now seen corresponding path program 1 times [2025-02-06 09:28:43,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:43,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784516868] [2025-02-06 09:28:43,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:43,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:43,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 09:28:43,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 09:28:43,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:43,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-06 09:28:43,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:43,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784516868] [2025-02-06 09:28:43,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784516868] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:43,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:43,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:43,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502353736] [2025-02-06 09:28:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:43,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:43,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:43,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:43,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:43,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:28:43,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 540 transitions, 1342 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:43,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:43,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:28:43,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:44,763 INFO L124 PetriNetUnfolderBase]: 293/6588 cut-off events. [2025-02-06 09:28:44,764 INFO L125 PetriNetUnfolderBase]: For 202/735 co-relation queries the response was YES. [2025-02-06 09:28:44,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7495 conditions, 6588 events. 293/6588 cut-off events. For 202/735 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 60712 event pairs, 86 based on Foata normal form. 7/5815 useless extension candidates. Maximal degree in co-relation 7162. Up to 213 conditions per place. [2025-02-06 09:28:44,875 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 17 selfloop transitions, 2 changer transitions 0/541 dead transitions. [2025-02-06 09:28:44,875 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 541 transitions, 1384 flow [2025-02-06 09:28:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:44,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1641 transitions. [2025-02-06 09:28:44,877 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9529616724738676 [2025-02-06 09:28:44,877 INFO L175 Difference]: Start difference. First operand has 538 places, 540 transitions, 1342 flow. Second operand 3 states and 1641 transitions. [2025-02-06 09:28:44,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 541 transitions, 1384 flow [2025-02-06 09:28:44,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 541 transitions, 1384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:44,883 INFO L231 Difference]: Finished difference. Result has 539 places, 539 transitions, 1344 flow [2025-02-06 09:28:44,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=537, 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=1344, PETRI_PLACES=539, PETRI_TRANSITIONS=539} [2025-02-06 09:28:44,884 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-02-06 09:28:44,884 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 539 transitions, 1344 flow [2025-02-06 09:28:44,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:28:44,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:44,885 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:44,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:28:44,885 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:44,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:44,886 INFO L85 PathProgramCache]: Analyzing trace with hash -1489624368, now seen corresponding path program 1 times [2025-02-06 09:28:44,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:44,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989675615] [2025-02-06 09:28:44,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:44,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:44,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 09:28:44,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 09:28:44,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:44,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 09:28:45,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:45,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989675615] [2025-02-06 09:28:45,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989675615] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:28:45,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629436621] [2025-02-06 09:28:45,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:45,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:45,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:28:45,113 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 09:28:45,119 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 09:28:45,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-02-06 09:28:45,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-02-06 09:28:45,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:45,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:45,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 09:28:45,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:28:45,518 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 09:28:45,522 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:28:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-06 09:28:45,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629436621] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:28:45,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:28:45,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-06 09:28:45,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385631453] [2025-02-06 09:28:45,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:28:45,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-06 09:28:45,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:45,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-06 09:28:45,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-02-06 09:28:46,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 515 out of 574 [2025-02-06 09:28:46,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 539 transitions, 1344 flow. Second operand has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 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-02-06 09:28:46,440 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:46,440 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 515 of 574 [2025-02-06 09:28:46,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:47,302 INFO L124 PetriNetUnfolderBase]: 58/2446 cut-off events. [2025-02-06 09:28:47,303 INFO L125 PetriNetUnfolderBase]: For 78/97 co-relation queries the response was YES. [2025-02-06 09:28:47,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2908 conditions, 2446 events. 58/2446 cut-off events. For 78/97 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14388 event pairs, 7 based on Foata normal form. 6/2225 useless extension candidates. Maximal degree in co-relation 2674. Up to 44 conditions per place. [2025-02-06 09:28:47,352 INFO L140 encePairwiseOnDemand]: 544/574 looper letters, 36 selfloop transitions, 57 changer transitions 0/569 dead transitions. [2025-02-06 09:28:47,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 555 places, 569 transitions, 1674 flow [2025-02-06 09:28:47,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-06 09:28:47,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-06 09:28:47,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 8854 transitions. [2025-02-06 09:28:47,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9073580651772905 [2025-02-06 09:28:47,363 INFO L175 Difference]: Start difference. First operand has 539 places, 539 transitions, 1344 flow. Second operand 17 states and 8854 transitions. [2025-02-06 09:28:47,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 555 places, 569 transitions, 1674 flow [2025-02-06 09:28:47,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 553 places, 569 transitions, 1670 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:47,379 INFO L231 Difference]: Finished difference. Result has 556 places, 560 transitions, 1616 flow [2025-02-06 09:28:47,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1340, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=539, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=494, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1616, PETRI_PLACES=556, PETRI_TRANSITIONS=560} [2025-02-06 09:28:47,380 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 21 predicate places. [2025-02-06 09:28:47,380 INFO L471 AbstractCegarLoop]: Abstraction has has 556 places, 560 transitions, 1616 flow [2025-02-06 09:28:47,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 518.1363636363636) internal successors, (11399), 22 states have internal predecessors, (11399), 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-02-06 09:28:47,386 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:47,387 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:47,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:28:47,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:28:47,587 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:47,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:47,589 INFO L85 PathProgramCache]: Analyzing trace with hash 555078672, now seen corresponding path program 2 times [2025-02-06 09:28:47,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:47,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964619093] [2025-02-06 09:28:47,589 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:28:47,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:47,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 402 statements into 2 equivalence classes. [2025-02-06 09:28:47,658 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 177 of 402 statements. [2025-02-06 09:28:47,658 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:28:47,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:47,949 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:47,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:47,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964619093] [2025-02-06 09:28:47,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964619093] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:47,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:47,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:47,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367086078] [2025-02-06 09:28:47,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:47,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:47,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:47,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:47,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:48,372 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-02-06 09:28:48,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 556 places, 560 transitions, 1616 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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-02-06 09:28:48,377 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:48,377 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-02-06 09:28:48,377 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:49,270 INFO L124 PetriNetUnfolderBase]: 153/3886 cut-off events. [2025-02-06 09:28:49,270 INFO L125 PetriNetUnfolderBase]: For 189/453 co-relation queries the response was YES. [2025-02-06 09:28:49,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4667 conditions, 3886 events. 153/3886 cut-off events. For 189/453 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27355 event pairs, 17 based on Foata normal form. 16/3506 useless extension candidates. Maximal degree in co-relation 4426. Up to 139 conditions per place. [2025-02-06 09:28:49,312 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 30 selfloop transitions, 6 changer transitions 0/567 dead transitions. [2025-02-06 09:28:49,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 560 places, 567 transitions, 1710 flow [2025-02-06 09:28:49,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:49,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:49,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3210 transitions. [2025-02-06 09:28:49,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320557491289199 [2025-02-06 09:28:49,314 INFO L175 Difference]: Start difference. First operand has 556 places, 560 transitions, 1616 flow. Second operand 6 states and 3210 transitions. [2025-02-06 09:28:49,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 560 places, 567 transitions, 1710 flow [2025-02-06 09:28:49,318 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 552 places, 567 transitions, 1632 flow, removed 12 selfloop flow, removed 8 redundant places. [2025-02-06 09:28:49,321 INFO L231 Difference]: Finished difference. Result has 552 places, 559 transitions, 1548 flow [2025-02-06 09:28:49,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1536, PETRI_DIFFERENCE_MINUEND_PLACES=547, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=553, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1548, PETRI_PLACES=552, PETRI_TRANSITIONS=559} [2025-02-06 09:28:49,322 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 17 predicate places. [2025-02-06 09:28:49,322 INFO L471 AbstractCegarLoop]: Abstraction has has 552 places, 559 transitions, 1548 flow [2025-02-06 09:28:49,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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-02-06 09:28:49,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:49,323 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:49,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:28:49,323 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:49,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 672370875, now seen corresponding path program 1 times [2025-02-06 09:28:49,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:49,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315349263] [2025-02-06 09:28:49,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:49,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:49,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 403 statements into 1 equivalence classes. [2025-02-06 09:28:49,363 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 403 of 403 statements. [2025-02-06 09:28:49,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:49,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:49,411 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:49,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:49,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315349263] [2025-02-06 09:28:49,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315349263] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:49,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:49,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:49,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632375053] [2025-02-06 09:28:49,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:49,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:49,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:49,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:49,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:49,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 539 out of 574 [2025-02-06 09:28:49,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 552 places, 559 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 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-02-06 09:28:49,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:49,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 539 of 574 [2025-02-06 09:28:49,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:50,609 INFO L124 PetriNetUnfolderBase]: 344/6028 cut-off events. [2025-02-06 09:28:50,610 INFO L125 PetriNetUnfolderBase]: For 319/360 co-relation queries the response was YES. [2025-02-06 09:28:50,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7073 conditions, 6028 events. 344/6028 cut-off events. For 319/360 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 54383 event pairs, 84 based on Foata normal form. 24/5339 useless extension candidates. Maximal degree in co-relation 6560. Up to 316 conditions per place. [2025-02-06 09:28:50,724 INFO L140 encePairwiseOnDemand]: 566/574 looper letters, 13 selfloop transitions, 4 changer transitions 12/561 dead transitions. [2025-02-06 09:28:50,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 551 places, 561 transitions, 1592 flow [2025-02-06 09:28:50,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:50,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:50,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-02-06 09:28:50,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-02-06 09:28:50,726 INFO L175 Difference]: Start difference. First operand has 552 places, 559 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-02-06 09:28:50,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 551 places, 561 transitions, 1592 flow [2025-02-06 09:28:50,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 546 places, 561 transitions, 1580 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:50,734 INFO L231 Difference]: Finished difference. Result has 548 places, 547 transitions, 1529 flow [2025-02-06 09:28:50,734 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1530, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=556, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=548, PETRI_TRANSITIONS=547} [2025-02-06 09:28:50,735 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 13 predicate places. [2025-02-06 09:28:50,735 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 547 transitions, 1529 flow [2025-02-06 09:28:50,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 541.0) internal successors, (1623), 3 states have internal predecessors, (1623), 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-02-06 09:28:50,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:50,739 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:50,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:28:50,739 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 659115794, now seen corresponding path program 1 times [2025-02-06 09:28:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525075072] [2025-02-06 09:28:50,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:50,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:50,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-06 09:28:50,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-06 09:28:50,834 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:50,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 466 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 466 trivial. 0 not checked. [2025-02-06 09:28:51,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:51,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525075072] [2025-02-06 09:28:51,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1525075072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:51,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:51,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:28:51,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85308199] [2025-02-06 09:28:51,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:51,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:28:51,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:51,387 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:28:51,387 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:28:51,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-02-06 09:28:51,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 548 places, 547 transitions, 1529 flow. Second operand has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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-02-06 09:28:51,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:51,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-02-06 09:28:51,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:52,787 INFO L124 PetriNetUnfolderBase]: 160/4421 cut-off events. [2025-02-06 09:28:52,788 INFO L125 PetriNetUnfolderBase]: For 223/260 co-relation queries the response was YES. [2025-02-06 09:28:52,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5458 conditions, 4421 events. 160/4421 cut-off events. For 223/260 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 32713 event pairs, 22 based on Foata normal form. 8/4058 useless extension candidates. Maximal degree in co-relation 5392. Up to 126 conditions per place. [2025-02-06 09:28:52,840 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-02-06 09:28:52,840 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 541 places, 554 transitions, 1621 flow [2025-02-06 09:28:52,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:28:52,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:28:52,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-02-06 09:28:52,842 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-02-06 09:28:52,843 INFO L175 Difference]: Start difference. First operand has 548 places, 547 transitions, 1529 flow. Second operand 6 states and 3209 transitions. [2025-02-06 09:28:52,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 541 places, 554 transitions, 1621 flow [2025-02-06 09:28:52,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 554 transitions, 1613 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:52,849 INFO L231 Difference]: Finished difference. Result has 539 places, 546 transitions, 1531 flow [2025-02-06 09:28:52,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1519, PETRI_DIFFERENCE_MINUEND_PLACES=534, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1531, PETRI_PLACES=539, PETRI_TRANSITIONS=546} [2025-02-06 09:28:52,850 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-02-06 09:28:52,850 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 546 transitions, 1531 flow [2025-02-06 09:28:52,851 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.5) internal successors, (3195), 6 states have internal predecessors, (3195), 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-02-06 09:28:52,851 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:52,851 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:52,852 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-06 09:28:52,852 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:52,853 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:52,853 INFO L85 PathProgramCache]: Analyzing trace with hash 854699762, now seen corresponding path program 1 times [2025-02-06 09:28:52,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:52,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971764188] [2025-02-06 09:28:52,853 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:52,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:52,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 404 statements into 1 equivalence classes. [2025-02-06 09:28:52,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 404 of 404 statements. [2025-02-06 09:28:52,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:52,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:52,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:52,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971764188] [2025-02-06 09:28:52,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971764188] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:52,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:52,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:52,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140174220] [2025-02-06 09:28:52,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:52,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:52,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:52,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:52,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:52,954 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 544 out of 574 [2025-02-06 09:28:52,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 546 transitions, 1531 flow. Second operand has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:52,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:52,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 544 of 574 [2025-02-06 09:28:52,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:55,111 INFO L124 PetriNetUnfolderBase]: 480/10385 cut-off events. [2025-02-06 09:28:55,111 INFO L125 PetriNetUnfolderBase]: For 298/315 co-relation queries the response was YES. [2025-02-06 09:28:55,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12050 conditions, 10385 events. 480/10385 cut-off events. For 298/315 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 106869 event pairs, 141 based on Foata normal form. 1/9408 useless extension candidates. Maximal degree in co-relation 11536. Up to 573 conditions per place. [2025-02-06 09:28:55,284 INFO L140 encePairwiseOnDemand]: 570/574 looper letters, 13 selfloop transitions, 2 changer transitions 0/549 dead transitions. [2025-02-06 09:28:55,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 549 transitions, 1570 flow [2025-02-06 09:28:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:55,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:55,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1649 transitions. [2025-02-06 09:28:55,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9576074332171893 [2025-02-06 09:28:55,293 INFO L175 Difference]: Start difference. First operand has 539 places, 546 transitions, 1531 flow. Second operand 3 states and 1649 transitions. [2025-02-06 09:28:55,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 549 transitions, 1570 flow [2025-02-06 09:28:55,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 549 transitions, 1558 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:28:55,312 INFO L231 Difference]: Finished difference. Result has 535 places, 546 transitions, 1529 flow [2025-02-06 09:28:55,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1515, PETRI_DIFFERENCE_MINUEND_PLACES=532, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=542, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1529, PETRI_PLACES=535, PETRI_TRANSITIONS=546} [2025-02-06 09:28:55,313 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 0 predicate places. [2025-02-06 09:28:55,313 INFO L471 AbstractCegarLoop]: Abstraction has has 535 places, 546 transitions, 1529 flow [2025-02-06 09:28:55,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 545.6666666666666) internal successors, (1637), 3 states have internal predecessors, (1637), 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-02-06 09:28:55,315 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:55,315 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:55,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-02-06 09:28:55,319 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:55,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:55,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1095765640, now seen corresponding path program 1 times [2025-02-06 09:28:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:55,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403556738] [2025-02-06 09:28:55,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:55,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 406 statements into 1 equivalence classes. [2025-02-06 09:28:55,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 406 of 406 statements. [2025-02-06 09:28:55,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:55,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:55,566 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:55,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:55,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403556738] [2025-02-06 09:28:55,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403556738] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:55,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:55,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:28:55,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409730737] [2025-02-06 09:28:55,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:55,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:28:55,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:55,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:28:55,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:28:55,616 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 543 out of 574 [2025-02-06 09:28:55,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 535 places, 546 transitions, 1529 flow. Second operand has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 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-02-06 09:28:55,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:55,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 543 of 574 [2025-02-06 09:28:55,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:57,795 INFO L124 PetriNetUnfolderBase]: 464/8938 cut-off events. [2025-02-06 09:28:57,796 INFO L125 PetriNetUnfolderBase]: For 450/487 co-relation queries the response was YES. [2025-02-06 09:28:57,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10867 conditions, 8938 events. 464/8938 cut-off events. For 450/487 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 94779 event pairs, 188 based on Foata normal form. 0/7998 useless extension candidates. Maximal degree in co-relation 10353. Up to 519 conditions per place. [2025-02-06 09:28:57,987 INFO L140 encePairwiseOnDemand]: 569/574 looper letters, 20 selfloop transitions, 4 changer transitions 0/556 dead transitions. [2025-02-06 09:28:57,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 556 transitions, 1601 flow [2025-02-06 09:28:57,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:28:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:28:57,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 2740 transitions. [2025-02-06 09:28:57,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9547038327526133 [2025-02-06 09:28:57,994 INFO L175 Difference]: Start difference. First operand has 535 places, 546 transitions, 1529 flow. Second operand 5 states and 2740 transitions. [2025-02-06 09:28:57,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 556 transitions, 1601 flow [2025-02-06 09:28:58,002 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 556 transitions, 1601 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:28:58,009 INFO L231 Difference]: Finished difference. Result has 542 places, 548 transitions, 1554 flow [2025-02-06 09:28:58,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1525, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1554, PETRI_PLACES=542, PETRI_TRANSITIONS=548} [2025-02-06 09:28:58,014 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 7 predicate places. [2025-02-06 09:28:58,014 INFO L471 AbstractCegarLoop]: Abstraction has has 542 places, 548 transitions, 1554 flow [2025-02-06 09:28:58,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 544.75) internal successors, (2179), 4 states have internal predecessors, (2179), 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-02-06 09:28:58,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:58,015 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:28:58,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-02-06 09:28:58,015 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:28:58,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:58,020 INFO L85 PathProgramCache]: Analyzing trace with hash 842569820, now seen corresponding path program 1 times [2025-02-06 09:28:58,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:58,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402878409] [2025-02-06 09:28:58,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:58,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:58,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 09:28:58,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 09:28:58,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:58,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:58,183 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:28:58,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:58,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402878409] [2025-02-06 09:28:58,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402878409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:58,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:58,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:58,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481977512] [2025-02-06 09:28:58,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:58,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:58,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:58,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:58,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:28:58,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 542 places, 548 transitions, 1554 flow. Second operand has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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-02-06 09:28:58,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:58,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:28:58,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:00,387 INFO L124 PetriNetUnfolderBase]: 676/8832 cut-off events. [2025-02-06 09:29:00,387 INFO L125 PetriNetUnfolderBase]: For 998/1039 co-relation queries the response was YES. [2025-02-06 09:29:00,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11676 conditions, 8832 events. 676/8832 cut-off events. For 998/1039 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 95263 event pairs, 366 based on Foata normal form. 0/8004 useless extension candidates. Maximal degree in co-relation 11159. Up to 936 conditions per place. [2025-02-06 09:29:00,570 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 2 changer transitions 1/549 dead transitions. [2025-02-06 09:29:00,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 549 transitions, 1592 flow [2025-02-06 09:29:00,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:00,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-02-06 09:29:00,572 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-02-06 09:29:00,572 INFO L175 Difference]: Start difference. First operand has 542 places, 548 transitions, 1554 flow. Second operand 3 states and 1639 transitions. [2025-02-06 09:29:00,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 549 transitions, 1592 flow [2025-02-06 09:29:00,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 549 transitions, 1592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:29:00,580 INFO L231 Difference]: Finished difference. Result has 543 places, 547 transitions, 1556 flow [2025-02-06 09:29:00,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1552, PETRI_DIFFERENCE_MINUEND_PLACES=541, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=547, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1556, PETRI_PLACES=543, PETRI_TRANSITIONS=547} [2025-02-06 09:29:00,582 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 8 predicate places. [2025-02-06 09:29:00,582 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 547 transitions, 1556 flow [2025-02-06 09:29:00,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.6666666666666) internal successors, (1631), 3 states have internal predecessors, (1631), 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-02-06 09:29:00,582 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:00,582 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:00,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-02-06 09:29:00,583 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:29:00,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:00,584 INFO L85 PathProgramCache]: Analyzing trace with hash -897223911, now seen corresponding path program 1 times [2025-02-06 09:29:00,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:00,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32712616] [2025-02-06 09:29:00,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:00,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:00,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 408 statements into 1 equivalence classes. [2025-02-06 09:29:00,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 408 of 408 statements. [2025-02-06 09:29:00,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:00,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:01,195 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:29:01,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:01,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32712616] [2025-02-06 09:29:01,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32712616] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:01,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:01,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:29:01,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208411644] [2025-02-06 09:29:01,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:01,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:29:01,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:01,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:29:01,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:29:01,467 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-02-06 09:29:01,468 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 547 transitions, 1556 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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-02-06 09:29:01,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:01,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-02-06 09:29:01,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:03,441 INFO L124 PetriNetUnfolderBase]: 462/8577 cut-off events. [2025-02-06 09:29:03,441 INFO L125 PetriNetUnfolderBase]: For 816/867 co-relation queries the response was YES. [2025-02-06 09:29:03,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11228 conditions, 8577 events. 462/8577 cut-off events. For 816/867 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 89168 event pairs, 78 based on Foata normal form. 0/7980 useless extension candidates. Maximal degree in co-relation 10648. Up to 282 conditions per place. [2025-02-06 09:29:03,523 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/554 dead transitions. [2025-02-06 09:29:03,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 547 places, 554 transitions, 1648 flow [2025-02-06 09:29:03,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:29:03,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:29:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-02-06 09:29:03,525 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-02-06 09:29:03,525 INFO L175 Difference]: Start difference. First operand has 543 places, 547 transitions, 1556 flow. Second operand 6 states and 3209 transitions. [2025-02-06 09:29:03,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 547 places, 554 transitions, 1648 flow [2025-02-06 09:29:03,532 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 545 places, 554 transitions, 1644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:03,535 INFO L231 Difference]: Finished difference. Result has 545 places, 546 transitions, 1562 flow [2025-02-06 09:29:03,535 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1550, PETRI_DIFFERENCE_MINUEND_PLACES=540, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=546, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1562, PETRI_PLACES=545, PETRI_TRANSITIONS=546} [2025-02-06 09:29:03,536 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 10 predicate places. [2025-02-06 09:29:03,536 INFO L471 AbstractCegarLoop]: Abstraction has has 545 places, 546 transitions, 1562 flow [2025-02-06 09:29:03,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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-02-06 09:29:03,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:03,537 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:03,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-02-06 09:29:03,537 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:29:03,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1037665291, now seen corresponding path program 1 times [2025-02-06 09:29:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:03,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858027641] [2025-02-06 09:29:03,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:03,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 410 statements into 1 equivalence classes. [2025-02-06 09:29:03,588 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 410 of 410 statements. [2025-02-06 09:29:03,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:03,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:04,144 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:29:04,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:04,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858027641] [2025-02-06 09:29:04,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858027641] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:04,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:04,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:29:04,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713472906] [2025-02-06 09:29:04,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:04,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:29:04,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:04,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:29:04,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:29:04,410 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-02-06 09:29:04,411 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 545 places, 546 transitions, 1562 flow. Second operand has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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-02-06 09:29:04,411 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:04,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-02-06 09:29:04,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:05,988 INFO L124 PetriNetUnfolderBase]: 216/6466 cut-off events. [2025-02-06 09:29:05,988 INFO L125 PetriNetUnfolderBase]: For 361/443 co-relation queries the response was YES. [2025-02-06 09:29:06,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8195 conditions, 6466 events. 216/6466 cut-off events. For 361/443 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 55473 event pairs, 39 based on Foata normal form. 2/6077 useless extension candidates. Maximal degree in co-relation 8009. Up to 152 conditions per place. [2025-02-06 09:29:06,143 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/553 dead transitions. [2025-02-06 09:29:06,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 549 places, 553 transitions, 1654 flow [2025-02-06 09:29:06,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:29:06,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:29:06,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-02-06 09:29:06,145 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-02-06 09:29:06,145 INFO L175 Difference]: Start difference. First operand has 545 places, 546 transitions, 1562 flow. Second operand 6 states and 3209 transitions. [2025-02-06 09:29:06,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 549 places, 553 transitions, 1654 flow [2025-02-06 09:29:06,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 544 places, 553 transitions, 1642 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:29:06,154 INFO L231 Difference]: Finished difference. Result has 544 places, 545 transitions, 1560 flow [2025-02-06 09:29:06,154 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1548, PETRI_DIFFERENCE_MINUEND_PLACES=539, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1560, PETRI_PLACES=544, PETRI_TRANSITIONS=545} [2025-02-06 09:29:06,155 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 9 predicate places. [2025-02-06 09:29:06,155 INFO L471 AbstractCegarLoop]: Abstraction has has 544 places, 545 transitions, 1560 flow [2025-02-06 09:29:06,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.6666666666666) internal successors, (3196), 6 states have internal predecessors, (3196), 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-02-06 09:29:06,155 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:06,155 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:06,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-02-06 09:29:06,156 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:29:06,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash 231269758, now seen corresponding path program 1 times [2025-02-06 09:29:06,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:06,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534210693] [2025-02-06 09:29:06,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:06,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:06,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 416 statements into 1 equivalence classes. [2025-02-06 09:29:06,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 416 of 416 statements. [2025-02-06 09:29:06,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:06,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:06,760 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:29:06,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:06,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534210693] [2025-02-06 09:29:06,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534210693] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:06,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:06,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:29:06,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909231542] [2025-02-06 09:29:06,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:06,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:29:06,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:06,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:29:06,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:29:07,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 529 out of 574 [2025-02-06 09:29:07,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 544 places, 545 transitions, 1560 flow. Second operand has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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-02-06 09:29:07,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:07,023 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 529 of 574 [2025-02-06 09:29:07,023 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:09,003 INFO L124 PetriNetUnfolderBase]: 512/8653 cut-off events. [2025-02-06 09:29:09,004 INFO L125 PetriNetUnfolderBase]: For 775/816 co-relation queries the response was YES. [2025-02-06 09:29:09,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11257 conditions, 8653 events. 512/8653 cut-off events. For 775/816 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 90452 event pairs, 76 based on Foata normal form. 8/8123 useless extension candidates. Maximal degree in co-relation 10678. Up to 320 conditions per place. [2025-02-06 09:29:09,145 INFO L140 encePairwiseOnDemand]: 568/574 looper letters, 29 selfloop transitions, 6 changer transitions 0/552 dead transitions. [2025-02-06 09:29:09,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 548 places, 552 transitions, 1652 flow [2025-02-06 09:29:09,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:29:09,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:29:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 3209 transitions. [2025-02-06 09:29:09,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9317653890824622 [2025-02-06 09:29:09,147 INFO L175 Difference]: Start difference. First operand has 544 places, 545 transitions, 1560 flow. Second operand 6 states and 3209 transitions. [2025-02-06 09:29:09,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 548 places, 552 transitions, 1652 flow [2025-02-06 09:29:09,152 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 552 transitions, 1640 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:29:09,155 INFO L231 Difference]: Finished difference. Result has 543 places, 544 transitions, 1558 flow [2025-02-06 09:29:09,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1546, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=544, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=538, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1558, PETRI_PLACES=543, PETRI_TRANSITIONS=544} [2025-02-06 09:29:09,156 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 8 predicate places. [2025-02-06 09:29:09,156 INFO L471 AbstractCegarLoop]: Abstraction has has 543 places, 544 transitions, 1558 flow [2025-02-06 09:29:09,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 532.8333333333334) internal successors, (3197), 6 states have internal predecessors, (3197), 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-02-06 09:29:09,156 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:09,157 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:09,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-02-06 09:29:09,157 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:29:09,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:09,158 INFO L85 PathProgramCache]: Analyzing trace with hash -216629663, now seen corresponding path program 1 times [2025-02-06 09:29:09,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:09,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027548806] [2025-02-06 09:29:09,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:09,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:09,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-06 09:29:09,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-06 09:29:09,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:09,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:09,247 INFO L134 CoverageAnalysis]: Checked inductivity of 471 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 471 trivial. 0 not checked. [2025-02-06 09:29:09,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:09,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027548806] [2025-02-06 09:29:09,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027548806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:09,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:09,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:09,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888303983] [2025-02-06 09:29:09,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:09,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:09,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:09,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:09,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:09,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:29:09,269 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 543 places, 544 transitions, 1558 flow. Second operand has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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-02-06 09:29:09,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:09,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:29:09,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:10,789 INFO L124 PetriNetUnfolderBase]: 226/7968 cut-off events. [2025-02-06 09:29:10,789 INFO L125 PetriNetUnfolderBase]: For 376/602 co-relation queries the response was YES. [2025-02-06 09:29:10,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10222 conditions, 7968 events. 226/7968 cut-off events. For 376/602 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 73656 event pairs, 84 based on Foata normal form. 10/7639 useless extension candidates. Maximal degree in co-relation 10060. Up to 301 conditions per place. [2025-02-06 09:29:10,945 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/545 dead transitions. [2025-02-06 09:29:10,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 544 places, 545 transitions, 1596 flow [2025-02-06 09:29:10,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:10,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:10,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-02-06 09:29:10,947 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-02-06 09:29:10,947 INFO L175 Difference]: Start difference. First operand has 543 places, 544 transitions, 1558 flow. Second operand 3 states and 1639 transitions. [2025-02-06 09:29:10,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 544 places, 545 transitions, 1596 flow [2025-02-06 09:29:10,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 539 places, 545 transitions, 1584 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:29:10,955 INFO L231 Difference]: Finished difference. Result has 539 places, 543 transitions, 1550 flow [2025-02-06 09:29:10,956 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1544, PETRI_DIFFERENCE_MINUEND_PLACES=537, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=543, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=540, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1550, PETRI_PLACES=539, PETRI_TRANSITIONS=543} [2025-02-06 09:29:10,956 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 4 predicate places. [2025-02-06 09:29:10,956 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 543 transitions, 1550 flow [2025-02-06 09:29:10,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 542.6666666666666) internal successors, (1628), 3 states have internal predecessors, (1628), 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-02-06 09:29:10,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:10,957 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:10,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-02-06 09:29:10,957 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:29:10,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:10,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1689183004, now seen corresponding path program 1 times [2025-02-06 09:29:10,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:10,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441405999] [2025-02-06 09:29:10,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:10,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:10,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 436 statements into 1 equivalence classes. [2025-02-06 09:29:10,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 436 of 436 statements. [2025-02-06 09:29:10,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:10,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:11,044 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2025-02-06 09:29:11,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:11,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441405999] [2025-02-06 09:29:11,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441405999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:11,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:11,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053952230] [2025-02-06 09:29:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:11,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:11,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:11,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:11,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:29:11,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 543 transitions, 1550 flow. Second operand has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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-02-06 09:29:11,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:11,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:29:11,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:12,783 INFO L124 PetriNetUnfolderBase]: 325/8405 cut-off events. [2025-02-06 09:29:12,783 INFO L125 PetriNetUnfolderBase]: For 458/595 co-relation queries the response was YES. [2025-02-06 09:29:12,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10474 conditions, 8405 events. 325/8405 cut-off events. For 458/595 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 80319 event pairs, 166 based on Foata normal form. 0/7984 useless extension candidates. Maximal degree in co-relation 9956. Up to 367 conditions per place. [2025-02-06 09:29:12,954 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 14 selfloop transitions, 3 changer transitions 0/544 dead transitions. [2025-02-06 09:29:12,955 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 540 places, 544 transitions, 1588 flow [2025-02-06 09:29:12,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:12,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:12,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-02-06 09:29:12,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-02-06 09:29:12,956 INFO L175 Difference]: Start difference. First operand has 539 places, 543 transitions, 1550 flow. Second operand 3 states and 1639 transitions. [2025-02-06 09:29:12,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 540 places, 544 transitions, 1588 flow [2025-02-06 09:29:12,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 538 places, 544 transitions, 1582 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:12,964 INFO L231 Difference]: Finished difference. Result has 538 places, 542 transitions, 1548 flow [2025-02-06 09:29:12,964 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=536, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=542, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1548, PETRI_PLACES=538, PETRI_TRANSITIONS=542} [2025-02-06 09:29:12,964 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 3 predicate places. [2025-02-06 09:29:12,964 INFO L471 AbstractCegarLoop]: Abstraction has has 538 places, 542 transitions, 1548 flow [2025-02-06 09:29:12,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.0) internal successors, (1629), 3 states have internal predecessors, (1629), 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-02-06 09:29:12,965 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:12,965 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:12,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-02-06 09:29:12,965 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 77 more)] === [2025-02-06 09:29:12,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:12,966 INFO L85 PathProgramCache]: Analyzing trace with hash 42914957, now seen corresponding path program 1 times [2025-02-06 09:29:12,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:12,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112444145] [2025-02-06 09:29:12,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:12,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:12,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 09:29:12,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 09:29:12,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:12,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:13,052 INFO L134 CoverageAnalysis]: Checked inductivity of 465 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2025-02-06 09:29:13,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:13,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112444145] [2025-02-06 09:29:13,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112444145] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:13,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:13,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:13,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229496159] [2025-02-06 09:29:13,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:13,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:13,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:13,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:13,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:13,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 541 out of 574 [2025-02-06 09:29:13,084 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 538 places, 542 transitions, 1548 flow. Second operand has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:29:13,085 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:13,085 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 541 of 574 [2025-02-06 09:29:13,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:14,843 INFO L124 PetriNetUnfolderBase]: 620/8668 cut-off events. [2025-02-06 09:29:14,843 INFO L125 PetriNetUnfolderBase]: For 886/915 co-relation queries the response was YES. [2025-02-06 09:29:14,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11419 conditions, 8668 events. 620/8668 cut-off events. For 886/915 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 93431 event pairs, 344 based on Foata normal form. 0/8155 useless extension candidates. Maximal degree in co-relation 10901. Up to 890 conditions per place. [2025-02-06 09:29:14,964 INFO L140 encePairwiseOnDemand]: 571/574 looper letters, 0 selfloop transitions, 0 changer transitions 543/543 dead transitions. [2025-02-06 09:29:14,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 539 places, 543 transitions, 1586 flow [2025-02-06 09:29:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:14,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:14,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1639 transitions. [2025-02-06 09:29:14,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9518002322880371 [2025-02-06 09:29:14,966 INFO L175 Difference]: Start difference. First operand has 538 places, 542 transitions, 1548 flow. Second operand 3 states and 1639 transitions. [2025-02-06 09:29:14,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 539 places, 543 transitions, 1586 flow [2025-02-06 09:29:14,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 537 places, 543 transitions, 1580 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:14,972 INFO L231 Difference]: Finished difference. Result has 537 places, 0 transitions, 0 flow [2025-02-06 09:29:14,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=574, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=535, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=541, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=541, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=537, PETRI_TRANSITIONS=0} [2025-02-06 09:29:14,973 INFO L279 CegarLoopForPetriNet]: 535 programPoint places, 2 predicate places. [2025-02-06 09:29:14,973 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 0 transitions, 0 flow [2025-02-06 09:29:14,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 543.3333333333334) internal successors, (1630), 3 states have internal predecessors, (1630), 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-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (80 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (79 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (78 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (77 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (76 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (74 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (73 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (72 of 81 remaining) [2025-02-06 09:29:14,977 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (71 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (70 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (69 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (68 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (67 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (66 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (65 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (64 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (63 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (62 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (61 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (60 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (59 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (58 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (57 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (56 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (55 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (54 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (53 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (52 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (51 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (50 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (49 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (48 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (47 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (46 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (45 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (44 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (43 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (42 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (41 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (38 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (37 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (36 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (35 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (34 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (33 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (32 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (31 of 81 remaining) [2025-02-06 09:29:14,978 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (30 of 81 remaining) [2025-02-06 09:29:14,979 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (29 of 81 remaining) [2025-02-06 09:29:14,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (28 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (26 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (25 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (24 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (23 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (22 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (21 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (20 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (19 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (18 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (15 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (14 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (13 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (12 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (10 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (9 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (8 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (7 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (6 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (5 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (4 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (3 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (2 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (1 of 81 remaining) [2025-02-06 09:29:14,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (0 of 81 remaining) [2025-02-06 09:29:14,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-02-06 09:29:14,985 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 09:29:14,994 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:29:14,994 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:29:15,006 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:29:15 BasicIcfg [2025-02-06 09:29:15,006 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:29:15,007 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:29:15,008 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:29:15,009 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:29:15,015 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:28:27" (3/4) ... [2025-02-06 09:29:15,016 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:29:15,020 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:29:15,020 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:29:15,020 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:29:15,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 26 nodes and edges [2025-02-06 09:29:15,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:29:15,035 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:29:15,036 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:29:15,113 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:29:15,114 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:29:15,115 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:29:15,116 INFO L158 Benchmark]: Toolchain (without parser) took 48457.29ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 108.9MB in the beginning and 970.9MB in the end (delta: -862.0MB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2025-02-06 09:29:15,117 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:29:15,117 INFO L158 Benchmark]: CACSL2BoogieTranslator took 235.47ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 96.4MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:29:15,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.00ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:29:15,118 INFO L158 Benchmark]: Boogie Preprocessor took 60.58ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:29:15,119 INFO L158 Benchmark]: IcfgBuilder took 714.02ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 49.6MB in the end (delta: 40.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-06 09:29:15,119 INFO L158 Benchmark]: TraceAbstraction took 47278.73ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 49.6MB in the beginning and 979.3MB in the end (delta: -929.6MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2025-02-06 09:29:15,119 INFO L158 Benchmark]: Witness Printer took 108.32ms. Allocated memory is still 2.0GB. Free memory was 979.3MB in the beginning and 970.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:29:15,120 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 226.5MB. Free memory is still 147.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 235.47ms. Allocated memory is still 142.6MB. Free memory was 108.9MB in the beginning and 96.4MB in the end (delta: 12.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.00ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.7MB in the end (delta: 3.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 60.58ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 90.3MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 714.02ms. Allocated memory is still 142.6MB. Free memory was 90.3MB in the beginning and 49.6MB in the end (delta: 40.7MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 47278.73ms. Allocated memory was 142.6MB in the beginning and 2.0GB in the end (delta: 1.9GB). Free memory was 49.6MB in the beginning and 979.3MB in the end (delta: -929.6MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. * Witness Printer took 108.32ms. Allocated memory is still 2.0GB. Free memory was 979.3MB in the beginning and 970.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: 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: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 54]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 68]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 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: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 120]: 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: 120]: 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: 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: 97]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 98]: 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, 848 locations, 81 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: 47.1s, OverallIterations: 37, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 38.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3975 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2609 mSDsluCounter, 1588 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1335 mSDsCounter, 725 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7061 IncrementalHoareTripleChecker+Invalid, 7786 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 725 mSolverCounterUnsat, 253 mSDtfsCounter, 7061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1204 GetRequests, 1078 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1616occurred in iteration=25, InterpolantAutomatonStates: 162, 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.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 10233 NumberOfCodeBlocks, 9873 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 10720 ConstructedInterpolants, 0 QuantifiedInterpolants, 12782 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1184 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 41 InterpolantComputations, 35 PerfectInterpolantSequences, 6751/6898 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 45 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:29:15,143 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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