./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x6.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/bench-exp2x6.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 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:27:52,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:52,248 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:27:52,253 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:52,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:27:52,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:27:52,292 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:27:52,293 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:27:52,293 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:27:52,293 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:27:52,294 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:27:52,294 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:27:52,294 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:27:52,294 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:27:52,295 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:27:52,299 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:27:52,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:27:52,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:27:52,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:27:52,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:27:52,299 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:27:52,299 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:27:52,300 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:27:52,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:52,301 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:27:52,301 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:27:52,301 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 -> 1f93f8af6c620ba8dc44e82cf4c30bbca874545f3e3802e43ba4e1345a3afed4 [2025-02-06 09:27:52,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:27:52,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:27:52,688 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:27:52,693 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:27:52,693 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:27:52,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-02-06 09:27:53,850 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4212eea1a/5f6e2cf7ba5f4d14941dd428d83b1446/FLAGa6db2a36e [2025-02-06 09:27:54,119 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:27:54,124 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x6.wvr.c [2025-02-06 09:27:54,153 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4212eea1a/5f6e2cf7ba5f4d14941dd428d83b1446/FLAGa6db2a36e [2025-02-06 09:27:54,440 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4212eea1a/5f6e2cf7ba5f4d14941dd428d83b1446 [2025-02-06 09:27:54,445 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:27:54,446 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:27:54,448 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:54,448 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:27:54,452 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:27:54,453 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,455 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2647dfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54, skipping insertion in model container [2025-02-06 09:27:54,455 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,469 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:27:54,617 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:54,627 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:27:54,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:54,662 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:27:54,663 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54 WrapperNode [2025-02-06 09:27:54,663 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:54,664 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:54,664 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:27:54,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:27:54,669 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:27:54" (1/1) ... [2025-02-06 09:27:54,677 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:27:54" (1/1) ... [2025-02-06 09:27:54,689 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-02-06 09:27:54,689 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:54,689 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:27:54,690 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:27:54,690 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:27:54,694 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,696 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,697 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,701 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,702 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,703 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,703 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,704 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:27:54,705 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:27:54,705 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:27:54,705 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:27:54,706 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (1/1) ... [2025-02-06 09:27:54,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:54,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:54,738 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:27:54,746 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:27:54,762 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:27:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:27:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:27:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:27:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:27:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:27:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:27:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 09:27:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 09:27:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:27:54,763 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:27:54,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:27:54,768 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:27:54,864 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:27:54,866 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:27:55,185 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:27:55,185 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:27:55,198 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:27:55,199 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:27:55,199 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:55 BoogieIcfgContainer [2025-02-06 09:27:55,199 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:27:55,201 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:27:55,201 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:27:55,204 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:27:55,204 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:27:54" (1/3) ... [2025-02-06 09:27:55,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a241f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:55, skipping insertion in model container [2025-02-06 09:27:55,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:54" (2/3) ... [2025-02-06 09:27:55,205 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a241f7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:55, skipping insertion in model container [2025-02-06 09:27:55,205 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:55" (3/3) ... [2025-02-06 09:27:55,206 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x6.wvr.c [2025-02-06 09:27:55,216 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:27:55,217 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x6.wvr.c that has 5 procedures, 390 locations, 1 initial locations, 4 loop locations, and 71 error locations. [2025-02-06 09:27:55,217 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:27:55,308 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:27:55,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 402 places, 403 transitions, 834 flow [2025-02-06 09:27:55,471 INFO L124 PetriNetUnfolderBase]: 14/399 cut-off events. [2025-02-06 09:27:55,473 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:27:55,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 399 events. 14/399 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1188 event pairs, 0 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 305. Up to 2 conditions per place. [2025-02-06 09:27:55,487 INFO L82 GeneralOperation]: Start removeDead. Operand has 402 places, 403 transitions, 834 flow [2025-02-06 09:27:55,499 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 380 places, 379 transitions, 782 flow [2025-02-06 09:27:55,505 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:27:55,513 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;@7dc9d3d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:27:55,513 INFO L334 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2025-02-06 09:27:55,517 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:27:55,517 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-06 09:27:55,518 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:55,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,518 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] [2025-02-06 09:27:55,519 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:55,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1643599647, now seen corresponding path program 1 times [2025-02-06 09:27:55,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916443353] [2025-02-06 09:27:55,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:55,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 09:27:55,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 09:27:55,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:55,715 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:27:55,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:55,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916443353] [2025-02-06 09:27:55,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916443353] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:55,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:55,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:55,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642699623] [2025-02-06 09:27:55,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:55,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:55,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:55,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:55,741 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:55,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2025-02-06 09:27:55,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 379 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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:27:55,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:55,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2025-02-06 09:27:55,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,971 INFO L124 PetriNetUnfolderBase]: 49/589 cut-off events. [2025-02-06 09:27:55,972 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-02-06 09:27:55,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 795 conditions, 589 events. 49/589 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 2913 event pairs, 39 based on Foata normal form. 91/555 useless extension candidates. Maximal degree in co-relation 653. Up to 109 conditions per place. [2025-02-06 09:27:55,980 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 27 selfloop transitions, 2 changer transitions 1/373 dead transitions. [2025-02-06 09:27:55,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 381 places, 373 transitions, 828 flow [2025-02-06 09:27:55,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:55,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:55,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1130 transitions. [2025-02-06 09:27:55,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9346567411083541 [2025-02-06 09:27:55,992 INFO L175 Difference]: Start difference. First operand has 380 places, 379 transitions, 782 flow. Second operand 3 states and 1130 transitions. [2025-02-06 09:27:55,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 381 places, 373 transitions, 828 flow [2025-02-06 09:27:55,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 373 transitions, 812 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 09:27:56,001 INFO L231 Difference]: Finished difference. Result has 373 places, 372 transitions, 756 flow [2025-02-06 09:27:56,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=754, PETRI_DIFFERENCE_MINUEND_PLACES=371, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=373, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=371, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=373, PETRI_TRANSITIONS=372} [2025-02-06 09:27:56,009 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -7 predicate places. [2025-02-06 09:27:56,009 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 372 transitions, 756 flow [2025-02-06 09:27:56,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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:27:56,010 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,010 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] [2025-02-06 09:27:56,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:27:56,010 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:56,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,011 INFO L85 PathProgramCache]: Analyzing trace with hash 700795045, now seen corresponding path program 1 times [2025-02-06 09:27:56,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16838569] [2025-02-06 09:27:56,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:27:56,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:27:56,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,066 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:27:56,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16838569] [2025-02-06 09:27:56,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16838569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894726969] [2025-02-06 09:27:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,068 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,173 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2025-02-06 09:27:56,174 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 372 transitions, 756 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 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:27:56,174 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,174 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2025-02-06 09:27:56,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,282 INFO L124 PetriNetUnfolderBase]: 49/587 cut-off events. [2025-02-06 09:27:56,282 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:27:56,286 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731 conditions, 587 events. 49/587 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2913 event pairs, 39 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 701. Up to 108 conditions per place. [2025-02-06 09:27:56,290 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/371 dead transitions. [2025-02-06 09:27:56,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 373 places, 371 transitions, 810 flow [2025-02-06 09:27:56,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:56,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2025-02-06 09:27:56,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2025-02-06 09:27:56,293 INFO L175 Difference]: Start difference. First operand has 373 places, 372 transitions, 756 flow. Second operand 3 states and 1127 transitions. [2025-02-06 09:27:56,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 373 places, 371 transitions, 810 flow [2025-02-06 09:27:56,295 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 371 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:56,298 INFO L231 Difference]: Finished difference. Result has 371 places, 371 transitions, 754 flow [2025-02-06 09:27:56,299 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=750, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=371, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=754, PETRI_PLACES=371, PETRI_TRANSITIONS=371} [2025-02-06 09:27:56,299 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -9 predicate places. [2025-02-06 09:27:56,299 INFO L471 AbstractCegarLoop]: Abstraction has has 371 places, 371 transitions, 754 flow [2025-02-06 09:27:56,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 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:27:56,300 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,300 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] [2025-02-06 09:27:56,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:27:56,300 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:56,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,301 INFO L85 PathProgramCache]: Analyzing trace with hash -375708256, now seen corresponding path program 1 times [2025-02-06 09:27:56,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570857615] [2025-02-06 09:27:56,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:27:56,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:27:56,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,328 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:27:56,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570857615] [2025-02-06 09:27:56,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570857615] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807592376] [2025-02-06 09:27:56,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 365 out of 403 [2025-02-06 09:27:56,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 371 places, 371 transitions, 754 flow. Second operand has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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:27:56,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 365 of 403 [2025-02-06 09:27:56,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,499 INFO L124 PetriNetUnfolderBase]: 49/541 cut-off events. [2025-02-06 09:27:56,499 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 09:27:56,503 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 541 events. 49/541 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2554 event pairs, 39 based on Foata normal form. 0/435 useless extension candidates. Maximal degree in co-relation 636. Up to 109 conditions per place. [2025-02-06 09:27:56,507 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/370 dead transitions. [2025-02-06 09:27:56,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 372 places, 370 transitions, 810 flow [2025-02-06 09:27:56,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:56,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1125 transitions. [2025-02-06 09:27:56,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305210918114144 [2025-02-06 09:27:56,510 INFO L175 Difference]: Start difference. First operand has 371 places, 371 transitions, 754 flow. Second operand 3 states and 1125 transitions. [2025-02-06 09:27:56,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 372 places, 370 transitions, 810 flow [2025-02-06 09:27:56,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 370 transitions, 806 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:56,516 INFO L231 Difference]: Finished difference. Result has 370 places, 370 transitions, 752 flow [2025-02-06 09:27:56,516 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=370, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=368, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=752, PETRI_PLACES=370, PETRI_TRANSITIONS=370} [2025-02-06 09:27:56,517 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -10 predicate places. [2025-02-06 09:27:56,517 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 370 transitions, 752 flow [2025-02-06 09:27:56,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 366.3333333333333) internal successors, (1099), 3 states have internal predecessors, (1099), 0 states have call successors, (0), 0 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:27:56,518 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,518 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:56,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:27:56,518 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:56,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash -774187658, now seen corresponding path program 1 times [2025-02-06 09:27:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241232235] [2025-02-06 09:27:56,519 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:27:56,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:27:56,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,568 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:27:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241232235] [2025-02-06 09:27:56,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241232235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298960187] [2025-02-06 09:27:56,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,686 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 366 out of 403 [2025-02-06 09:27:56,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 370 transitions, 752 flow. Second operand has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 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:27:56,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 366 of 403 [2025-02-06 09:27:56,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,859 INFO L124 PetriNetUnfolderBase]: 49/495 cut-off events. [2025-02-06 09:27:56,862 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 09:27:56,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 495 events. 49/495 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2097 event pairs, 39 based on Foata normal form. 0/406 useless extension candidates. Maximal degree in co-relation 569. Up to 108 conditions per place. [2025-02-06 09:27:56,879 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 26 selfloop transitions, 2 changer transitions 0/369 dead transitions. [2025-02-06 09:27:56,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 371 places, 369 transitions, 806 flow [2025-02-06 09:27:56,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:56,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1127 transitions. [2025-02-06 09:27:56,886 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9321753515301903 [2025-02-06 09:27:56,886 INFO L175 Difference]: Start difference. First operand has 370 places, 370 transitions, 752 flow. Second operand 3 states and 1127 transitions. [2025-02-06 09:27:56,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 371 places, 369 transitions, 806 flow [2025-02-06 09:27:56,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 369 places, 369 transitions, 802 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:56,896 INFO L231 Difference]: Finished difference. Result has 369 places, 369 transitions, 750 flow [2025-02-06 09:27:56,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=367, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=369, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=367, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=750, PETRI_PLACES=369, PETRI_TRANSITIONS=369} [2025-02-06 09:27:56,900 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -11 predicate places. [2025-02-06 09:27:56,900 INFO L471 AbstractCegarLoop]: Abstraction has has 369 places, 369 transitions, 750 flow [2025-02-06 09:27:56,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 367.3333333333333) internal successors, (1102), 3 states have internal predecessors, (1102), 0 states have call successors, (0), 0 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:27:56,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,901 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:27:56,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:27:56,901 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:56,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,902 INFO L85 PathProgramCache]: Analyzing trace with hash -315275933, now seen corresponding path program 1 times [2025-02-06 09:27:56,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010463547] [2025-02-06 09:27:56,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:27:56,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:27:56,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,953 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:27:56,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010463547] [2025-02-06 09:27:56,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010463547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789054320] [2025-02-06 09:27:56,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,995 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 377 out of 403 [2025-02-06 09:27:56,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 369 transitions, 750 flow. Second operand has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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:27:57,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:57,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 377 of 403 [2025-02-06 09:27:57,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,349 INFO L124 PetriNetUnfolderBase]: 102/2206 cut-off events. [2025-02-06 09:27:57,350 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:27:57,360 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2371 conditions, 2206 events. 102/2206 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 18751 event pairs, 51 based on Foata normal form. 0/1664 useless extension candidates. Maximal degree in co-relation 2320. Up to 144 conditions per place. [2025-02-06 09:27:57,370 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 15 selfloop transitions, 2 changer transitions 0/368 dead transitions. [2025-02-06 09:27:57,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 370 places, 368 transitions, 782 flow [2025-02-06 09:27:57,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:57,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:57,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1149 transitions. [2025-02-06 09:27:57,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9503722084367245 [2025-02-06 09:27:57,373 INFO L175 Difference]: Start difference. First operand has 369 places, 369 transitions, 750 flow. Second operand 3 states and 1149 transitions. [2025-02-06 09:27:57,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 370 places, 368 transitions, 782 flow [2025-02-06 09:27:57,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 368 transitions, 778 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:57,380 INFO L231 Difference]: Finished difference. Result has 368 places, 368 transitions, 748 flow [2025-02-06 09:27:57,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=744, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=368, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=366, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=748, PETRI_PLACES=368, PETRI_TRANSITIONS=368} [2025-02-06 09:27:57,383 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -12 predicate places. [2025-02-06 09:27:57,383 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 368 transitions, 748 flow [2025-02-06 09:27:57,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 378.3333333333333) internal successors, (1135), 3 states have internal predecessors, (1135), 0 states have call successors, (0), 0 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:27:57,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:57,384 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] [2025-02-06 09:27:57,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:27:57,384 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:57,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:57,387 INFO L85 PathProgramCache]: Analyzing trace with hash 491399291, now seen corresponding path program 1 times [2025-02-06 09:27:57,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:57,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648196821] [2025-02-06 09:27:57,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:57,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:57,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 09:27:57,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 09:27:57,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:57,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:57,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648196821] [2025-02-06 09:27:57,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648196821] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:57,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959673540] [2025-02-06 09:27:57,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:57,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:57,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:57,475 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2025-02-06 09:27:57,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 368 transitions, 748 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 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:27:57,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:57,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2025-02-06 09:27:57,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,559 INFO L124 PetriNetUnfolderBase]: 76/573 cut-off events. [2025-02-06 09:27:57,559 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:27:57,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 573 events. 76/573 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3006 event pairs, 54 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 763. Up to 144 conditions per place. [2025-02-06 09:27:57,567 INFO L140 encePairwiseOnDemand]: 382/403 looper letters, 32 selfloop transitions, 9 changer transitions 0/360 dead transitions. [2025-02-06 09:27:57,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 358 places, 360 transitions, 817 flow [2025-02-06 09:27:57,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:57,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:57,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1094 transitions. [2025-02-06 09:27:57,569 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9048800661703887 [2025-02-06 09:27:57,570 INFO L175 Difference]: Start difference. First operand has 368 places, 368 transitions, 748 flow. Second operand 3 states and 1094 transitions. [2025-02-06 09:27:57,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 358 places, 360 transitions, 817 flow [2025-02-06 09:27:57,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 356 places, 360 transitions, 813 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:57,576 INFO L231 Difference]: Finished difference. Result has 357 places, 357 transitions, 751 flow [2025-02-06 09:27:57,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=356, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=357, PETRI_TRANSITIONS=357} [2025-02-06 09:27:57,579 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -23 predicate places. [2025-02-06 09:27:57,579 INFO L471 AbstractCegarLoop]: Abstraction has has 357 places, 357 transitions, 751 flow [2025-02-06 09:27:57,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 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:27:57,580 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:57,580 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] [2025-02-06 09:27:57,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:27:57,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:57,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:57,581 INFO L85 PathProgramCache]: Analyzing trace with hash -211668759, now seen corresponding path program 1 times [2025-02-06 09:27:57,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:57,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099713623] [2025-02-06 09:27:57,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:57,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:57,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:27:57,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:27:57,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:57,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:57,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099713623] [2025-02-06 09:27:57,627 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099713623] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,627 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:57,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826566969] [2025-02-06 09:27:57,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:57,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:57,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:57,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2025-02-06 09:27:57,682 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 357 places, 357 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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:27:57,682 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:57,682 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2025-02-06 09:27:57,682 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,767 INFO L124 PetriNetUnfolderBase]: 76/563 cut-off events. [2025-02-06 09:27:57,767 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-02-06 09:27:57,772 INFO L83 FinitePrefix]: Finished finitePrefix Result has 800 conditions, 563 events. 76/563 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2983 event pairs, 54 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 694. Up to 142 conditions per place. [2025-02-06 09:27:57,777 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 30 selfloop transitions, 9 changer transitions 0/350 dead transitions. [2025-02-06 09:27:57,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 348 places, 350 transitions, 818 flow [2025-02-06 09:27:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:57,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1100 transitions. [2025-02-06 09:27:57,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098428453267163 [2025-02-06 09:27:57,779 INFO L175 Difference]: Start difference. First operand has 357 places, 357 transitions, 751 flow. Second operand 3 states and 1100 transitions. [2025-02-06 09:27:57,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 348 places, 350 transitions, 818 flow [2025-02-06 09:27:57,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 350 transitions, 809 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:57,784 INFO L231 Difference]: Finished difference. Result has 348 places, 347 transitions, 751 flow [2025-02-06 09:27:57,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=720, PETRI_DIFFERENCE_MINUEND_PLACES=345, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=337, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=751, PETRI_PLACES=348, PETRI_TRANSITIONS=347} [2025-02-06 09:27:57,785 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -32 predicate places. [2025-02-06 09:27:57,785 INFO L471 AbstractCegarLoop]: Abstraction has has 348 places, 347 transitions, 751 flow [2025-02-06 09:27:57,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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:27:57,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:57,785 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] [2025-02-06 09:27:57,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:27:57,786 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:57,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:57,786 INFO L85 PathProgramCache]: Analyzing trace with hash 1455041712, now seen corresponding path program 1 times [2025-02-06 09:27:57,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:57,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340525197] [2025-02-06 09:27:57,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:57,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:57,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:27:57,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:27:57,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:57,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,813 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:27:57,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340525197] [2025-02-06 09:27:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340525197] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:57,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453923528] [2025-02-06 09:27:57,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:57,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:57,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 347 out of 403 [2025-02-06 09:27:57,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 348 places, 347 transitions, 751 flow. Second operand has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 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:27:57,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:57,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 347 of 403 [2025-02-06 09:27:57,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,984 INFO L124 PetriNetUnfolderBase]: 83/744 cut-off events. [2025-02-06 09:27:57,984 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2025-02-06 09:27:57,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 744 events. 83/744 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4309 event pairs, 12 based on Foata normal form. 0/664 useless extension candidates. Maximal degree in co-relation 851. Up to 148 conditions per place. [2025-02-06 09:27:57,993 INFO L140 encePairwiseOnDemand]: 381/403 looper letters, 35 selfloop transitions, 10 changer transitions 0/343 dead transitions. [2025-02-06 09:27:57,993 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 343 transitions, 839 flow [2025-02-06 09:27:57,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:57,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:57,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1098 transitions. [2025-02-06 09:27:57,996 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9081885856079405 [2025-02-06 09:27:57,996 INFO L175 Difference]: Start difference. First operand has 348 places, 347 transitions, 751 flow. Second operand 3 states and 1098 transitions. [2025-02-06 09:27:57,996 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 343 transitions, 839 flow [2025-02-06 09:27:57,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 343 transitions, 830 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:58,000 INFO L231 Difference]: Finished difference. Result has 338 places, 337 transitions, 756 flow [2025-02-06 09:27:58,000 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=718, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=335, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=756, PETRI_PLACES=338, PETRI_TRANSITIONS=337} [2025-02-06 09:27:58,001 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -42 predicate places. [2025-02-06 09:27:58,001 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 337 transitions, 756 flow [2025-02-06 09:27:58,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 348.0) internal successors, (1044), 3 states have internal predecessors, (1044), 0 states have call successors, (0), 0 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:27:58,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,002 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] [2025-02-06 09:27:58,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:27:58,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:58,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1864234810, now seen corresponding path program 1 times [2025-02-06 09:27:58,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311613588] [2025-02-06 09:27:58,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:27:58,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:27:58,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,051 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:27:58,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311613588] [2025-02-06 09:27:58,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311613588] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:27:58,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787445541] [2025-02-06 09:27:58,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:27:58,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:27:58,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:27:58,071 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 376 out of 403 [2025-02-06 09:27:58,072 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 337 transitions, 756 flow. Second operand has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 0 states have call successors, (0), 0 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:27:58,072 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 376 of 403 [2025-02-06 09:27:58,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,139 INFO L124 PetriNetUnfolderBase]: 12/569 cut-off events. [2025-02-06 09:27:58,139 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-02-06 09:27:58,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 673 conditions, 569 events. 12/569 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2410 event pairs, 0 based on Foata normal form. 0/503 useless extension candidates. Maximal degree in co-relation 474. Up to 26 conditions per place. [2025-02-06 09:27:58,144 INFO L140 encePairwiseOnDemand]: 397/403 looper letters, 19 selfloop transitions, 5 changer transitions 0/342 dead transitions. [2025-02-06 09:27:58,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 342 places, 342 transitions, 814 flow [2025-02-06 09:27:58,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:27:58,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:27:58,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1905 transitions. [2025-02-06 09:27:58,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9454094292803971 [2025-02-06 09:27:58,147 INFO L175 Difference]: Start difference. First operand has 338 places, 337 transitions, 756 flow. Second operand 5 states and 1905 transitions. [2025-02-06 09:27:58,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 342 places, 342 transitions, 814 flow [2025-02-06 09:27:58,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 341 places, 342 transitions, 804 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:58,152 INFO L231 Difference]: Finished difference. Result has 345 places, 341 transitions, 784 flow [2025-02-06 09:27:58,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=746, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=784, PETRI_PLACES=345, PETRI_TRANSITIONS=341} [2025-02-06 09:27:58,153 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -35 predicate places. [2025-02-06 09:27:58,153 INFO L471 AbstractCegarLoop]: Abstraction has has 345 places, 341 transitions, 784 flow [2025-02-06 09:27:58,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 377.25) internal successors, (1509), 4 states have internal predecessors, (1509), 0 states have call successors, (0), 0 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:27:58,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,154 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] [2025-02-06 09:27:58,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:27:58,154 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:58,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,154 INFO L85 PathProgramCache]: Analyzing trace with hash 195691521, now seen corresponding path program 1 times [2025-02-06 09:27:58,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000555438] [2025-02-06 09:27:58,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 09:27:58,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 09:27:58,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,182 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:27:58,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000555438] [2025-02-06 09:27:58,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000555438] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:58,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583504800] [2025-02-06 09:27:58,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:58,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:58,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 350 out of 403 [2025-02-06 09:27:58,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 345 places, 341 transitions, 784 flow. Second operand has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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:27:58,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 350 of 403 [2025-02-06 09:27:58,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,355 INFO L124 PetriNetUnfolderBase]: 133/1059 cut-off events. [2025-02-06 09:27:58,355 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2025-02-06 09:27:58,363 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1477 conditions, 1059 events. 133/1059 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 7208 event pairs, 20 based on Foata normal form. 1/979 useless extension candidates. Maximal degree in co-relation 1115. Up to 236 conditions per place. [2025-02-06 09:27:58,367 INFO L140 encePairwiseOnDemand]: 383/403 looper letters, 31 selfloop transitions, 9 changer transitions 10/338 dead transitions. [2025-02-06 09:27:58,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 336 places, 338 transitions, 869 flow [2025-02-06 09:27:58,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:58,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:58,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1103 transitions. [2025-02-06 09:27:58,369 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.91232423490488 [2025-02-06 09:27:58,369 INFO L175 Difference]: Start difference. First operand has 345 places, 341 transitions, 784 flow. Second operand 3 states and 1103 transitions. [2025-02-06 09:27:58,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 336 places, 338 transitions, 869 flow [2025-02-06 09:27:58,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 336 places, 338 transitions, 869 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:58,374 INFO L231 Difference]: Finished difference. Result has 337 places, 321 transitions, 772 flow [2025-02-06 09:27:58,374 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=334, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=330, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=772, PETRI_PLACES=337, PETRI_TRANSITIONS=321} [2025-02-06 09:27:58,374 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -43 predicate places. [2025-02-06 09:27:58,375 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 321 transitions, 772 flow [2025-02-06 09:27:58,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 351.0) internal successors, (1053), 3 states have internal predecessors, (1053), 0 states have call successors, (0), 0 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:27:58,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:58,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:27:58,376 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:58,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1869303362, now seen corresponding path program 1 times [2025-02-06 09:27:58,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595831765] [2025-02-06 09:27:58,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 09:27:58,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 09:27:58,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,429 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:27:58,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595831765] [2025-02-06 09:27:58,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595831765] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:58,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866011330] [2025-02-06 09:27:58,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:58,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:58,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:58,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 375 out of 403 [2025-02-06 09:27:58,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 321 transitions, 772 flow. Second operand has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 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:27:58,443 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,443 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 375 of 403 [2025-02-06 09:27:58,443 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:59,411 INFO L124 PetriNetUnfolderBase]: 751/9298 cut-off events. [2025-02-06 09:27:59,411 INFO L125 PetriNetUnfolderBase]: For 280/280 co-relation queries the response was YES. [2025-02-06 09:27:59,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12087 conditions, 9298 events. 751/9298 cut-off events. For 280/280 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 115292 event pairs, 349 based on Foata normal form. 0/8260 useless extension candidates. Maximal degree in co-relation 9115. Up to 1015 conditions per place. [2025-02-06 09:27:59,473 INFO L140 encePairwiseOnDemand]: 395/403 looper letters, 19 selfloop transitions, 4 changer transitions 0/324 dead transitions. [2025-02-06 09:27:59,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 324 transitions, 827 flow [2025-02-06 09:27:59,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:59,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-02-06 09:27:59,476 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9528535980148883 [2025-02-06 09:27:59,476 INFO L175 Difference]: Start difference. First operand has 337 places, 321 transitions, 772 flow. Second operand 3 states and 1152 transitions. [2025-02-06 09:27:59,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 324 transitions, 827 flow [2025-02-06 09:27:59,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 324 transitions, 818 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:59,486 INFO L231 Difference]: Finished difference. Result has 325 places, 321 transitions, 783 flow [2025-02-06 09:27:59,486 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=321} [2025-02-06 09:27:59,487 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2025-02-06 09:27:59,487 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 321 transitions, 783 flow [2025-02-06 09:27:59,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 376.3333333333333) internal successors, (1129), 3 states have internal predecessors, (1129), 0 states have call successors, (0), 0 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:27:59,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:59,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:59,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:27:59,488 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:59,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash -6276303, now seen corresponding path program 1 times [2025-02-06 09:27:59,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:59,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660192602] [2025-02-06 09:27:59,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:59,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:59,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:27:59,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:27:59,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:59,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:59,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:59,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660192602] [2025-02-06 09:27:59,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660192602] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:59,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:59,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:59,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237479924] [2025-02-06 09:27:59,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:59,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:59,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:59,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:59,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:59,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:27:59,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 321 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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:27:59,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:59,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:27:59,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:59,942 INFO L124 PetriNetUnfolderBase]: 284/2834 cut-off events. [2025-02-06 09:27:59,943 INFO L125 PetriNetUnfolderBase]: For 95/107 co-relation queries the response was YES. [2025-02-06 09:27:59,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4016 conditions, 2834 events. 284/2834 cut-off events. For 95/107 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26449 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 2727. Up to 339 conditions per place. [2025-02-06 09:27:59,964 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-02-06 09:27:59,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 323 transitions, 850 flow [2025-02-06 09:27:59,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:59,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:27:59,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:27:59,966 INFO L175 Difference]: Start difference. First operand has 325 places, 321 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:27:59,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 323 transitions, 850 flow [2025-02-06 09:27:59,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 323 transitions, 850 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:59,970 INFO L231 Difference]: Finished difference. Result has 326 places, 320 transitions, 785 flow [2025-02-06 09:27:59,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=781, PETRI_DIFFERENCE_MINUEND_PLACES=324, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=785, PETRI_PLACES=326, PETRI_TRANSITIONS=320} [2025-02-06 09:27:59,971 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -54 predicate places. [2025-02-06 09:27:59,971 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 320 transitions, 785 flow [2025-02-06 09:27:59,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.0) internal successors, (1110), 3 states have internal predecessors, (1110), 0 states have call successors, (0), 0 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:27:59,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:59,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:59,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:27:59,972 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:27:59,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:59,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1077752010, now seen corresponding path program 1 times [2025-02-06 09:27:59,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:59,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300317245] [2025-02-06 09:27:59,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:59,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:59,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 09:27:59,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 09:27:59,980 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:59,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:00,007 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:00,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:00,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300317245] [2025-02-06 09:28:00,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300317245] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:00,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:00,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:00,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710701302] [2025-02-06 09:28:00,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:00,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:00,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:00,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:00,008 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:00,052 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:00,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 320 transitions, 785 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 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:00,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:00,053 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:00,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:00,512 INFO L124 PetriNetUnfolderBase]: 503/3658 cut-off events. [2025-02-06 09:28:00,512 INFO L125 PetriNetUnfolderBase]: For 337/345 co-relation queries the response was YES. [2025-02-06 09:28:00,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5557 conditions, 3658 events. 503/3658 cut-off events. For 337/345 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 36536 event pairs, 310 based on Foata normal form. 0/3316 useless extension candidates. Maximal degree in co-relation 5356. Up to 766 conditions per place. [2025-02-06 09:28:00,551 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/322 dead transitions. [2025-02-06 09:28:00,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 322 transitions, 850 flow [2025-02-06 09:28:00,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:00,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:00,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:00,553 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:00,553 INFO L175 Difference]: Start difference. First operand has 326 places, 320 transitions, 785 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:00,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 322 transitions, 850 flow [2025-02-06 09:28:00,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 325 places, 322 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:00,558 INFO L231 Difference]: Finished difference. Result has 325 places, 319 transitions, 783 flow [2025-02-06 09:28:00,558 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=783, PETRI_PLACES=325, PETRI_TRANSITIONS=319} [2025-02-06 09:28:00,559 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -55 predicate places. [2025-02-06 09:28:00,559 INFO L471 AbstractCegarLoop]: Abstraction has has 325 places, 319 transitions, 783 flow [2025-02-06 09:28:00,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 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:00,560 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:00,560 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] [2025-02-06 09:28:00,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:28:00,560 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:00,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:00,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1299713067, now seen corresponding path program 1 times [2025-02-06 09:28:00,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:00,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458963562] [2025-02-06 09:28:00,561 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:00,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:00,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:28:00,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:28:00,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:00,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:28:00,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:00,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458963562] [2025-02-06 09:28:00,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458963562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:00,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:00,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16548737] [2025-02-06 09:28:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:00,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:00,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:00,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:28:00,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 325 places, 319 transitions, 783 flow. Second operand has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 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:00,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:00,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:28:00,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:01,003 INFO L124 PetriNetUnfolderBase]: 284/2810 cut-off events. [2025-02-06 09:28:01,004 INFO L125 PetriNetUnfolderBase]: For 107/116 co-relation queries the response was YES. [2025-02-06 09:28:01,024 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4017 conditions, 2810 events. 284/2810 cut-off events. For 107/116 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 26054 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3417. Up to 339 conditions per place. [2025-02-06 09:28:01,034 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/321 dead transitions. [2025-02-06 09:28:01,035 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 326 places, 321 transitions, 850 flow [2025-02-06 09:28:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:01,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:01,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:28:01,037 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:28:01,037 INFO L175 Difference]: Start difference. First operand has 325 places, 319 transitions, 783 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:28:01,037 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 326 places, 321 transitions, 850 flow [2025-02-06 09:28:01,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 321 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:01,042 INFO L231 Difference]: Finished difference. Result has 324 places, 318 transitions, 781 flow [2025-02-06 09:28:01,043 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=777, PETRI_DIFFERENCE_MINUEND_PLACES=322, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=318, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=316, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=781, PETRI_PLACES=324, PETRI_TRANSITIONS=318} [2025-02-06 09:28:01,043 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -56 predicate places. [2025-02-06 09:28:01,043 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 318 transitions, 781 flow [2025-02-06 09:28:01,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.0) internal successors, (1113), 3 states have internal predecessors, (1113), 0 states have call successors, (0), 0 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:01,044 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:01,044 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] [2025-02-06 09:28:01,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:28:01,044 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:01,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:01,045 INFO L85 PathProgramCache]: Analyzing trace with hash -1682048923, now seen corresponding path program 1 times [2025-02-06 09:28:01,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:01,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685355135] [2025-02-06 09:28:01,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:01,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:01,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:28:01,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:28:01,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:01,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:01,083 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:01,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:01,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685355135] [2025-02-06 09:28:01,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685355135] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:01,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:01,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543398508] [2025-02-06 09:28:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:01,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:01,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:01,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:01,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:28:01,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 318 transitions, 781 flow. Second operand has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 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:01,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:01,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:28:01,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:01,579 INFO L124 PetriNetUnfolderBase]: 345/2823 cut-off events. [2025-02-06 09:28:01,580 INFO L125 PetriNetUnfolderBase]: For 285/288 co-relation queries the response was YES. [2025-02-06 09:28:01,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4185 conditions, 2823 events. 345/2823 cut-off events. For 285/288 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 26111 event pairs, 197 based on Foata normal form. 0/2565 useless extension candidates. Maximal degree in co-relation 4034. Up to 552 conditions per place. [2025-02-06 09:28:01,617 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/320 dead transitions. [2025-02-06 09:28:01,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 320 transitions, 850 flow [2025-02-06 09:28:01,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:01,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:28:01,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:28:01,620 INFO L175 Difference]: Start difference. First operand has 324 places, 318 transitions, 781 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:28:01,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 320 transitions, 850 flow [2025-02-06 09:28:01,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 323 places, 320 transitions, 846 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:01,625 INFO L231 Difference]: Finished difference. Result has 323 places, 317 transitions, 779 flow [2025-02-06 09:28:01,626 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=775, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=779, PETRI_PLACES=323, PETRI_TRANSITIONS=317} [2025-02-06 09:28:01,626 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -57 predicate places. [2025-02-06 09:28:01,626 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 317 transitions, 779 flow [2025-02-06 09:28:01,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 370.3333333333333) internal successors, (1111), 3 states have internal predecessors, (1111), 0 states have call successors, (0), 0 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:01,627 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:01,627 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] [2025-02-06 09:28:01,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:28:01,627 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:01,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1224863742, now seen corresponding path program 1 times [2025-02-06 09:28:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:01,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715801511] [2025-02-06 09:28:01,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:01,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:01,634 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:28:01,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:28:01,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:01,638 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:01,657 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:01,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:01,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715801511] [2025-02-06 09:28:01,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715801511] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:01,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:01,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:01,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64449239] [2025-02-06 09:28:01,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:01,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:01,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:01,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:01,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:01,718 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:01,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 317 transitions, 779 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 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:01,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:01,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:01,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:02,266 INFO L124 PetriNetUnfolderBase]: 515/3744 cut-off events. [2025-02-06 09:28:02,266 INFO L125 PetriNetUnfolderBase]: For 347/353 co-relation queries the response was YES. [2025-02-06 09:28:02,294 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5703 conditions, 3744 events. 515/3744 cut-off events. For 347/353 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 37173 event pairs, 310 based on Foata normal form. 0/3433 useless extension candidates. Maximal degree in co-relation 4966. Up to 766 conditions per place. [2025-02-06 09:28:02,305 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/319 dead transitions. [2025-02-06 09:28:02,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 324 places, 319 transitions, 844 flow [2025-02-06 09:28:02,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:02,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:02,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:02,307 INFO L175 Difference]: Start difference. First operand has 323 places, 317 transitions, 779 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:02,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 324 places, 319 transitions, 844 flow [2025-02-06 09:28:02,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 319 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:02,312 INFO L231 Difference]: Finished difference. Result has 322 places, 316 transitions, 777 flow [2025-02-06 09:28:02,312 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=773, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=316, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=314, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=777, PETRI_PLACES=322, PETRI_TRANSITIONS=316} [2025-02-06 09:28:02,312 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -58 predicate places. [2025-02-06 09:28:02,313 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 316 transitions, 777 flow [2025-02-06 09:28:02,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 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:02,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:02,313 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] [2025-02-06 09:28:02,313 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:28:02,313 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:02,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:02,314 INFO L85 PathProgramCache]: Analyzing trace with hash 1054453373, now seen corresponding path program 1 times [2025-02-06 09:28:02,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:02,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366636059] [2025-02-06 09:28:02,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:02,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:02,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:28:02,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:28:02,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:02,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:02,347 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:02,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:02,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366636059] [2025-02-06 09:28:02,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366636059] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:02,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:02,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:02,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779015288] [2025-02-06 09:28:02,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:02,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:02,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:02,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:02,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:02,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:28:02,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 316 transitions, 777 flow. Second operand has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 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:02,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:02,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:28:02,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:02,745 INFO L124 PetriNetUnfolderBase]: 284/2772 cut-off events. [2025-02-06 09:28:02,745 INFO L125 PetriNetUnfolderBase]: For 107/116 co-relation queries the response was YES. [2025-02-06 09:28:02,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3979 conditions, 2772 events. 284/2772 cut-off events. For 107/116 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 25546 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3523. Up to 339 conditions per place. [2025-02-06 09:28:02,777 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-02-06 09:28:02,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 318 transitions, 844 flow [2025-02-06 09:28:02,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:02,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:02,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:28:02,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:28:02,779 INFO L175 Difference]: Start difference. First operand has 322 places, 316 transitions, 777 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:28:02,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 318 transitions, 844 flow [2025-02-06 09:28:02,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 318 transitions, 840 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:02,784 INFO L231 Difference]: Finished difference. Result has 321 places, 315 transitions, 775 flow [2025-02-06 09:28:02,784 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=771, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=313, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=775, PETRI_PLACES=321, PETRI_TRANSITIONS=315} [2025-02-06 09:28:02,784 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -59 predicate places. [2025-02-06 09:28:02,784 INFO L471 AbstractCegarLoop]: Abstraction has has 321 places, 315 transitions, 775 flow [2025-02-06 09:28:02,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.0) internal successors, (1116), 3 states have internal predecessors, (1116), 0 states have call successors, (0), 0 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:02,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:02,785 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] [2025-02-06 09:28:02,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:28:02,785 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread4Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:02,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:02,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1221399530, now seen corresponding path program 1 times [2025-02-06 09:28:02,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:02,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888662974] [2025-02-06 09:28:02,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:02,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:02,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:28:02,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:28:02,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:02,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:02,818 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:02,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:02,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888662974] [2025-02-06 09:28:02,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888662974] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:02,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:02,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:02,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790307377] [2025-02-06 09:28:02,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:02,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:02,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:02,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:02,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:02,864 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:02,865 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 315 transitions, 775 flow. Second operand has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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:02,866 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:02,866 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:02,866 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:03,082 INFO L124 PetriNetUnfolderBase]: 190/2159 cut-off events. [2025-02-06 09:28:03,082 INFO L125 PetriNetUnfolderBase]: For 177/184 co-relation queries the response was YES. [2025-02-06 09:28:03,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2980 conditions, 2159 events. 190/2159 cut-off events. For 177/184 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 18165 event pairs, 84 based on Foata normal form. 1/1976 useless extension candidates. Maximal degree in co-relation 2873. Up to 268 conditions per place. [2025-02-06 09:28:03,104 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/317 dead transitions. [2025-02-06 09:28:03,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 317 transitions, 840 flow [2025-02-06 09:28:03,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:03,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:03,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:03,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:03,106 INFO L175 Difference]: Start difference. First operand has 321 places, 315 transitions, 775 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:03,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 317 transitions, 840 flow [2025-02-06 09:28:03,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 320 places, 317 transitions, 836 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:03,110 INFO L231 Difference]: Finished difference. Result has 320 places, 314 transitions, 773 flow [2025-02-06 09:28:03,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=769, PETRI_DIFFERENCE_MINUEND_PLACES=318, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=314, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=773, PETRI_PLACES=320, PETRI_TRANSITIONS=314} [2025-02-06 09:28:03,111 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -60 predicate places. [2025-02-06 09:28:03,111 INFO L471 AbstractCegarLoop]: Abstraction has has 320 places, 314 transitions, 773 flow [2025-02-06 09:28:03,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.6666666666667) internal successors, (1115), 3 states have internal predecessors, (1115), 0 states have call successors, (0), 0 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:03,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:03,112 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:03,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:28:03,112 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread3Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:03,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:03,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1433424401, now seen corresponding path program 1 times [2025-02-06 09:28:03,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:03,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733827820] [2025-02-06 09:28:03,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:03,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:03,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:28:03,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:28:03,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:03,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:03,147 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:03,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:03,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733827820] [2025-02-06 09:28:03,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733827820] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:03,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:03,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:03,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712691883] [2025-02-06 09:28:03,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:03,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:03,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:03,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:03,214 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:28:03,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 320 places, 314 transitions, 773 flow. Second operand has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 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:03,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:03,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:28:03,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:03,483 INFO L124 PetriNetUnfolderBase]: 345/2763 cut-off events. [2025-02-06 09:28:03,483 INFO L125 PetriNetUnfolderBase]: For 287/290 co-relation queries the response was YES. [2025-02-06 09:28:03,507 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4135 conditions, 2763 events. 345/2763 cut-off events. For 287/290 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 25298 event pairs, 197 based on Foata normal form. 0/2553 useless extension candidates. Maximal degree in co-relation 3733. Up to 552 conditions per place. [2025-02-06 09:28:03,516 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/316 dead transitions. [2025-02-06 09:28:03,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 316 transitions, 842 flow [2025-02-06 09:28:03,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:03,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:28:03,518 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:28:03,518 INFO L175 Difference]: Start difference. First operand has 320 places, 314 transitions, 773 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:28:03,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 316 transitions, 842 flow [2025-02-06 09:28:03,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 316 transitions, 838 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:03,523 INFO L231 Difference]: Finished difference. Result has 319 places, 313 transitions, 771 flow [2025-02-06 09:28:03,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=767, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=771, PETRI_PLACES=319, PETRI_TRANSITIONS=313} [2025-02-06 09:28:03,523 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -61 predicate places. [2025-02-06 09:28:03,523 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 313 transitions, 771 flow [2025-02-06 09:28:03,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 371.3333333333333) internal successors, (1114), 3 states have internal predecessors, (1114), 0 states have call successors, (0), 0 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:03,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:03,524 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] [2025-02-06 09:28:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:28:03,524 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:03,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 447213250, now seen corresponding path program 1 times [2025-02-06 09:28:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903337290] [2025-02-06 09:28:03,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:03,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:03,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 09:28:03,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 09:28:03,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:03,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:03,548 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:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903337290] [2025-02-06 09:28:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903337290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:03,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:03,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:03,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421572184] [2025-02-06 09:28:03,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:03,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:03,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:03,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:03,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:03,611 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:03,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 313 transitions, 771 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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:03,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:03,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:03,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:04,010 INFO L124 PetriNetUnfolderBase]: 527/3811 cut-off events. [2025-02-06 09:28:04,010 INFO L125 PetriNetUnfolderBase]: For 347/353 co-relation queries the response was YES. [2025-02-06 09:28:04,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5806 conditions, 3811 events. 527/3811 cut-off events. For 347/353 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 37300 event pairs, 310 based on Foata normal form. 0/3550 useless extension candidates. Maximal degree in co-relation 5243. Up to 766 conditions per place. [2025-02-06 09:28:04,062 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/315 dead transitions. [2025-02-06 09:28:04,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 320 places, 315 transitions, 836 flow [2025-02-06 09:28:04,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:04,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:04,064 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:04,064 INFO L175 Difference]: Start difference. First operand has 319 places, 313 transitions, 771 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:04,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 320 places, 315 transitions, 836 flow [2025-02-06 09:28:04,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 315 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:04,069 INFO L231 Difference]: Finished difference. Result has 318 places, 312 transitions, 769 flow [2025-02-06 09:28:04,069 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=765, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=312, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=310, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=769, PETRI_PLACES=318, PETRI_TRANSITIONS=312} [2025-02-06 09:28:04,070 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -62 predicate places. [2025-02-06 09:28:04,070 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 312 transitions, 769 flow [2025-02-06 09:28:04,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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:04,070 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:04,070 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:04,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:28:04,071 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:04,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1701544567, now seen corresponding path program 1 times [2025-02-06 09:28:04,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:04,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614965118] [2025-02-06 09:28:04,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:04,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:04,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:28:04,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:28:04,084 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:04,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:04,102 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:04,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:04,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614965118] [2025-02-06 09:28:04,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614965118] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:04,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:04,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:04,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214637872] [2025-02-06 09:28:04,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:04,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:04,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:04,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:04,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:04,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:28:04,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 312 transitions, 769 flow. Second operand has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 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:04,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:04,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:28:04,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:04,500 INFO L124 PetriNetUnfolderBase]: 284/2724 cut-off events. [2025-02-06 09:28:04,500 INFO L125 PetriNetUnfolderBase]: For 107/116 co-relation queries the response was YES. [2025-02-06 09:28:04,526 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3931 conditions, 2724 events. 284/2724 cut-off events. For 107/116 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 24848 event pairs, 145 based on Foata normal form. 0/2549 useless extension candidates. Maximal degree in co-relation 3619. Up to 339 conditions per place. [2025-02-06 09:28:04,534 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 28 selfloop transitions, 2 changer transitions 0/314 dead transitions. [2025-02-06 09:28:04,535 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 314 transitions, 836 flow [2025-02-06 09:28:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:04,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:04,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:28:04,537 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:28:04,537 INFO L175 Difference]: Start difference. First operand has 318 places, 312 transitions, 769 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:28:04,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 314 transitions, 836 flow [2025-02-06 09:28:04,540 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 314 transitions, 832 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:04,542 INFO L231 Difference]: Finished difference. Result has 317 places, 311 transitions, 767 flow [2025-02-06 09:28:04,543 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=763, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=311, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=309, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=767, PETRI_PLACES=317, PETRI_TRANSITIONS=311} [2025-02-06 09:28:04,544 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -63 predicate places. [2025-02-06 09:28:04,544 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 311 transitions, 767 flow [2025-02-06 09:28:04,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.0) internal successors, (1119), 3 states have internal predecessors, (1119), 0 states have call successors, (0), 0 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:04,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:04,544 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:04,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-06 09:28:04,544 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread4Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:04,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash -1219087462, now seen corresponding path program 1 times [2025-02-06 09:28:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:04,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396793784] [2025-02-06 09:28:04,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:04,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:28:04,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:28:04,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:04,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:04,577 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:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396793784] [2025-02-06 09:28:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396793784] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884052819] [2025-02-06 09:28:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:04,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:04,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:04,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:04,661 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:04,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 311 transitions, 767 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 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:04,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:04,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:04,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:04,896 INFO L124 PetriNetUnfolderBase]: 190/2136 cut-off events. [2025-02-06 09:28:04,896 INFO L125 PetriNetUnfolderBase]: For 177/181 co-relation queries the response was YES. [2025-02-06 09:28:04,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2957 conditions, 2136 events. 190/2136 cut-off events. For 177/181 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17828 event pairs, 84 based on Foata normal form. 0/1987 useless extension candidates. Maximal degree in co-relation 2886. Up to 268 conditions per place. [2025-02-06 09:28:04,919 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/313 dead transitions. [2025-02-06 09:28:04,920 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 313 transitions, 832 flow [2025-02-06 09:28:04,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:04,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:04,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:04,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:04,921 INFO L175 Difference]: Start difference. First operand has 317 places, 311 transitions, 767 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:04,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 313 transitions, 832 flow [2025-02-06 09:28:04,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 316 places, 313 transitions, 828 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:04,926 INFO L231 Difference]: Finished difference. Result has 316 places, 310 transitions, 765 flow [2025-02-06 09:28:04,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=314, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=765, PETRI_PLACES=316, PETRI_TRANSITIONS=310} [2025-02-06 09:28:04,927 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -64 predicate places. [2025-02-06 09:28:04,927 INFO L471 AbstractCegarLoop]: Abstraction has has 316 places, 310 transitions, 765 flow [2025-02-06 09:28:04,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 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:04,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:04,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-06 09:28:04,928 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:04,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash -1255699023, now seen corresponding path program 1 times [2025-02-06 09:28:04,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:04,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533993777] [2025-02-06 09:28:04,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:04,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:04,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-06 09:28:04,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-06 09:28:04,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:04,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:04,961 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:04,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:04,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533993777] [2025-02-06 09:28:04,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533993777] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:04,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:04,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:04,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292349913] [2025-02-06 09:28:04,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:04,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:04,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:04,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:04,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:28:05,009 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 310 transitions, 765 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 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:05,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:28:05,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:05,367 INFO L124 PetriNetUnfolderBase]: 345/2703 cut-off events. [2025-02-06 09:28:05,367 INFO L125 PetriNetUnfolderBase]: For 284/287 co-relation queries the response was YES. [2025-02-06 09:28:05,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4075 conditions, 2703 events. 345/2703 cut-off events. For 284/287 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 24386 event pairs, 197 based on Foata normal form. 0/2541 useless extension candidates. Maximal degree in co-relation 3769. Up to 552 conditions per place. [2025-02-06 09:28:05,389 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/312 dead transitions. [2025-02-06 09:28:05,389 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 312 transitions, 834 flow [2025-02-06 09:28:05,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:28:05,391 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:28:05,394 INFO L175 Difference]: Start difference. First operand has 316 places, 310 transitions, 765 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:28:05,395 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 312 transitions, 834 flow [2025-02-06 09:28:05,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 312 transitions, 830 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:05,406 INFO L231 Difference]: Finished difference. Result has 315 places, 309 transitions, 763 flow [2025-02-06 09:28:05,406 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=759, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=763, PETRI_PLACES=315, PETRI_TRANSITIONS=309} [2025-02-06 09:28:05,407 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -65 predicate places. [2025-02-06 09:28:05,407 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 309 transitions, 763 flow [2025-02-06 09:28:05,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 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:05,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,407 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:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-06 09:28:05,407 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:05,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash 235119118, now seen corresponding path program 1 times [2025-02-06 09:28:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394393871] [2025-02-06 09:28:05,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-06 09:28:05,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-06 09:28:05,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:05,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:05,459 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:05,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:05,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394393871] [2025-02-06 09:28:05,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394393871] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:05,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:05,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:05,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102891648] [2025-02-06 09:28:05,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:05,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:05,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:05,461 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:05,461 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:05,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:05,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 309 transitions, 763 flow. Second operand has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 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:05,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:05,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:05,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:05,931 INFO L124 PetriNetUnfolderBase]: 539/3872 cut-off events. [2025-02-06 09:28:05,932 INFO L125 PetriNetUnfolderBase]: For 347/353 co-relation queries the response was YES. [2025-02-06 09:28:05,968 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5903 conditions, 3872 events. 539/3872 cut-off events. For 347/353 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 37343 event pairs, 310 based on Foata normal form. 0/3671 useless extension candidates. Maximal degree in co-relation 5514. Up to 766 conditions per place. [2025-02-06 09:28:05,980 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/311 dead transitions. [2025-02-06 09:28:05,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 311 transitions, 828 flow [2025-02-06 09:28:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:05,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:05,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:05,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:05,982 INFO L175 Difference]: Start difference. First operand has 315 places, 309 transitions, 763 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:05,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 311 transitions, 828 flow [2025-02-06 09:28:05,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 311 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:05,987 INFO L231 Difference]: Finished difference. Result has 314 places, 308 transitions, 761 flow [2025-02-06 09:28:05,987 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=757, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=761, PETRI_PLACES=314, PETRI_TRANSITIONS=308} [2025-02-06 09:28:05,988 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -66 predicate places. [2025-02-06 09:28:05,988 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 308 transitions, 761 flow [2025-02-06 09:28:05,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.3333333333333) internal successors, (1123), 3 states have internal predecessors, (1123), 0 states have call successors, (0), 0 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:05,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:05,989 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] [2025-02-06 09:28:05,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-02-06 09:28:05,989 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread4Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:05,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:05,990 INFO L85 PathProgramCache]: Analyzing trace with hash -460842334, now seen corresponding path program 1 times [2025-02-06 09:28:05,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309735060] [2025-02-06 09:28:05,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:05,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:05,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-02-06 09:28:06,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-02-06 09:28:06,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:06,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:06,026 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:06,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:06,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309735060] [2025-02-06 09:28:06,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309735060] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:06,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:06,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:06,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619757760] [2025-02-06 09:28:06,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:06,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:06,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:06,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:06,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:06,077 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:06,078 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 308 transitions, 761 flow. Second operand has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 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:06,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:06,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:06,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:06,301 INFO L124 PetriNetUnfolderBase]: 190/2095 cut-off events. [2025-02-06 09:28:06,301 INFO L125 PetriNetUnfolderBase]: For 185/189 co-relation queries the response was YES. [2025-02-06 09:28:06,310 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2934 conditions, 2095 events. 190/2095 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17333 event pairs, 84 based on Foata normal form. 0/1981 useless extension candidates. Maximal degree in co-relation 2776. Up to 268 conditions per place. [2025-02-06 09:28:06,313 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 27 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-02-06 09:28:06,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 315 places, 310 transitions, 826 flow [2025-02-06 09:28:06,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:06,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:06,319 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:06,319 INFO L175 Difference]: Start difference. First operand has 314 places, 308 transitions, 761 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:06,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 315 places, 310 transitions, 826 flow [2025-02-06 09:28:06,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 313 places, 310 transitions, 822 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:06,327 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 759 flow [2025-02-06 09:28:06,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=755, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=759, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2025-02-06 09:28:06,328 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -67 predicate places. [2025-02-06 09:28:06,328 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 759 flow [2025-02-06 09:28:06,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.6666666666667) internal successors, (1121), 3 states have internal predecessors, (1121), 0 states have call successors, (0), 0 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:06,331 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:06,331 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:06,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-02-06 09:28:06,332 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:06,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:06,332 INFO L85 PathProgramCache]: Analyzing trace with hash 525943355, now seen corresponding path program 1 times [2025-02-06 09:28:06,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:06,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748847149] [2025-02-06 09:28:06,332 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:06,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:06,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:28:06,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:28:06,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:06,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:06,382 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:06,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:06,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748847149] [2025-02-06 09:28:06,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [748847149] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:06,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:06,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:06,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339807873] [2025-02-06 09:28:06,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:06,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:06,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:06,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:06,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:06,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 367 out of 403 [2025-02-06 09:28:06,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 759 flow. Second operand has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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:06,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:06,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 367 of 403 [2025-02-06 09:28:06,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:06,737 INFO L124 PetriNetUnfolderBase]: 345/2646 cut-off events. [2025-02-06 09:28:06,737 INFO L125 PetriNetUnfolderBase]: For 281/284 co-relation queries the response was YES. [2025-02-06 09:28:06,761 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4018 conditions, 2646 events. 345/2646 cut-off events. For 281/284 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 23647 event pairs, 197 based on Foata normal form. 0/2529 useless extension candidates. Maximal degree in co-relation 3808. Up to 552 conditions per place. [2025-02-06 09:28:06,769 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 29 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-02-06 09:28:06,769 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 828 flow [2025-02-06 09:28:06,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:06,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1131 transitions. [2025-02-06 09:28:06,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9354838709677419 [2025-02-06 09:28:06,771 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 759 flow. Second operand 3 states and 1131 transitions. [2025-02-06 09:28:06,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 828 flow [2025-02-06 09:28:06,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 309 transitions, 824 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:06,775 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 757 flow [2025-02-06 09:28:06,776 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=753, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=304, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=757, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-02-06 09:28:06,776 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -68 predicate places. [2025-02-06 09:28:06,776 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 757 flow [2025-02-06 09:28:06,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 373.3333333333333) internal successors, (1120), 3 states have internal predecessors, (1120), 0 states have call successors, (0), 0 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:06,777 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:28:06,777 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] [2025-02-06 09:28:06,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-06 09:28:06,777 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err13ASSERT_VIOLATIONDATA_RACE, thread1Err12ASSERT_VIOLATIONDATA_RACE, thread1Err11ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE (and 127 more)] === [2025-02-06 09:28:06,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:28:06,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1200395942, now seen corresponding path program 1 times [2025-02-06 09:28:06,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:28:06,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738146408] [2025-02-06 09:28:06,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:28:06,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:28:06,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 09:28:06,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 09:28:06,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:28:06,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:28:06,800 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:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:28:06,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738146408] [2025-02-06 09:28:06,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738146408] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:28:06,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:28:06,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:28:06,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893528185] [2025-02-06 09:28:06,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:28:06,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:28:06,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:28:06,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:28:06,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:28:06,845 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 403 [2025-02-06 09:28:06,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 757 flow. Second operand has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:06,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:28:06,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 403 [2025-02-06 09:28:06,847 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:28:07,042 INFO L124 PetriNetUnfolderBase]: 190/2066 cut-off events. [2025-02-06 09:28:07,042 INFO L125 PetriNetUnfolderBase]: For 185/189 co-relation queries the response was YES. [2025-02-06 09:28:07,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2905 conditions, 2066 events. 190/2066 cut-off events. For 185/189 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 17066 event pairs, 84 based on Foata normal form. 0/1975 useless extension candidates. Maximal degree in co-relation 2757. Up to 268 conditions per place. [2025-02-06 09:28:07,060 INFO L140 encePairwiseOnDemand]: 400/403 looper letters, 0 selfloop transitions, 0 changer transitions 308/308 dead transitions. [2025-02-06 09:28:07,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 822 flow [2025-02-06 09:28:07,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:28:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:28:07,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1133 transitions. [2025-02-06 09:28:07,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9371381306865177 [2025-02-06 09:28:07,061 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 757 flow. Second operand 3 states and 1133 transitions. [2025-02-06 09:28:07,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 822 flow [2025-02-06 09:28:07,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 308 transitions, 818 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:28:07,064 INFO L231 Difference]: Finished difference. Result has 311 places, 0 transitions, 0 flow [2025-02-06 09:28:07,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=403, PETRI_DIFFERENCE_MINUEND_FLOW=751, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=311, PETRI_TRANSITIONS=0} [2025-02-06 09:28:07,065 INFO L279 CegarLoopForPetriNet]: 380 programPoint places, -69 predicate places. [2025-02-06 09:28:07,065 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 0 transitions, 0 flow [2025-02-06 09:28:07,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 374.6666666666667) internal successors, (1124), 3 states have internal predecessors, (1124), 0 states have call successors, (0), 0 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:07,067 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (130 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (129 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (128 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (127 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (126 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (125 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (124 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (123 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (122 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (121 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (120 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (119 of 131 remaining) [2025-02-06 09:28:07,068 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (118 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (117 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (116 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (115 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (114 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (113 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (112 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (111 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (110 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (109 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (108 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (107 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (106 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (105 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (104 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (103 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (102 of 131 remaining) [2025-02-06 09:28:07,069 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (101 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (100 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (99 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (98 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (97 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (96 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (95 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (94 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (93 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (92 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (91 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (90 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (89 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (88 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (87 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (86 of 131 remaining) [2025-02-06 09:28:07,070 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (85 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (84 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (83 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (82 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (81 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (80 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (79 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (78 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (77 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (76 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (75 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (74 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (73 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (72 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (71 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (70 of 131 remaining) [2025-02-06 09:28:07,071 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (69 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (68 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (67 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (66 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (65 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (64 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (63 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (62 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (61 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (60 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (59 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (58 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (57 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (56 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (55 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (54 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (53 of 131 remaining) [2025-02-06 09:28:07,072 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (52 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (51 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (50 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (49 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (48 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (47 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (46 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (45 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (42 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (41 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (40 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (39 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (38 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (37 of 131 remaining) [2025-02-06 09:28:07,073 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (36 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (35 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (33 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (32 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (31 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (30 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (29 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (28 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err13ASSERT_VIOLATIONDATA_RACE (27 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err12ASSERT_VIOLATIONDATA_RACE (26 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err11ASSERT_VIOLATIONDATA_RACE (25 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err10ASSERT_VIOLATIONDATA_RACE (24 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err9ASSERT_VIOLATIONDATA_RACE (23 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err8ASSERT_VIOLATIONDATA_RACE (22 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (21 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (20 of 131 remaining) [2025-02-06 09:28:07,074 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (19 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (18 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (17 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (16 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (15 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (14 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err13ASSERT_VIOLATIONDATA_RACE (13 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err12ASSERT_VIOLATIONDATA_RACE (12 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err11ASSERT_VIOLATIONDATA_RACE (11 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err10ASSERT_VIOLATIONDATA_RACE (10 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err9ASSERT_VIOLATIONDATA_RACE (9 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err8ASSERT_VIOLATIONDATA_RACE (8 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 131 remaining) [2025-02-06 09:28:07,075 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 131 remaining) [2025-02-06 09:28:07,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-02-06 09:28:07,076 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:28:07,080 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:28:07,080 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:28:07,084 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:28:07 BasicIcfg [2025-02-06 09:28:07,084 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:28:07,084 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:28:07,084 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:28:07,084 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:28:07,085 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:55" (3/4) ... [2025-02-06 09:28:07,086 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:28:07,088 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:28:07,088 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:28:07,088 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:28:07,088 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-06 09:28:07,091 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 09:28:07,092 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:28:07,092 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 09:28:07,092 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:28:07,161 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:28:07,162 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:28:07,162 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:28:07,162 INFO L158 Benchmark]: Toolchain (without parser) took 12716.03ms. Allocated memory was 142.6MB in the beginning and 889.2MB in the end (delta: 746.6MB). Free memory was 104.7MB in the beginning and 345.4MB in the end (delta: -240.7MB). Peak memory consumption was 502.3MB. Max. memory is 16.1GB. [2025-02-06 09:28:07,162 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:07,162 INFO L158 Benchmark]: CACSL2BoogieTranslator took 215.55ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 92.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:28:07,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.85ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:28:07,163 INFO L158 Benchmark]: Boogie Preprocessor took 15.06ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:28:07,163 INFO L158 Benchmark]: IcfgBuilder took 494.12ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 63.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-06 09:28:07,163 INFO L158 Benchmark]: TraceAbstraction took 11883.08ms. Allocated memory was 142.6MB in the beginning and 889.2MB in the end (delta: 746.6MB). Free memory was 63.1MB in the beginning and 353.8MB in the end (delta: -290.7MB). Peak memory consumption was 452.0MB. Max. memory is 16.1GB. [2025-02-06 09:28:07,163 INFO L158 Benchmark]: Witness Printer took 77.40ms. Allocated memory is still 889.2MB. Free memory was 353.8MB in the beginning and 345.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:28:07,164 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.16ms. Allocated memory is still 201.3MB. Free memory is still 125.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 215.55ms. Allocated memory is still 142.6MB. Free memory was 104.7MB in the beginning and 92.8MB in the end (delta: 12.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.85ms. Allocated memory is still 142.6MB. Free memory was 92.8MB in the beginning and 90.5MB in the end (delta: 2.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.06ms. Allocated memory is still 142.6MB. Free memory was 90.5MB in the beginning and 89.3MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 494.12ms. Allocated memory is still 142.6MB. Free memory was 89.3MB in the beginning and 63.1MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11883.08ms. Allocated memory was 142.6MB in the beginning and 889.2MB in the end (delta: 746.6MB). Free memory was 63.1MB in the beginning and 353.8MB in the end (delta: -290.7MB). Peak memory consumption was 452.0MB. Max. memory is 16.1GB. * Witness Printer took 77.40ms. Allocated memory is still 889.2MB. Free memory was 353.8MB in the beginning and 345.4MB 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: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 41]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 42]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 85]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 86]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 87]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 88]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 630 locations, 131 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: 11.7s, OverallIterations: 27, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 10.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2556 SdHoareTripleChecker+Valid, 2.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 824 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2583 IncrementalHoareTripleChecker+Invalid, 2749 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 542 mSDtfsCounter, 2583 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=785occurred in iteration=12, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2347 NumberOfCodeBlocks, 2347 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2320 ConstructedInterpolants, 0 QuantifiedInterpolants, 2374 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 71 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:28:07,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE