./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-name-comparator-subst.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 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:37,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:37,077 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:37,087 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:37,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:37,113 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:37,114 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:37,114 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:37,114 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:37,114 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:37,116 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:37,116 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:37,116 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:37,116 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:37,117 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:37,117 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:37,117 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:37,117 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:37,117 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:37,117 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:37,118 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:37,118 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:37,118 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:37,118 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:37,118 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:37,118 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:37,118 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:37,119 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:37,119 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:37,119 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:37,119 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:37,119 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:37,119 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:37,120 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:37,120 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:37,120 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:37,120 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:37,120 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:37,120 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:37,120 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:37,120 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:37,121 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:37,121 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:37,121 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:37,121 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:37,121 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:37,121 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 -> 3855d6da0b439f4c6a497e897f140f408df8c7fd65e3042f0fafae1979048a3d [2025-01-09 21:30:37,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:37,459 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:37,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:37,463 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:37,464 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:37,465 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-01-09 21:30:38,863 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d3db1cc/675e1a065a874ad5a80f2932cf0aea07/FLAG909117704 [2025-01-09 21:30:39,158 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:39,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-subst.wvr.c [2025-01-09 21:30:39,167 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d3db1cc/675e1a065a874ad5a80f2932cf0aea07/FLAG909117704 [2025-01-09 21:30:39,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/78d3db1cc/675e1a065a874ad5a80f2932cf0aea07 [2025-01-09 21:30:39,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:39,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:39,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:39,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:39,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:39,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@311e5e2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39, skipping insertion in model container [2025-01-09 21:30:39,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:39,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:39,463 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:39,521 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:39,538 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:39,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39 WrapperNode [2025-01-09 21:30:39,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:39,542 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:39,543 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:39,543 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:39,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,563 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,600 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 842 [2025-01-09 21:30:39,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:39,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:39,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:39,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:39,609 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,610 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,615 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,615 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,639 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,643 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,652 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,655 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,657 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,662 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:39,663 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:39,664 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:39,664 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:39,665 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (1/1) ... [2025-01-09 21:30:39,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:39,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:39,704 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-01-09 21:30:39,709 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-01-09 21:30:39,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:39,735 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:39,735 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:39,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:39,736 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:39,738 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:39,894 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:39,897 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:40,981 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:40,981 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:41,022 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:41,026 INFO L312 CfgBuilder]: Removed 3 assume(true) statements. [2025-01-09 21:30:41,026 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:41 BoogieIcfgContainer [2025-01-09 21:30:41,026 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:41,028 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:41,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:41,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:41,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:39" (1/3) ... [2025-01-09 21:30:41,035 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2d6f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:41, skipping insertion in model container [2025-01-09 21:30:41,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:39" (2/3) ... [2025-01-09 21:30:41,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a2d6f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:41, skipping insertion in model container [2025-01-09 21:30:41,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:41" (3/3) ... [2025-01-09 21:30:41,037 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-subst.wvr.c [2025-01-09 21:30:41,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:41,054 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-name-comparator-subst.wvr.c that has 4 procedures, 1055 locations, 1 initial locations, 4 loop locations, and 151 error locations. [2025-01-09 21:30:41,056 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:41,269 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:41,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1064 places, 1111 transitions, 2243 flow [2025-01-09 21:30:41,944 INFO L124 PetriNetUnfolderBase]: 57/1108 cut-off events. [2025-01-09 21:30:41,947 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:41,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1121 conditions, 1108 events. 57/1108 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3846 event pairs, 0 based on Foata normal form. 0/900 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-01-09 21:30:41,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 1064 places, 1111 transitions, 2243 flow [2025-01-09 21:30:42,023 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1041 places, 1085 transitions, 2188 flow [2025-01-09 21:30:42,035 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:42,052 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;@6c5747fa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:42,052 INFO L334 AbstractCegarLoop]: Starting to check reachability of 283 error locations. [2025-01-09 21:30:42,059 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:42,060 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2025-01-09 21:30:42,060 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:42,060 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:42,061 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] [2025-01-09 21:30:42,062 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:42,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:42,067 INFO L85 PathProgramCache]: Analyzing trace with hash 1799890258, now seen corresponding path program 1 times [2025-01-09 21:30:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:42,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221004035] [2025-01-09 21:30:42,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:42,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:42,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-09 21:30:42,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-09 21:30:42,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:42,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:42,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221004035] [2025-01-09 21:30:42,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221004035] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:42,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:42,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:42,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427787860] [2025-01-09 21:30:42,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:42,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:42,289 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:42,289 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:42,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:30:42,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:42,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:42,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:30:42,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:46,076 INFO L124 PetriNetUnfolderBase]: 612/12182 cut-off events. [2025-01-09 21:30:46,076 INFO L125 PetriNetUnfolderBase]: For 63/81 co-relation queries the response was YES. [2025-01-09 21:30:46,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12467 conditions, 12182 events. 612/12182 cut-off events. For 63/81 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 122997 event pairs, 95 based on Foata normal form. 281/9858 useless extension candidates. Maximal degree in co-relation 12186. Up to 185 conditions per place. [2025-01-09 21:30:46,320 INFO L140 encePairwiseOnDemand]: 1091/1111 looper letters, 19 selfloop transitions, 2 changer transitions 2/1067 dead transitions. [2025-01-09 21:30:46,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1042 places, 1067 transitions, 2194 flow [2025-01-09 21:30:46,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:46,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3246 transitions. [2025-01-09 21:30:46,354 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9738973897389739 [2025-01-09 21:30:46,356 INFO L175 Difference]: Start difference. First operand has 1041 places, 1085 transitions, 2188 flow. Second operand 3 states and 3246 transitions. [2025-01-09 21:30:46,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1042 places, 1067 transitions, 2194 flow [2025-01-09 21:30:46,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1036 places, 1067 transitions, 2182 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:46,390 INFO L231 Difference]: Finished difference. Result has 1036 places, 1065 transitions, 2140 flow [2025-01-09 21:30:46,395 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2140, PETRI_DIFFERENCE_MINUEND_PLACES=1034, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1067, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1065, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2140, PETRI_PLACES=1036, PETRI_TRANSITIONS=1065} [2025-01-09 21:30:46,400 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -5 predicate places. [2025-01-09 21:30:46,400 INFO L471 AbstractCegarLoop]: Abstraction has has 1036 places, 1065 transitions, 2140 flow [2025-01-09 21:30:46,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:46,403 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] [2025-01-09 21:30:46,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:46,404 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:46,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:46,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1025216527, now seen corresponding path program 1 times [2025-01-09 21:30:46,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:46,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421836362] [2025-01-09 21:30:46,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:46,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:46,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-01-09 21:30:46,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-01-09 21:30:46,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:46,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:46,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:46,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:46,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421836362] [2025-01-09 21:30:46,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421836362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:46,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:46,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:46,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795461118] [2025-01-09 21:30:46,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:46,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:46,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:46,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:46,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:46,630 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:30:46,633 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:46,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:46,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:30:46,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:47,906 INFO L124 PetriNetUnfolderBase]: 226/4392 cut-off events. [2025-01-09 21:30:47,907 INFO L125 PetriNetUnfolderBase]: For 13/20 co-relation queries the response was YES. [2025-01-09 21:30:47,961 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4521 conditions, 4392 events. 226/4392 cut-off events. For 13/20 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 32919 event pairs, 45 based on Foata normal form. 0/3471 useless extension candidates. Maximal degree in co-relation 4480. Up to 110 conditions per place. [2025-01-09 21:30:48,013 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1064 dead transitions. [2025-01-09 21:30:48,013 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1035 places, 1064 transitions, 2180 flow [2025-01-09 21:30:48,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-01-09 21:30:48,020 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-01-09 21:30:48,021 INFO L175 Difference]: Start difference. First operand has 1036 places, 1065 transitions, 2140 flow. Second operand 3 states and 3229 transitions. [2025-01-09 21:30:48,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1035 places, 1064 transitions, 2180 flow [2025-01-09 21:30:48,026 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1033 places, 1064 transitions, 2176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:48,036 INFO L231 Difference]: Finished difference. Result has 1033 places, 1064 transitions, 2138 flow [2025-01-09 21:30:48,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2134, PETRI_DIFFERENCE_MINUEND_PLACES=1031, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1064, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1062, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2138, PETRI_PLACES=1033, PETRI_TRANSITIONS=1064} [2025-01-09 21:30:48,039 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -8 predicate places. [2025-01-09 21:30:48,039 INFO L471 AbstractCegarLoop]: Abstraction has has 1033 places, 1064 transitions, 2138 flow [2025-01-09 21:30:48,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:48,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,041 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] [2025-01-09 21:30:48,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:48,042 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:48,043 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,046 INFO L85 PathProgramCache]: Analyzing trace with hash 2121402111, now seen corresponding path program 1 times [2025-01-09 21:30:48,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597980056] [2025-01-09 21:30:48,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-01-09 21:30:48,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-01-09 21:30:48,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:48,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:48,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:48,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597980056] [2025-01-09 21:30:48,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597980056] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:48,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:48,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:48,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163193497] [2025-01-09 21:30:48,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:48,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:48,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:48,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:48,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:48,211 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:30:48,218 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:48,218 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,218 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:30:48,218 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,567 INFO L124 PetriNetUnfolderBase]: 240/3577 cut-off events. [2025-01-09 21:30:49,567 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2025-01-09 21:30:49,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3776 conditions, 3577 events. 240/3577 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27454 event pairs, 95 based on Foata normal form. 0/2835 useless extension candidates. Maximal degree in co-relation 3727. Up to 185 conditions per place. [2025-01-09 21:30:49,717 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1063 dead transitions. [2025-01-09 21:30:49,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1034 places, 1063 transitions, 2178 flow [2025-01-09 21:30:49,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-01-09 21:30:49,726 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-01-09 21:30:49,727 INFO L175 Difference]: Start difference. First operand has 1033 places, 1064 transitions, 2138 flow. Second operand 3 states and 3229 transitions. [2025-01-09 21:30:49,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1034 places, 1063 transitions, 2178 flow [2025-01-09 21:30:49,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1032 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:49,747 INFO L231 Difference]: Finished difference. Result has 1032 places, 1063 transitions, 2136 flow [2025-01-09 21:30:49,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1030, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2136, PETRI_PLACES=1032, PETRI_TRANSITIONS=1063} [2025-01-09 21:30:49,750 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -9 predicate places. [2025-01-09 21:30:49,750 INFO L471 AbstractCegarLoop]: Abstraction has has 1032 places, 1063 transitions, 2136 flow [2025-01-09 21:30:49,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,753 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,753 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] [2025-01-09 21:30:49,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:49,753 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:49,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash -2105196401, now seen corresponding path program 1 times [2025-01-09 21:30:49,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241922456] [2025-01-09 21:30:49,754 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:30:49,780 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:30:49,784 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:49,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241922456] [2025-01-09 21:30:49,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241922456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605149070] [2025-01-09 21:30:49,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,893 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1111 [2025-01-09 21:30:49,898 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1111 [2025-01-09 21:30:49,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:51,364 INFO L124 PetriNetUnfolderBase]: 245/5502 cut-off events. [2025-01-09 21:30:51,364 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:51,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 5502 events. 245/5502 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 43627 event pairs, 16 based on Foata normal form. 0/4349 useless extension candidates. Maximal degree in co-relation 5521. Up to 51 conditions per place. [2025-01-09 21:30:51,579 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 18 selfloop transitions, 2 changer transitions 0/1062 dead transitions. [2025-01-09 21:30:51,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1033 places, 1062 transitions, 2174 flow [2025-01-09 21:30:51,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:51,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-01-09 21:30:51,585 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-01-09 21:30:51,585 INFO L175 Difference]: Start difference. First operand has 1032 places, 1063 transitions, 2136 flow. Second operand 3 states and 3231 transitions. [2025-01-09 21:30:51,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1033 places, 1062 transitions, 2174 flow [2025-01-09 21:30:51,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1062 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:51,600 INFO L231 Difference]: Finished difference. Result has 1031 places, 1062 transitions, 2134 flow [2025-01-09 21:30:51,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2130, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1062, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1060, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2134, PETRI_PLACES=1031, PETRI_TRANSITIONS=1062} [2025-01-09 21:30:51,603 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -10 predicate places. [2025-01-09 21:30:51,603 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1062 transitions, 2134 flow [2025-01-09 21:30:51,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:51,605 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:51,605 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:51,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:51,606 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:51,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:51,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1607440362, now seen corresponding path program 1 times [2025-01-09 21:30:51,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:51,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14273244] [2025-01-09 21:30:51,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:51,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:51,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-01-09 21:30:51,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-01-09 21:30:51,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:51,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:51,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:51,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:51,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14273244] [2025-01-09 21:30:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14273244] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:51,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:51,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369690411] [2025-01-09 21:30:51,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:51,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:51,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:51,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:51,714 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-01-09 21:30:51,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:51,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:51,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-01-09 21:30:51,720 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,211 INFO L124 PetriNetUnfolderBase]: 73/1611 cut-off events. [2025-01-09 21:30:52,212 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:30:52,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1672 conditions, 1611 events. 73/1611 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8221 event pairs, 12 based on Foata normal form. 0/1297 useless extension candidates. Maximal degree in co-relation 1607. Up to 40 conditions per place. [2025-01-09 21:30:52,249 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1061 dead transitions. [2025-01-09 21:30:52,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1032 places, 1061 transitions, 2166 flow [2025-01-09 21:30:52,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-01-09 21:30:52,255 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-01-09 21:30:52,255 INFO L175 Difference]: Start difference. First operand has 1031 places, 1062 transitions, 2134 flow. Second operand 3 states and 3237 transitions. [2025-01-09 21:30:52,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1032 places, 1061 transitions, 2166 flow [2025-01-09 21:30:52,261 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1030 places, 1061 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:52,271 INFO L231 Difference]: Finished difference. Result has 1030 places, 1061 transitions, 2132 flow [2025-01-09 21:30:52,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=1028, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1061, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1059, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1030, PETRI_TRANSITIONS=1061} [2025-01-09 21:30:52,274 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -11 predicate places. [2025-01-09 21:30:52,274 INFO L471 AbstractCegarLoop]: Abstraction has has 1030 places, 1061 transitions, 2132 flow [2025-01-09 21:30:52,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:52,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,277 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] [2025-01-09 21:30:52,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:52,277 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:52,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816569, now seen corresponding path program 1 times [2025-01-09 21:30:52,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200103497] [2025-01-09 21:30:52,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-01-09 21:30:52,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-01-09 21:30:52,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:52,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200103497] [2025-01-09 21:30:52,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200103497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254614866] [2025-01-09 21:30:52,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-01-09 21:30:52,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:52,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-01-09 21:30:52,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:53,288 INFO L124 PetriNetUnfolderBase]: 167/3835 cut-off events. [2025-01-09 21:30:53,288 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-01-09 21:30:53,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3889 conditions, 3835 events. 167/3835 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 26030 event pairs, 10 based on Foata normal form. 0/3045 useless extension candidates. Maximal degree in co-relation 3816. Up to 35 conditions per place. [2025-01-09 21:30:53,407 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2025-01-09 21:30:53,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1031 places, 1060 transitions, 2162 flow [2025-01-09 21:30:53,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:53,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:53,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-01-09 21:30:53,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-01-09 21:30:53,412 INFO L175 Difference]: Start difference. First operand has 1030 places, 1061 transitions, 2132 flow. Second operand 3 states and 3239 transitions. [2025-01-09 21:30:53,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1031 places, 1060 transitions, 2162 flow [2025-01-09 21:30:53,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1029 places, 1060 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:53,427 INFO L231 Difference]: Finished difference. Result has 1029 places, 1060 transitions, 2130 flow [2025-01-09 21:30:53,428 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1027, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1029, PETRI_TRANSITIONS=1060} [2025-01-09 21:30:53,429 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -12 predicate places. [2025-01-09 21:30:53,429 INFO L471 AbstractCegarLoop]: Abstraction has has 1029 places, 1060 transitions, 2130 flow [2025-01-09 21:30:53,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,431 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:53,431 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] [2025-01-09 21:30:53,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:53,431 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:53,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:53,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1296381887, now seen corresponding path program 1 times [2025-01-09 21:30:53,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:53,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126110462] [2025-01-09 21:30:53,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:53,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:53,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 21:30:53,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 21:30:53,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:53,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:53,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126110462] [2025-01-09 21:30:53,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126110462] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:53,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411769845] [2025-01-09 21:30:53,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:53,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:53,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:53,567 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-01-09 21:30:53,571 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,571 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,571 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-01-09 21:30:53,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,552 INFO L124 PetriNetUnfolderBase]: 349/7719 cut-off events. [2025-01-09 21:30:55,552 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:30:55,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7822 conditions, 7719 events. 349/7719 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 68371 event pairs, 24 based on Foata normal form. 0/6095 useless extension candidates. Maximal degree in co-relation 7741. Up to 70 conditions per place. [2025-01-09 21:30:55,706 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2025-01-09 21:30:55,706 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1059 transitions, 2174 flow [2025-01-09 21:30:55,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-01-09 21:30:55,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-01-09 21:30:55,710 INFO L175 Difference]: Start difference. First operand has 1029 places, 1060 transitions, 2130 flow. Second operand 3 states and 3225 transitions. [2025-01-09 21:30:55,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1059 transitions, 2174 flow [2025-01-09 21:30:55,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1059 transitions, 2170 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,728 INFO L231 Difference]: Finished difference. Result has 1028 places, 1059 transitions, 2128 flow [2025-01-09 21:30:55,730 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1028, PETRI_TRANSITIONS=1059} [2025-01-09 21:30:55,730 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -13 predicate places. [2025-01-09 21:30:55,730 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1059 transitions, 2128 flow [2025-01-09 21:30:55,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,733 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-01-09 21:30:55,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:55,733 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:55,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,734 INFO L85 PathProgramCache]: Analyzing trace with hash -197124144, now seen corresponding path program 1 times [2025-01-09 21:30:55,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666585324] [2025-01-09 21:30:55,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-01-09 21:30:55,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-01-09 21:30:55,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:55,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666585324] [2025-01-09 21:30:55,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666585324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370356657] [2025-01-09 21:30:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,789 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:30:55,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:30:55,855 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:57,022 INFO L124 PetriNetUnfolderBase]: 149/3282 cut-off events. [2025-01-09 21:30:57,022 INFO L125 PetriNetUnfolderBase]: For 9/30 co-relation queries the response was YES. [2025-01-09 21:30:57,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3351 conditions, 3282 events. 149/3282 cut-off events. For 9/30 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21662 event pairs, 16 based on Foata normal form. 0/2610 useless extension candidates. Maximal degree in co-relation 3262. Up to 52 conditions per place. [2025-01-09 21:30:57,162 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2025-01-09 21:30:57,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1058 transitions, 2168 flow [2025-01-09 21:30:57,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:57,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:57,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-01-09 21:30:57,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-01-09 21:30:57,166 INFO L175 Difference]: Start difference. First operand has 1028 places, 1059 transitions, 2128 flow. Second operand 3 states and 3229 transitions. [2025-01-09 21:30:57,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1058 transitions, 2168 flow [2025-01-09 21:30:57,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1058 transitions, 2164 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:57,182 INFO L231 Difference]: Finished difference. Result has 1027 places, 1058 transitions, 2126 flow [2025-01-09 21:30:57,184 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1027, PETRI_TRANSITIONS=1058} [2025-01-09 21:30:57,185 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -14 predicate places. [2025-01-09 21:30:57,185 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1058 transitions, 2126 flow [2025-01-09 21:30:57,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:57,187 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:57,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:57,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:57,188 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:57,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:57,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1963413266, now seen corresponding path program 1 times [2025-01-09 21:30:57,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:57,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898140203] [2025-01-09 21:30:57,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:57,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:57,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 21:30:57,200 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 21:30:57,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:57,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:57,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:57,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898140203] [2025-01-09 21:30:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898140203] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354291868] [2025-01-09 21:30:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:57,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:57,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:57,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:57,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-01-09 21:30:57,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:57,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:57,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-01-09 21:30:57,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:57,675 INFO L124 PetriNetUnfolderBase]: 73/1607 cut-off events. [2025-01-09 21:30:57,676 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-01-09 21:30:57,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1662 conditions, 1607 events. 73/1607 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7791 event pairs, 12 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 1565. Up to 40 conditions per place. [2025-01-09 21:30:57,728 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2025-01-09 21:30:57,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1057 transitions, 2158 flow [2025-01-09 21:30:57,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:57,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:57,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-01-09 21:30:57,732 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-01-09 21:30:57,732 INFO L175 Difference]: Start difference. First operand has 1027 places, 1058 transitions, 2126 flow. Second operand 3 states and 3237 transitions. [2025-01-09 21:30:57,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1057 transitions, 2158 flow [2025-01-09 21:30:57,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:57,743 INFO L231 Difference]: Finished difference. Result has 1026 places, 1057 transitions, 2124 flow [2025-01-09 21:30:57,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1026, PETRI_TRANSITIONS=1057} [2025-01-09 21:30:57,745 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -15 predicate places. [2025-01-09 21:30:57,745 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1057 transitions, 2124 flow [2025-01-09 21:30:57,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:57,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:57,747 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] [2025-01-09 21:30:57,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:57,747 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:57,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:57,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1959881965, now seen corresponding path program 1 times [2025-01-09 21:30:57,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:57,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040006556] [2025-01-09 21:30:57,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:57,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-01-09 21:30:57,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-01-09 21:30:57,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:57,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:57,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:57,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:57,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040006556] [2025-01-09 21:30:57,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040006556] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:57,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:57,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:57,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394078509] [2025-01-09 21:30:57,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:57,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:57,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:57,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:57,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:57,846 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-01-09 21:30:57,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:57,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:57,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-01-09 21:30:57,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:58,553 INFO L124 PetriNetUnfolderBase]: 107/2446 cut-off events. [2025-01-09 21:30:58,553 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-01-09 21:30:58,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2495 conditions, 2446 events. 107/2446 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13641 event pairs, 10 based on Foata normal form. 0/1958 useless extension candidates. Maximal degree in co-relation 2390. Up to 35 conditions per place. [2025-01-09 21:30:58,652 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2025-01-09 21:30:58,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1056 transitions, 2154 flow [2025-01-09 21:30:58,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:58,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-01-09 21:30:58,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-01-09 21:30:58,657 INFO L175 Difference]: Start difference. First operand has 1026 places, 1057 transitions, 2124 flow. Second operand 3 states and 3239 transitions. [2025-01-09 21:30:58,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1056 transitions, 2154 flow [2025-01-09 21:30:58,662 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:58,668 INFO L231 Difference]: Finished difference. Result has 1025 places, 1056 transitions, 2122 flow [2025-01-09 21:30:58,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1025, PETRI_TRANSITIONS=1056} [2025-01-09 21:30:58,670 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -16 predicate places. [2025-01-09 21:30:58,670 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1056 transitions, 2122 flow [2025-01-09 21:30:58,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:58,672 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:58,672 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-01-09 21:30:58,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:58,672 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:58,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:58,673 INFO L85 PathProgramCache]: Analyzing trace with hash 882612712, now seen corresponding path program 1 times [2025-01-09 21:30:58,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:58,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136773853] [2025-01-09 21:30:58,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:58,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:58,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 21:30:58,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 21:30:58,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:58,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:58,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:58,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:58,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136773853] [2025-01-09 21:30:58,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136773853] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:58,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:58,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:58,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781713295] [2025-01-09 21:30:58,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:58,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:58,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:58,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:58,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:58,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-01-09 21:30:58,795 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:58,795 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:58,795 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-01-09 21:30:58,795 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:59,822 INFO L124 PetriNetUnfolderBase]: 205/4391 cut-off events. [2025-01-09 21:30:59,822 INFO L125 PetriNetUnfolderBase]: For 13/111 co-relation queries the response was YES. [2025-01-09 21:30:59,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4482 conditions, 4391 events. 205/4391 cut-off events. For 13/111 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 32407 event pairs, 24 based on Foata normal form. 0/3479 useless extension candidates. Maximal degree in co-relation 4369. Up to 70 conditions per place. [2025-01-09 21:30:59,947 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2025-01-09 21:30:59,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1055 transitions, 2166 flow [2025-01-09 21:30:59,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:59,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:59,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-01-09 21:30:59,951 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-01-09 21:30:59,951 INFO L175 Difference]: Start difference. First operand has 1025 places, 1056 transitions, 2122 flow. Second operand 3 states and 3225 transitions. [2025-01-09 21:30:59,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1055 transitions, 2166 flow [2025-01-09 21:30:59,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:59,961 INFO L231 Difference]: Finished difference. Result has 1024 places, 1055 transitions, 2120 flow [2025-01-09 21:30:59,962 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1024, PETRI_TRANSITIONS=1055} [2025-01-09 21:30:59,963 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -17 predicate places. [2025-01-09 21:30:59,963 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1055 transitions, 2120 flow [2025-01-09 21:30:59,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:59,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:59,964 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] [2025-01-09 21:30:59,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:59,964 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:30:59,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:59,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1610694433, now seen corresponding path program 1 times [2025-01-09 21:30:59,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:59,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142164610] [2025-01-09 21:30:59,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:59,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:59,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 21:30:59,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 21:30:59,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:59,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:00,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:00,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:00,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142164610] [2025-01-09 21:31:00,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142164610] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:00,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:00,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:00,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126350840] [2025-01-09 21:31:00,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:00,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:00,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:00,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:00,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:00,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:31:00,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:00,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:00,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:31:00,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:00,364 INFO L124 PetriNetUnfolderBase]: 77/1572 cut-off events. [2025-01-09 21:31:00,364 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2025-01-09 21:31:00,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1635 conditions, 1572 events. 77/1572 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7464 event pairs, 16 based on Foata normal form. 0/1275 useless extension candidates. Maximal degree in co-relation 1514. Up to 54 conditions per place. [2025-01-09 21:31:00,415 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 19 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2025-01-09 21:31:00,415 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1054 transitions, 2160 flow [2025-01-09 21:31:00,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:00,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:00,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2025-01-09 21:31:00,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9687968796879688 [2025-01-09 21:31:00,419 INFO L175 Difference]: Start difference. First operand has 1024 places, 1055 transitions, 2120 flow. Second operand 3 states and 3229 transitions. [2025-01-09 21:31:00,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1054 transitions, 2160 flow [2025-01-09 21:31:00,425 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1054 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:00,431 INFO L231 Difference]: Finished difference. Result has 1023 places, 1054 transitions, 2118 flow [2025-01-09 21:31:00,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1023, PETRI_TRANSITIONS=1054} [2025-01-09 21:31:00,432 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -18 predicate places. [2025-01-09 21:31:00,433 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1054 transitions, 2118 flow [2025-01-09 21:31:00,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.3333333333333) internal successors, (3211), 3 states have internal predecessors, (3211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:00,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:00,433 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] [2025-01-09 21:31:00,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:31:00,434 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:00,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:00,434 INFO L85 PathProgramCache]: Analyzing trace with hash -1957137173, now seen corresponding path program 1 times [2025-01-09 21:31:00,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:00,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309866527] [2025-01-09 21:31:00,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:00,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:00,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 21:31:00,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 21:31:00,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:00,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:00,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:00,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:00,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309866527] [2025-01-09 21:31:00,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1309866527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:00,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:00,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:00,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600944197] [2025-01-09 21:31:00,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:00,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:00,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:00,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:00,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:00,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1073 out of 1111 [2025-01-09 21:31:00,512 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:00,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:00,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1073 of 1111 [2025-01-09 21:31:00,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:00,918 INFO L124 PetriNetUnfolderBase]: 73/1603 cut-off events. [2025-01-09 21:31:00,918 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-01-09 21:31:00,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1652 conditions, 1603 events. 73/1603 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7304 event pairs, 12 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1523. Up to 40 conditions per place. [2025-01-09 21:31:00,981 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2025-01-09 21:31:00,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1053 transitions, 2150 flow [2025-01-09 21:31:00,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3237 transitions. [2025-01-09 21:31:00,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9711971197119712 [2025-01-09 21:31:00,986 INFO L175 Difference]: Start difference. First operand has 1023 places, 1054 transitions, 2118 flow. Second operand 3 states and 3237 transitions. [2025-01-09 21:31:00,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1053 transitions, 2150 flow [2025-01-09 21:31:00,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:01,003 INFO L231 Difference]: Finished difference. Result has 1022 places, 1053 transitions, 2116 flow [2025-01-09 21:31:01,005 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1022, PETRI_TRANSITIONS=1053} [2025-01-09 21:31:01,007 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -19 predicate places. [2025-01-09 21:31:01,007 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1053 transitions, 2116 flow [2025-01-09 21:31:01,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:01,008 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:01,008 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:01,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:31:01,009 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:01,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:01,009 INFO L85 PathProgramCache]: Analyzing trace with hash 484825762, now seen corresponding path program 1 times [2025-01-09 21:31:01,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:01,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571374548] [2025-01-09 21:31:01,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:01,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:01,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 21:31:01,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 21:31:01,030 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:01,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:01,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:01,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:01,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571374548] [2025-01-09 21:31:01,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571374548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:01,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:01,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:01,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743936392] [2025-01-09 21:31:01,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:01,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:01,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:01,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:01,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:01,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1074 out of 1111 [2025-01-09 21:31:01,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:01,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:01,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1074 of 1111 [2025-01-09 21:31:01,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:01,388 INFO L124 PetriNetUnfolderBase]: 47/1072 cut-off events. [2025-01-09 21:31:01,388 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-01-09 21:31:01,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1072 events. 47/1072 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4396 event pairs, 10 based on Foata normal form. 0/887 useless extension candidates. Maximal degree in co-relation 979. Up to 35 conditions per place. [2025-01-09 21:31:01,432 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2025-01-09 21:31:01,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1052 transitions, 2146 flow [2025-01-09 21:31:01,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:01,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:01,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3239 transitions. [2025-01-09 21:31:01,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9717971797179717 [2025-01-09 21:31:01,437 INFO L175 Difference]: Start difference. First operand has 1022 places, 1053 transitions, 2116 flow. Second operand 3 states and 3239 transitions. [2025-01-09 21:31:01,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1052 transitions, 2146 flow [2025-01-09 21:31:01,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:01,454 INFO L231 Difference]: Finished difference. Result has 1021 places, 1052 transitions, 2114 flow [2025-01-09 21:31:01,456 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1021, PETRI_TRANSITIONS=1052} [2025-01-09 21:31:01,457 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -20 predicate places. [2025-01-09 21:31:01,457 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1052 transitions, 2114 flow [2025-01-09 21:31:01,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.3333333333333) internal successors, (3226), 3 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:01,458 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:01,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:01,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:31:01,459 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:01,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:01,460 INFO L85 PathProgramCache]: Analyzing trace with hash 482936545, now seen corresponding path program 1 times [2025-01-09 21:31:01,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:01,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626459104] [2025-01-09 21:31:01,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:01,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:01,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 21:31:01,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 21:31:01,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:01,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:01,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:01,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:01,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626459104] [2025-01-09 21:31:01,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626459104] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:01,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:01,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:01,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449612327] [2025-01-09 21:31:01,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:01,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:01,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:01,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:01,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:01,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1111 [2025-01-09 21:31:01,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:01,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:01,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1111 [2025-01-09 21:31:01,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:01,976 INFO L124 PetriNetUnfolderBase]: 85/1601 cut-off events. [2025-01-09 21:31:01,976 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2025-01-09 21:31:02,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1680 conditions, 1601 events. 85/1601 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8340 event pairs, 24 based on Foata normal form. 0/1295 useless extension candidates. Maximal degree in co-relation 1535. Up to 70 conditions per place. [2025-01-09 21:31:02,029 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2025-01-09 21:31:02,029 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1051 transitions, 2158 flow [2025-01-09 21:31:02,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2025-01-09 21:31:02,034 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9675967596759676 [2025-01-09 21:31:02,034 INFO L175 Difference]: Start difference. First operand has 1021 places, 1052 transitions, 2114 flow. Second operand 3 states and 3225 transitions. [2025-01-09 21:31:02,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1051 transitions, 2158 flow [2025-01-09 21:31:02,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:02,052 INFO L231 Difference]: Finished difference. Result has 1020 places, 1051 transitions, 2112 flow [2025-01-09 21:31:02,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1020, PETRI_TRANSITIONS=1051} [2025-01-09 21:31:02,054 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -21 predicate places. [2025-01-09 21:31:02,054 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1051 transitions, 2112 flow [2025-01-09 21:31:02,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:02,055 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:02,055 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:02,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:31:02,056 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:02,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:02,056 INFO L85 PathProgramCache]: Analyzing trace with hash -525881687, now seen corresponding path program 1 times [2025-01-09 21:31:02,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:02,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481623657] [2025-01-09 21:31:02,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:02,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:02,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:31:02,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:31:02,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:02,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:02,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:02,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:02,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481623657] [2025-01-09 21:31:02,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481623657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:02,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:02,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:31:02,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157307555] [2025-01-09 21:31:02,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:02,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:31:02,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:02,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:31:02,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:31:02,884 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1111 [2025-01-09 21:31:02,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:02,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:02,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1111 [2025-01-09 21:31:02,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:05,674 INFO L124 PetriNetUnfolderBase]: 893/12791 cut-off events. [2025-01-09 21:31:05,674 INFO L125 PetriNetUnfolderBase]: For 59/69 co-relation queries the response was YES. [2025-01-09 21:31:05,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13411 conditions, 12791 events. 893/12791 cut-off events. For 59/69 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 131972 event pairs, 264 based on Foata normal form. 0/10061 useless extension candidates. Maximal degree in co-relation 13259. Up to 580 conditions per place. [2025-01-09 21:31:05,916 INFO L140 encePairwiseOnDemand]: 1105/1111 looper letters, 26 selfloop transitions, 5 changer transitions 0/1050 dead transitions. [2025-01-09 21:31:05,916 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1050 transitions, 2172 flow [2025-01-09 21:31:05,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:05,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6392 transitions. [2025-01-09 21:31:05,922 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9588958895889589 [2025-01-09 21:31:05,922 INFO L175 Difference]: Start difference. First operand has 1020 places, 1051 transitions, 2112 flow. Second operand 6 states and 6392 transitions. [2025-01-09 21:31:05,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1050 transitions, 2172 flow [2025-01-09 21:31:05,925 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1050 transitions, 2168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:05,930 INFO L231 Difference]: Finished difference. Result has 1022 places, 1050 transitions, 2116 flow [2025-01-09 21:31:05,931 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2116, PETRI_PLACES=1022, PETRI_TRANSITIONS=1050} [2025-01-09 21:31:05,931 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -19 predicate places. [2025-01-09 21:31:05,931 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1050 transitions, 2116 flow [2025-01-09 21:31:05,932 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1061.5) internal successors, (6369), 6 states have internal predecessors, (6369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:05,932 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:05,932 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:05,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:31:05,933 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:05,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:05,933 INFO L85 PathProgramCache]: Analyzing trace with hash -1842040262, now seen corresponding path program 1 times [2025-01-09 21:31:05,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102718438] [2025-01-09 21:31:05,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:05,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:05,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 177 statements into 1 equivalence classes. [2025-01-09 21:31:05,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 177 of 177 statements. [2025-01-09 21:31:05,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:05,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:05,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:05,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:05,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102718438] [2025-01-09 21:31:05,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102718438] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:05,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:05,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:05,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230196316] [2025-01-09 21:31:05,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:05,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:05,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:05,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:05,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:06,009 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-01-09 21:31:06,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1050 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:06,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:06,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-01-09 21:31:06,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:06,788 INFO L124 PetriNetUnfolderBase]: 121/2610 cut-off events. [2025-01-09 21:31:06,788 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2025-01-09 21:31:06,822 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2669 conditions, 2610 events. 121/2610 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14446 event pairs, 15 based on Foata normal form. 0/2092 useless extension candidates. Maximal degree in co-relation 2651. Up to 43 conditions per place. [2025-01-09 21:31:06,845 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 12 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-01-09 21:31:06,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1049 transitions, 2142 flow [2025-01-09 21:31:06,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:06,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3243 transitions. [2025-01-09 21:31:06,852 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.972997299729973 [2025-01-09 21:31:06,852 INFO L175 Difference]: Start difference. First operand has 1022 places, 1050 transitions, 2116 flow. Second operand 3 states and 3243 transitions. [2025-01-09 21:31:06,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1049 transitions, 2142 flow [2025-01-09 21:31:06,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1049 transitions, 2132 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:06,866 INFO L231 Difference]: Finished difference. Result has 1018 places, 1049 transitions, 2108 flow [2025-01-09 21:31:06,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=1018, PETRI_TRANSITIONS=1049} [2025-01-09 21:31:06,869 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -23 predicate places. [2025-01-09 21:31:06,869 INFO L471 AbstractCegarLoop]: Abstraction has has 1018 places, 1049 transitions, 2108 flow [2025-01-09 21:31:06,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:06,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:06,871 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:06,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:31:06,871 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:06,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:06,872 INFO L85 PathProgramCache]: Analyzing trace with hash 101722188, now seen corresponding path program 1 times [2025-01-09 21:31:06,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:06,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856555328] [2025-01-09 21:31:06,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:06,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:06,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 188 statements into 1 equivalence classes. [2025-01-09 21:31:06,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 188 of 188 statements. [2025-01-09 21:31:06,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:06,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:06,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:06,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:06,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856555328] [2025-01-09 21:31:06,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856555328] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:06,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:06,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:06,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667015827] [2025-01-09 21:31:06,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:06,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:06,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:06,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:06,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:06,960 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-01-09 21:31:06,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 1049 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:06,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:06,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-01-09 21:31:06,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:08,162 INFO L124 PetriNetUnfolderBase]: 163/3539 cut-off events. [2025-01-09 21:31:08,162 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2025-01-09 21:31:08,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3617 conditions, 3539 events. 163/3539 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 22898 event pairs, 9 based on Foata normal form. 0/2821 useless extension candidates. Maximal degree in co-relation 3417. Up to 43 conditions per place. [2025-01-09 21:31:08,300 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2025-01-09 21:31:08,300 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1050 transitions, 2148 flow [2025-01-09 21:31:08,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:08,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-01-09 21:31:08,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-01-09 21:31:08,305 INFO L175 Difference]: Start difference. First operand has 1018 places, 1049 transitions, 2108 flow. Second operand 3 states and 3244 transitions. [2025-01-09 21:31:08,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1050 transitions, 2148 flow [2025-01-09 21:31:08,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1050 transitions, 2144 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:08,318 INFO L231 Difference]: Finished difference. Result has 1017 places, 1048 transitions, 2106 flow [2025-01-09 21:31:08,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1017, PETRI_TRANSITIONS=1048} [2025-01-09 21:31:08,319 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -24 predicate places. [2025-01-09 21:31:08,319 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1048 transitions, 2106 flow [2025-01-09 21:31:08,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1076.6666666666667) internal successors, (3230), 3 states have internal predecessors, (3230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:08,320 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:08,320 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:08,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:31:08,320 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:08,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:08,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1793335631, now seen corresponding path program 1 times [2025-01-09 21:31:08,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:08,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053989361] [2025-01-09 21:31:08,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:08,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:08,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 21:31:08,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 21:31:08,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:08,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:08,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:08,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:08,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053989361] [2025-01-09 21:31:08,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053989361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:08,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:08,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:08,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338363409] [2025-01-09 21:31:08,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:08,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:08,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:08,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:08,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:08,450 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:31:08,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:08,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:08,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:31:08,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:09,108 INFO L124 PetriNetUnfolderBase]: 115/2154 cut-off events. [2025-01-09 21:31:09,108 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:31:09,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2274 conditions, 2154 events. 115/2154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13225 event pairs, 26 based on Foata normal form. 0/1739 useless extension candidates. Maximal degree in co-relation 2062. Up to 73 conditions per place. [2025-01-09 21:31:09,179 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2025-01-09 21:31:09,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1049 transitions, 2158 flow [2025-01-09 21:31:09,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:09,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:09,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-01-09 21:31:09,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-01-09 21:31:09,183 INFO L175 Difference]: Start difference. First operand has 1017 places, 1048 transitions, 2106 flow. Second operand 3 states and 3232 transitions. [2025-01-09 21:31:09,183 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1049 transitions, 2158 flow [2025-01-09 21:31:09,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1049 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:09,201 INFO L231 Difference]: Finished difference. Result has 1016 places, 1047 transitions, 2104 flow [2025-01-09 21:31:09,202 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1016, PETRI_TRANSITIONS=1047} [2025-01-09 21:31:09,203 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -25 predicate places. [2025-01-09 21:31:09,203 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1047 transitions, 2104 flow [2025-01-09 21:31:09,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:09,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:09,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:31:09,205 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:09,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:09,206 INFO L85 PathProgramCache]: Analyzing trace with hash -1434559861, now seen corresponding path program 1 times [2025-01-09 21:31:09,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:09,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544281024] [2025-01-09 21:31:09,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:09,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:09,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-01-09 21:31:09,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-01-09 21:31:09,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:09,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:09,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:09,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:09,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544281024] [2025-01-09 21:31:09,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544281024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:09,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:09,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:09,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884921901] [2025-01-09 21:31:09,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:09,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:09,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:09,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:09,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:09,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-01-09 21:31:09,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:09,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-01-09 21:31:09,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:09,706 INFO L124 PetriNetUnfolderBase]: 79/1602 cut-off events. [2025-01-09 21:31:09,706 INFO L125 PetriNetUnfolderBase]: For 11/20 co-relation queries the response was YES. [2025-01-09 21:31:09,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1671 conditions, 1602 events. 79/1602 cut-off events. For 11/20 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7919 event pairs, 14 based on Foata normal form. 0/1299 useless extension candidates. Maximal degree in co-relation 1454. Up to 43 conditions per place. [2025-01-09 21:31:09,764 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2025-01-09 21:31:09,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1048 transitions, 2144 flow [2025-01-09 21:31:09,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:09,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-01-09 21:31:09,767 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-01-09 21:31:09,767 INFO L175 Difference]: Start difference. First operand has 1016 places, 1047 transitions, 2104 flow. Second operand 3 states and 3244 transitions. [2025-01-09 21:31:09,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1048 transitions, 2144 flow [2025-01-09 21:31:09,771 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1048 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:09,776 INFO L231 Difference]: Finished difference. Result has 1015 places, 1046 transitions, 2102 flow [2025-01-09 21:31:09,777 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1015, PETRI_TRANSITIONS=1046} [2025-01-09 21:31:09,777 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -26 predicate places. [2025-01-09 21:31:09,777 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1046 transitions, 2102 flow [2025-01-09 21:31:09,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.0) internal successors, (3231), 3 states have internal predecessors, (3231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,778 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:09,778 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:09,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:31:09,778 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:09,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:09,779 INFO L85 PathProgramCache]: Analyzing trace with hash -161109615, now seen corresponding path program 1 times [2025-01-09 21:31:09,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:09,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230641829] [2025-01-09 21:31:09,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:09,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:09,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 21:31:09,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 21:31:09,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:09,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:09,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:09,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:09,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230641829] [2025-01-09 21:31:09,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230641829] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:09,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:09,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:09,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140346425] [2025-01-09 21:31:09,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:09,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:09,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:09,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:09,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:09,855 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-01-09 21:31:09,857 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:09,857 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:09,857 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-01-09 21:31:09,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:11,911 INFO L124 PetriNetUnfolderBase]: 847/10614 cut-off events. [2025-01-09 21:31:11,911 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-01-09 21:31:12,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11414 conditions, 10614 events. 847/10614 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 103624 event pairs, 190 based on Foata normal form. 0/8479 useless extension candidates. Maximal degree in co-relation 10900. Up to 658 conditions per place. [2025-01-09 21:31:12,164 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1040 dead transitions. [2025-01-09 21:31:12,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1007 places, 1040 transitions, 2154 flow [2025-01-09 21:31:12,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:12,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:12,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-01-09 21:31:12,166 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-01-09 21:31:12,166 INFO L175 Difference]: Start difference. First operand has 1015 places, 1046 transitions, 2102 flow. Second operand 3 states and 3206 transitions. [2025-01-09 21:31:12,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1007 places, 1040 transitions, 2154 flow [2025-01-09 21:31:12,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1005 places, 1040 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:12,176 INFO L231 Difference]: Finished difference. Result has 1006 places, 1038 transitions, 2092 flow [2025-01-09 21:31:12,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=1003, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1036, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1034, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=1006, PETRI_TRANSITIONS=1038} [2025-01-09 21:31:12,177 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -35 predicate places. [2025-01-09 21:31:12,177 INFO L471 AbstractCegarLoop]: Abstraction has has 1006 places, 1038 transitions, 2092 flow [2025-01-09 21:31:12,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:12,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:12,178 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:12,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:31:12,178 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:12,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:12,179 INFO L85 PathProgramCache]: Analyzing trace with hash -207437357, now seen corresponding path program 1 times [2025-01-09 21:31:12,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:12,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-01-09 21:31:12,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:12,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:12,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-09 21:31:12,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-09 21:31:12,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:12,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:12,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:12,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:12,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817061164] [2025-01-09 21:31:12,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817061164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:12,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:12,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:12,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898850331] [2025-01-09 21:31:12,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:12,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:12,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:12,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:12,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:12,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-01-09 21:31:12,256 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:12,257 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:12,257 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-01-09 21:31:12,257 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:14,063 INFO L124 PetriNetUnfolderBase]: 451/6342 cut-off events. [2025-01-09 21:31:14,063 INFO L125 PetriNetUnfolderBase]: For 31/77 co-relation queries the response was YES. [2025-01-09 21:31:14,160 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6718 conditions, 6342 events. 451/6342 cut-off events. For 31/77 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 51721 event pairs, 110 based on Foata normal form. 1/5113 useless extension candidates. Maximal degree in co-relation 6242. Up to 340 conditions per place. [2025-01-09 21:31:14,214 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1032 dead transitions. [2025-01-09 21:31:14,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 998 places, 1032 transitions, 2144 flow [2025-01-09 21:31:14,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:14,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:14,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-01-09 21:31:14,216 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-01-09 21:31:14,216 INFO L175 Difference]: Start difference. First operand has 1006 places, 1038 transitions, 2092 flow. Second operand 3 states and 3206 transitions. [2025-01-09 21:31:14,216 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 998 places, 1032 transitions, 2144 flow [2025-01-09 21:31:14,219 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 998 places, 1032 transitions, 2144 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:14,226 INFO L231 Difference]: Finished difference. Result has 999 places, 1030 transitions, 2086 flow [2025-01-09 21:31:14,227 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=996, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1030} [2025-01-09 21:31:14,228 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-01-09 21:31:14,228 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1030 transitions, 2086 flow [2025-01-09 21:31:14,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.3333333333333) internal successors, (3169), 3 states have internal predecessors, (3169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:14,229 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:14,229 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:14,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:31:14,230 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:14,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:14,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1392494503, now seen corresponding path program 1 times [2025-01-09 21:31:14,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:14,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879812768] [2025-01-09 21:31:14,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:14,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:14,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-09 21:31:14,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-09 21:31:14,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:14,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:14,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:14,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879812768] [2025-01-09 21:31:14,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879812768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:14,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:14,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:14,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093323974] [2025-01-09 21:31:14,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:14,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:14,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:14,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:14,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:14,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:31:14,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1030 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:14,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:14,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:31:14,335 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,077 INFO L124 PetriNetUnfolderBase]: 166/2871 cut-off events. [2025-01-09 21:31:15,078 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2025-01-09 21:31:15,140 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3040 conditions, 2871 events. 166/2871 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 20381 event pairs, 37 based on Foata normal form. 0/2341 useless extension candidates. Maximal degree in co-relation 2250. Up to 106 conditions per place. [2025-01-09 21:31:15,170 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1031 dead transitions. [2025-01-09 21:31:15,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1000 places, 1031 transitions, 2138 flow [2025-01-09 21:31:15,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-01-09 21:31:15,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-01-09 21:31:15,172 INFO L175 Difference]: Start difference. First operand has 999 places, 1030 transitions, 2086 flow. Second operand 3 states and 3232 transitions. [2025-01-09 21:31:15,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1000 places, 1031 transitions, 2138 flow [2025-01-09 21:31:15,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1031 transitions, 2138 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:15,181 INFO L231 Difference]: Finished difference. Result has 1000 places, 1029 transitions, 2088 flow [2025-01-09 21:31:15,181 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1029, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1027, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2088, PETRI_PLACES=1000, PETRI_TRANSITIONS=1029} [2025-01-09 21:31:15,182 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -41 predicate places. [2025-01-09 21:31:15,182 INFO L471 AbstractCegarLoop]: Abstraction has has 1000 places, 1029 transitions, 2088 flow [2025-01-09 21:31:15,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:15,183 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,183 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:15,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:31:15,183 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:15,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,184 INFO L85 PathProgramCache]: Analyzing trace with hash 599212859, now seen corresponding path program 1 times [2025-01-09 21:31:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137069165] [2025-01-09 21:31:15,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,193 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 21:31:15,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 21:31:15,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:15,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137069165] [2025-01-09 21:31:15,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2137069165] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854595427] [2025-01-09 21:31:15,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,225 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1075 out of 1111 [2025-01-09 21:31:15,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:15,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1075 of 1111 [2025-01-09 21:31:15,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:15,727 INFO L124 PetriNetUnfolderBase]: 105/2080 cut-off events. [2025-01-09 21:31:15,727 INFO L125 PetriNetUnfolderBase]: For 21/35 co-relation queries the response was YES. [2025-01-09 21:31:15,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 2080 events. 105/2080 cut-off events. For 21/35 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11787 event pairs, 14 based on Foata normal form. 1/1711 useless extension candidates. Maximal degree in co-relation 1934. Up to 48 conditions per place. [2025-01-09 21:31:15,785 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1030 dead transitions. [2025-01-09 21:31:15,785 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1001 places, 1030 transitions, 2128 flow [2025-01-09 21:31:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:15,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3244 transitions. [2025-01-09 21:31:15,787 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9732973297329733 [2025-01-09 21:31:15,787 INFO L175 Difference]: Start difference. First operand has 1000 places, 1029 transitions, 2088 flow. Second operand 3 states and 3244 transitions. [2025-01-09 21:31:15,787 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1001 places, 1030 transitions, 2128 flow [2025-01-09 21:31:15,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 999 places, 1030 transitions, 2124 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:15,797 INFO L231 Difference]: Finished difference. Result has 999 places, 1028 transitions, 2086 flow [2025-01-09 21:31:15,798 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2082, PETRI_DIFFERENCE_MINUEND_PLACES=997, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1028, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1026, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2086, PETRI_PLACES=999, PETRI_TRANSITIONS=1028} [2025-01-09 21:31:15,798 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -42 predicate places. [2025-01-09 21:31:15,798 INFO L471 AbstractCegarLoop]: Abstraction has has 999 places, 1028 transitions, 2086 flow [2025-01-09 21:31:15,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:15,799 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:15,799 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:15,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:31:15,799 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:15,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:15,800 INFO L85 PathProgramCache]: Analyzing trace with hash 694123096, now seen corresponding path program 1 times [2025-01-09 21:31:15,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:15,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837527403] [2025-01-09 21:31:15,800 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:15,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:15,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 201 statements into 1 equivalence classes. [2025-01-09 21:31:15,812 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 201 of 201 statements. [2025-01-09 21:31:15,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:15,812 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:15,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:15,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837527403] [2025-01-09 21:31:15,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837527403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:15,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:15,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:15,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323082802] [2025-01-09 21:31:15,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:15,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:15,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:15,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:15,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:15,875 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1111 [2025-01-09 21:31:15,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 999 places, 1028 transitions, 2086 flow. Second operand has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:15,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:15,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1111 [2025-01-09 21:31:15,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:16,664 INFO L124 PetriNetUnfolderBase]: 191/3773 cut-off events. [2025-01-09 21:31:16,664 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:31:16,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3916 conditions, 3773 events. 191/3773 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 25686 event pairs, 8 based on Foata normal form. 0/3081 useless extension candidates. Maximal degree in co-relation 3438. Up to 42 conditions per place. [2025-01-09 21:31:16,775 INFO L140 encePairwiseOnDemand]: 1097/1111 looper letters, 18 selfloop transitions, 9 changer transitions 0/1029 dead transitions. [2025-01-09 21:31:16,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1029 transitions, 2144 flow [2025-01-09 21:31:16,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:16,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3230 transitions. [2025-01-09 21:31:16,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9690969096909691 [2025-01-09 21:31:16,778 INFO L175 Difference]: Start difference. First operand has 999 places, 1028 transitions, 2086 flow. Second operand 3 states and 3230 transitions. [2025-01-09 21:31:16,778 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1029 transitions, 2144 flow [2025-01-09 21:31:16,782 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1029 transitions, 2140 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:16,790 INFO L231 Difference]: Finished difference. Result has 995 places, 1027 transitions, 2115 flow [2025-01-09 21:31:16,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2072, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1023, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1014, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2115, PETRI_PLACES=995, PETRI_TRANSITIONS=1027} [2025-01-09 21:31:16,791 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -46 predicate places. [2025-01-09 21:31:16,791 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1027 transitions, 2115 flow [2025-01-09 21:31:16,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.3333333333333) internal successors, (3202), 3 states have internal predecessors, (3202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:16,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:16,792 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:16,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:31:16,792 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:16,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:16,793 INFO L85 PathProgramCache]: Analyzing trace with hash 58297970, now seen corresponding path program 1 times [2025-01-09 21:31:16,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:16,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735892852] [2025-01-09 21:31:16,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:16,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:16,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 21:31:16,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 21:31:16,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:16,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:16,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:16,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:16,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735892852] [2025-01-09 21:31:16,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735892852] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:16,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:16,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:16,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140465966] [2025-01-09 21:31:16,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:16,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:16,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:16,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:16,868 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1055 out of 1111 [2025-01-09 21:31:16,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1027 transitions, 2115 flow. Second operand has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:16,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:16,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1055 of 1111 [2025-01-09 21:31:16,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:20,689 INFO L124 PetriNetUnfolderBase]: 1568/19955 cut-off events. [2025-01-09 21:31:20,689 INFO L125 PetriNetUnfolderBase]: For 147/153 co-relation queries the response was YES. [2025-01-09 21:31:20,896 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21201 conditions, 19955 events. 1568/19955 cut-off events. For 147/153 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 223551 event pairs, 488 based on Foata normal form. 0/16098 useless extension candidates. Maximal degree in co-relation 15929. Up to 1183 conditions per place. [2025-01-09 21:31:21,030 INFO L140 encePairwiseOnDemand]: 1099/1111 looper letters, 29 selfloop transitions, 2 changer transitions 0/1021 dead transitions. [2025-01-09 21:31:21,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 987 places, 1021 transitions, 2167 flow [2025-01-09 21:31:21,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:21,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:21,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3206 transitions. [2025-01-09 21:31:21,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.961896189618962 [2025-01-09 21:31:21,033 INFO L175 Difference]: Start difference. First operand has 995 places, 1027 transitions, 2115 flow. Second operand 3 states and 3206 transitions. [2025-01-09 21:31:21,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 987 places, 1021 transitions, 2167 flow [2025-01-09 21:31:21,038 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 986 places, 1021 transitions, 2158 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:21,046 INFO L231 Difference]: Finished difference. Result has 987 places, 1019 transitions, 2100 flow [2025-01-09 21:31:21,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2086, PETRI_DIFFERENCE_MINUEND_PLACES=984, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1019} [2025-01-09 21:31:21,048 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2025-01-09 21:31:21,048 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1019 transitions, 2100 flow [2025-01-09 21:31:21,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1056.6666666666667) internal successors, (3170), 3 states have internal predecessors, (3170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:21,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:21,049 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:21,049 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 21:31:21,050 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:21,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:21,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1673497062, now seen corresponding path program 1 times [2025-01-09 21:31:21,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:21,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366800621] [2025-01-09 21:31:21,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:21,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:21,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 21:31:21,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 21:31:21,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:21,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:21,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:21,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366800621] [2025-01-09 21:31:21,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366800621] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:21,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:21,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:21,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579757597] [2025-01-09 21:31:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:21,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:21,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:21,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:21,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:21,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1111 [2025-01-09 21:31:21,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1019 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:21,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:21,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1111 [2025-01-09 21:31:21,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,086 INFO L124 PetriNetUnfolderBase]: 261/5106 cut-off events. [2025-01-09 21:31:22,086 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2025-01-09 21:31:22,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5306 conditions, 5106 events. 261/5106 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 44350 event pairs, 20 based on Foata normal form. 1/4217 useless extension candidates. Maximal degree in co-relation 4580. Up to 68 conditions per place. [2025-01-09 21:31:22,193 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 3 changer transitions 0/1020 dead transitions. [2025-01-09 21:31:22,193 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 988 places, 1020 transitions, 2154 flow [2025-01-09 21:31:22,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3238 transitions. [2025-01-09 21:31:22,196 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9714971497149715 [2025-01-09 21:31:22,196 INFO L175 Difference]: Start difference. First operand has 987 places, 1019 transitions, 2100 flow. Second operand 3 states and 3238 transitions. [2025-01-09 21:31:22,196 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 988 places, 1020 transitions, 2154 flow [2025-01-09 21:31:22,201 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 988 places, 1020 transitions, 2154 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:31:22,209 INFO L231 Difference]: Finished difference. Result has 988 places, 1018 transitions, 2104 flow [2025-01-09 21:31:22,211 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=986, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1018, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=988, PETRI_TRANSITIONS=1018} [2025-01-09 21:31:22,211 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -53 predicate places. [2025-01-09 21:31:22,211 INFO L471 AbstractCegarLoop]: Abstraction has has 988 places, 1018 transitions, 2104 flow [2025-01-09 21:31:22,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.6666666666667) internal successors, (3221), 3 states have internal predecessors, (3221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,212 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:22,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 21:31:22,213 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:22,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash -47294260, now seen corresponding path program 1 times [2025-01-09 21:31:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439759834] [2025-01-09 21:31:22,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 21:31:22,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 21:31:22,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:22,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439759834] [2025-01-09 21:31:22,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439759834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592511011] [2025-01-09 21:31:22,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:22,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:31:22,308 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1018 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,308 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:22,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:31:22,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:22,852 INFO L124 PetriNetUnfolderBase]: 180/3058 cut-off events. [2025-01-09 21:31:22,852 INFO L125 PetriNetUnfolderBase]: For 46/60 co-relation queries the response was YES. [2025-01-09 21:31:22,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3265 conditions, 3058 events. 180/3058 cut-off events. For 46/60 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 22190 event pairs, 37 based on Foata normal form. 1/2538 useless extension candidates. Maximal degree in co-relation 2527. Up to 139 conditions per place. [2025-01-09 21:31:22,928 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 22 selfloop transitions, 2 changer transitions 0/1019 dead transitions. [2025-01-09 21:31:22,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 1019 transitions, 2156 flow [2025-01-09 21:31:22,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:22,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:22,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3232 transitions. [2025-01-09 21:31:22,930 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9696969696969697 [2025-01-09 21:31:22,930 INFO L175 Difference]: Start difference. First operand has 988 places, 1018 transitions, 2104 flow. Second operand 3 states and 3232 transitions. [2025-01-09 21:31:22,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 1019 transitions, 2156 flow [2025-01-09 21:31:22,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 987 places, 1019 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:22,942 INFO L231 Difference]: Finished difference. Result has 987 places, 1017 transitions, 2100 flow [2025-01-09 21:31:22,944 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=985, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1017, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1015, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2100, PETRI_PLACES=987, PETRI_TRANSITIONS=1017} [2025-01-09 21:31:22,944 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -54 predicate places. [2025-01-09 21:31:22,944 INFO L471 AbstractCegarLoop]: Abstraction has has 987 places, 1017 transitions, 2100 flow [2025-01-09 21:31:22,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:22,945 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:22,945 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:22,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 21:31:22,945 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:22,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:22,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1590798286, now seen corresponding path program 1 times [2025-01-09 21:31:22,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:22,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082554080] [2025-01-09 21:31:22,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:22,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:22,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 207 statements into 1 equivalence classes. [2025-01-09 21:31:22,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 207 of 207 statements. [2025-01-09 21:31:22,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:22,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:22,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:22,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082554080] [2025-01-09 21:31:22,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082554080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:22,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:22,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:22,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376579103] [2025-01-09 21:31:22,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:22,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:22,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:22,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:22,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:23,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-01-09 21:31:23,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 987 places, 1017 transitions, 2100 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:23,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:23,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-01-09 21:31:23,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:24,010 INFO L124 PetriNetUnfolderBase]: 298/5500 cut-off events. [2025-01-09 21:31:24,010 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2025-01-09 21:31:24,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 5500 events. 298/5500 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 45008 event pairs, 15 based on Foata normal form. 0/4551 useless extension candidates. Maximal degree in co-relation 5387. Up to 68 conditions per place. [2025-01-09 21:31:24,136 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 20 selfloop transitions, 9 changer transitions 0/1017 dead transitions. [2025-01-09 21:31:24,136 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1017 transitions, 2160 flow [2025-01-09 21:31:24,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:24,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3224 transitions. [2025-01-09 21:31:24,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9672967296729673 [2025-01-09 21:31:24,138 INFO L175 Difference]: Start difference. First operand has 987 places, 1017 transitions, 2100 flow. Second operand 3 states and 3224 transitions. [2025-01-09 21:31:24,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1017 transitions, 2160 flow [2025-01-09 21:31:24,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1017 transitions, 2156 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:24,150 INFO L231 Difference]: Finished difference. Result has 982 places, 1015 transitions, 2127 flow [2025-01-09 21:31:24,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2084, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1002, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2127, PETRI_PLACES=982, PETRI_TRANSITIONS=1015} [2025-01-09 21:31:24,152 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-01-09 21:31:24,153 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1015 transitions, 2127 flow [2025-01-09 21:31:24,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:24,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:24,153 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:24,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 21:31:24,154 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:24,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:24,154 INFO L85 PathProgramCache]: Analyzing trace with hash 775749465, now seen corresponding path program 1 times [2025-01-09 21:31:24,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:24,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818832914] [2025-01-09 21:31:24,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:24,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:24,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 21:31:24,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 21:31:24,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:24,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:24,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:24,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818832914] [2025-01-09 21:31:24,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818832914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:24,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702718797] [2025-01-09 21:31:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:24,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:24,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:24,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:24,247 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-01-09 21:31:24,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1015 transitions, 2127 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:24,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:24,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-01-09 21:31:24,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,234 INFO L124 PetriNetUnfolderBase]: 285/5368 cut-off events. [2025-01-09 21:31:25,234 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2025-01-09 21:31:25,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5675 conditions, 5368 events. 285/5368 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 47588 event pairs, 30 based on Foata normal form. 0/4450 useless extension candidates. Maximal degree in co-relation 5082. Up to 105 conditions per place. [2025-01-09 21:31:25,325 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 23 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2025-01-09 21:31:25,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1016 transitions, 2183 flow [2025-01-09 21:31:25,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3236 transitions. [2025-01-09 21:31:25,327 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9708970897089709 [2025-01-09 21:31:25,327 INFO L175 Difference]: Start difference. First operand has 982 places, 1015 transitions, 2127 flow. Second operand 3 states and 3236 transitions. [2025-01-09 21:31:25,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1016 transitions, 2183 flow [2025-01-09 21:31:25,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1016 transitions, 2174 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:25,350 INFO L231 Difference]: Finished difference. Result has 982 places, 1014 transitions, 2122 flow [2025-01-09 21:31:25,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=982, PETRI_TRANSITIONS=1014} [2025-01-09 21:31:25,352 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -59 predicate places. [2025-01-09 21:31:25,352 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1014 transitions, 2122 flow [2025-01-09 21:31:25,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:25,357 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:25,357 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:25,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 21:31:25,357 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:25,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:25,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1208557965, now seen corresponding path program 1 times [2025-01-09 21:31:25,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:25,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053287232] [2025-01-09 21:31:25,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:25,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:25,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 21:31:25,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 21:31:25,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:25,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:25,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:25,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:25,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053287232] [2025-01-09 21:31:25,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053287232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:25,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:25,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:25,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946522460] [2025-01-09 21:31:25,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:25,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:25,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:25,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:25,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:25,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1111 [2025-01-09 21:31:25,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1014 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:25,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:25,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1111 [2025-01-09 21:31:25,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:25,997 INFO L124 PetriNetUnfolderBase]: 174/3080 cut-off events. [2025-01-09 21:31:25,998 INFO L125 PetriNetUnfolderBase]: For 38/48 co-relation queries the response was YES. [2025-01-09 21:31:26,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3335 conditions, 3080 events. 174/3080 cut-off events. For 38/48 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 21923 event pairs, 21 based on Foata normal form. 2/2608 useless extension candidates. Maximal degree in co-relation 2561. Up to 91 conditions per place. [2025-01-09 21:31:26,073 INFO L140 encePairwiseOnDemand]: 1096/1111 looper letters, 16 selfloop transitions, 8 changer transitions 14/1014 dead transitions. [2025-01-09 21:31:26,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 978 places, 1014 transitions, 2180 flow [2025-01-09 21:31:26,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:26,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:26,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3223 transitions. [2025-01-09 21:31:26,076 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.966996699669967 [2025-01-09 21:31:26,076 INFO L175 Difference]: Start difference. First operand has 982 places, 1014 transitions, 2122 flow. Second operand 3 states and 3223 transitions. [2025-01-09 21:31:26,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 978 places, 1014 transitions, 2180 flow [2025-01-09 21:31:26,082 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 976 places, 1014 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:26,090 INFO L231 Difference]: Finished difference. Result has 977 places, 998 transitions, 2111 flow [2025-01-09 21:31:26,091 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=974, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1000, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=977, PETRI_TRANSITIONS=998} [2025-01-09 21:31:26,092 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -64 predicate places. [2025-01-09 21:31:26,092 INFO L471 AbstractCegarLoop]: Abstraction has has 977 places, 998 transitions, 2111 flow [2025-01-09 21:31:26,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:26,093 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:26,093 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:26,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 21:31:26,093 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:26,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:26,094 INFO L85 PathProgramCache]: Analyzing trace with hash -667847520, now seen corresponding path program 1 times [2025-01-09 21:31:26,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:26,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614921524] [2025-01-09 21:31:26,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:26,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:26,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-09 21:31:26,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-09 21:31:26,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:26,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:26,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614921524] [2025-01-09 21:31:26,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614921524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:26,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:26,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:26,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947807283] [2025-01-09 21:31:26,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:26,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:26,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:26,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:26,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:26,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-01-09 21:31:26,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 977 places, 998 transitions, 2111 flow. Second operand has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:26,181 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:26,181 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-01-09 21:31:26,181 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:27,173 INFO L124 PetriNetUnfolderBase]: 215/4625 cut-off events. [2025-01-09 21:31:27,174 INFO L125 PetriNetUnfolderBase]: For 40/50 co-relation queries the response was YES. [2025-01-09 21:31:27,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 4625 events. 215/4625 cut-off events. For 40/50 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 39055 event pairs, 4 based on Foata normal form. 1/3903 useless extension candidates. Maximal degree in co-relation 4558. Up to 73 conditions per place. [2025-01-09 21:31:27,311 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 16 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2025-01-09 21:31:27,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 1003 transitions, 2161 flow [2025-01-09 21:31:27,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:27,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:27,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3253 transitions. [2025-01-09 21:31:27,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975997599759976 [2025-01-09 21:31:27,314 INFO L175 Difference]: Start difference. First operand has 977 places, 998 transitions, 2111 flow. Second operand 3 states and 3253 transitions. [2025-01-09 21:31:27,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 1003 transitions, 2161 flow [2025-01-09 21:31:27,320 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 1003 transitions, 2153 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:27,326 INFO L231 Difference]: Finished difference. Result has 966 places, 999 transitions, 2117 flow [2025-01-09 21:31:27,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2117, PETRI_PLACES=966, PETRI_TRANSITIONS=999} [2025-01-09 21:31:27,328 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -75 predicate places. [2025-01-09 21:31:27,328 INFO L471 AbstractCegarLoop]: Abstraction has has 966 places, 999 transitions, 2117 flow [2025-01-09 21:31:27,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.3333333333333) internal successors, (3241), 3 states have internal predecessors, (3241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:27,329 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:27,329 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:27,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 21:31:27,329 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:27,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:27,330 INFO L85 PathProgramCache]: Analyzing trace with hash -425078946, now seen corresponding path program 1 times [2025-01-09 21:31:27,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:27,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025940732] [2025-01-09 21:31:27,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:27,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:27,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 21:31:27,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 21:31:27,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:27,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:27,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:27,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:27,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025940732] [2025-01-09 21:31:27,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025940732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:27,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:27,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:27,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624696280] [2025-01-09 21:31:27,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:27,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:27,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:27,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:27,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:27,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-01-09 21:31:27,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 999 transitions, 2117 flow. Second operand has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:27,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:27,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-01-09 21:31:27,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:29,396 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2025-01-09 21:31:29,396 INFO L125 PetriNetUnfolderBase]: For 6/42 co-relation queries the response was YES. [2025-01-09 21:31:29,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9831 conditions, 9044 events. 488/9044 cut-off events. For 6/42 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 83262 event pairs, 14 based on Foata normal form. 2/7653 useless extension candidates. Maximal degree in co-relation 8207. Up to 166 conditions per place. [2025-01-09 21:31:29,617 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2025-01-09 21:31:29,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2179 flow [2025-01-09 21:31:29,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:29,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:29,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-01-09 21:31:29,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-01-09 21:31:29,620 INFO L175 Difference]: Start difference. First operand has 966 places, 999 transitions, 2117 flow. Second operand 3 states and 3211 transitions. [2025-01-09 21:31:29,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2179 flow [2025-01-09 21:31:29,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:29,634 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2025-01-09 21:31:29,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2025-01-09 21:31:29,635 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-01-09 21:31:29,636 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2025-01-09 21:31:29,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1058.6666666666667) internal successors, (3176), 3 states have internal predecessors, (3176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:29,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:29,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:29,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 21:31:29,637 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:29,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:29,638 INFO L85 PathProgramCache]: Analyzing trace with hash 533937417, now seen corresponding path program 1 times [2025-01-09 21:31:29,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:29,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99812618] [2025-01-09 21:31:29,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:29,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:29,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:31:29,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:31:29,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:29,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:29,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:29,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:29,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99812618] [2025-01-09 21:31:29,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99812618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:29,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:29,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:29,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923725838] [2025-01-09 21:31:29,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:29,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:29,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:29,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:29,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:29,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-01-09 21:31:29,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:29,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:29,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-01-09 21:31:29,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:30,684 INFO L124 PetriNetUnfolderBase]: 243/3759 cut-off events. [2025-01-09 21:31:30,685 INFO L125 PetriNetUnfolderBase]: For 199/217 co-relation queries the response was YES. [2025-01-09 21:31:30,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4283 conditions, 3759 events. 243/3759 cut-off events. For 199/217 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 30942 event pairs, 36 based on Foata normal form. 1/3174 useless extension candidates. Maximal degree in co-relation 3606. Up to 212 conditions per place. [2025-01-09 21:31:30,817 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 20 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2025-01-09 21:31:30,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2201 flow [2025-01-09 21:31:30,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:30,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:30,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2025-01-09 21:31:30,820 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96999699969997 [2025-01-09 21:31:30,820 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3233 transitions. [2025-01-09 21:31:30,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2201 flow [2025-01-09 21:31:30,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2183 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:30,833 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2025-01-09 21:31:30,835 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2025-01-09 21:31:30,835 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -81 predicate places. [2025-01-09 21:31:30,835 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2025-01-09 21:31:30,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.3333333333333) internal successors, (3220), 3 states have internal predecessors, (3220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:30,836 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:30,836 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:30,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 21:31:30,836 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:30,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:30,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1584053146, now seen corresponding path program 1 times [2025-01-09 21:31:30,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:30,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464401398] [2025-01-09 21:31:30,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:30,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:30,845 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 216 statements into 1 equivalence classes. [2025-01-09 21:31:30,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 216 of 216 statements. [2025-01-09 21:31:30,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:30,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:30,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:30,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:30,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464401398] [2025-01-09 21:31:30,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464401398] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:30,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:30,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:30,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136571017] [2025-01-09 21:31:30,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:30,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:30,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:30,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:30,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:30,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:31:30,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:30,933 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:30,933 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:31:30,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:32,628 INFO L124 PetriNetUnfolderBase]: 367/7045 cut-off events. [2025-01-09 21:31:32,628 INFO L125 PetriNetUnfolderBase]: For 97/135 co-relation queries the response was YES. [2025-01-09 21:31:32,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 7045 events. 367/7045 cut-off events. For 97/135 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 68006 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6189. Up to 147 conditions per place. [2025-01-09 21:31:32,810 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2025-01-09 21:31:32,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2195 flow [2025-01-09 21:31:32,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-01-09 21:31:32,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-01-09 21:31:32,812 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3231 transitions. [2025-01-09 21:31:32,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2195 flow [2025-01-09 21:31:32,816 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:32,821 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2025-01-09 21:31:32,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2025-01-09 21:31:32,822 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -82 predicate places. [2025-01-09 21:31:32,823 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2025-01-09 21:31:32,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:32,823 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:32,823 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:32,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 21:31:32,824 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:32,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:32,825 INFO L85 PathProgramCache]: Analyzing trace with hash 663853270, now seen corresponding path program 1 times [2025-01-09 21:31:32,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:32,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682861689] [2025-01-09 21:31:32,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:32,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:32,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-01-09 21:31:32,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-01-09 21:31:32,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:32,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:32,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:32,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:32,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682861689] [2025-01-09 21:31:32,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682861689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:32,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:32,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:32,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823962945] [2025-01-09 21:31:32,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:32,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:32,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:32,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:32,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:32,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-01-09 21:31:32,910 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:32,910 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:32,910 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-01-09 21:31:32,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:34,657 INFO L124 PetriNetUnfolderBase]: 267/5701 cut-off events. [2025-01-09 21:31:34,657 INFO L125 PetriNetUnfolderBase]: For 14/70 co-relation queries the response was YES. [2025-01-09 21:31:34,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6100 conditions, 5701 events. 267/5701 cut-off events. For 14/70 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 50621 event pairs, 8 based on Foata normal form. 0/4817 useless extension candidates. Maximal degree in co-relation 4923. Up to 89 conditions per place. [2025-01-09 21:31:34,936 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2025-01-09 21:31:34,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2025-01-09 21:31:34,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:34,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:34,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3252 transitions. [2025-01-09 21:31:34,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9756975697569757 [2025-01-09 21:31:34,938 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3252 transitions. [2025-01-09 21:31:34,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2025-01-09 21:31:34,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:34,952 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2025-01-09 21:31:34,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2025-01-09 21:31:34,954 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -80 predicate places. [2025-01-09 21:31:34,954 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2025-01-09 21:31:34,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1080.6666666666667) internal successors, (3242), 3 states have internal predecessors, (3242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:34,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:34,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:34,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 21:31:34,955 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:34,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:34,956 INFO L85 PathProgramCache]: Analyzing trace with hash -560865100, now seen corresponding path program 1 times [2025-01-09 21:31:34,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:34,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766917282] [2025-01-09 21:31:34,956 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:34,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:34,966 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:31:34,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:31:34,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:34,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:34,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:34,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:34,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766917282] [2025-01-09 21:31:34,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766917282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:34,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:34,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:34,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024254841] [2025-01-09 21:31:34,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:34,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:34,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:34,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:34,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:35,045 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-01-09 21:31:35,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:35,046 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:35,046 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-01-09 21:31:35,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:38,228 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2025-01-09 21:31:38,228 INFO L125 PetriNetUnfolderBase]: For 84/240 co-relation queries the response was YES. [2025-01-09 21:31:38,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11798 conditions, 10693 events. 631/10693 cut-off events. For 84/240 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 110388 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9704. Up to 336 conditions per place. [2025-01-09 21:31:38,779 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2025-01-09 21:31:38,779 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2025-01-09 21:31:38,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:38,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:38,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-01-09 21:31:38,781 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-01-09 21:31:38,781 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3211 transitions. [2025-01-09 21:31:38,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2025-01-09 21:31:38,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:38,794 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2025-01-09 21:31:38,795 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2025-01-09 21:31:38,795 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -85 predicate places. [2025-01-09 21:31:38,795 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2025-01-09 21:31:38,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.0) internal successors, (3177), 3 states have internal predecessors, (3177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:38,796 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:38,796 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:38,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 21:31:38,796 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:38,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:38,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1498456347, now seen corresponding path program 1 times [2025-01-09 21:31:38,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:38,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311202499] [2025-01-09 21:31:38,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:38,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:38,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-09 21:31:38,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-09 21:31:38,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:38,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:38,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:38,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311202499] [2025-01-09 21:31:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1311202499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:38,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:38,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:38,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489924544] [2025-01-09 21:31:38,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:38,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:38,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:38,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:38,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:38,882 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:31:38,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:38,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:38,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:31:38,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:41,518 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2025-01-09 21:31:41,518 INFO L125 PetriNetUnfolderBase]: For 386/637 co-relation queries the response was YES. [2025-01-09 21:31:41,900 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9793 conditions, 8694 events. 484/8694 cut-off events. For 386/637 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 92361 event pairs, 59 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7686. Up to 284 conditions per place. [2025-01-09 21:31:42,037 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2025-01-09 21:31:42,037 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2025-01-09 21:31:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-01-09 21:31:42,039 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-01-09 21:31:42,039 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3231 transitions. [2025-01-09 21:31:42,039 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2025-01-09 21:31:42,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:42,049 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2025-01-09 21:31:42,051 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2025-01-09 21:31:42,051 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -86 predicate places. [2025-01-09 21:31:42,051 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2025-01-09 21:31:42,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:42,052 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:42,052 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:42,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 21:31:42,052 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:42,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:42,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1472517456, now seen corresponding path program 1 times [2025-01-09 21:31:42,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:42,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129317775] [2025-01-09 21:31:42,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:42,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:42,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 21:31:42,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 21:31:42,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:42,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:42,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:42,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:42,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129317775] [2025-01-09 21:31:42,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129317775] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:42,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:42,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:42,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44296871] [2025-01-09 21:31:42,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:42,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:42,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:42,093 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:42,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:42,118 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-01-09 21:31:42,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:42,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:42,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-01-09 21:31:42,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:43,663 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2025-01-09 21:31:43,663 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2025-01-09 21:31:43,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 48368 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2025-01-09 21:31:43,888 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2025-01-09 21:31:43,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2025-01-09 21:31:43,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:43,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:43,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-01-09 21:31:43,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-01-09 21:31:43,890 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3235 transitions. [2025-01-09 21:31:43,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2025-01-09 21:31:43,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:43,898 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2025-01-09 21:31:43,899 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2025-01-09 21:31:43,899 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -90 predicate places. [2025-01-09 21:31:43,899 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2025-01-09 21:31:43,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1072.6666666666667) internal successors, (3218), 3 states have internal predecessors, (3218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:43,900 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:43,900 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:43,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-01-09 21:31:43,900 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:43,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 191723451, now seen corresponding path program 1 times [2025-01-09 21:31:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:43,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163192600] [2025-01-09 21:31:43,901 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:43,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:43,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 21:31:43,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 21:31:43,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:43,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:43,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:43,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163192600] [2025-01-09 21:31:43,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163192600] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:43,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:43,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:31:43,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335258838] [2025-01-09 21:31:43,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:43,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:43,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:43,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:43,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:43,980 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1078 out of 1111 [2025-01-09 21:31:43,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:43,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:43,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1078 of 1111 [2025-01-09 21:31:43,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:46,565 INFO L124 PetriNetUnfolderBase]: 386/8449 cut-off events. [2025-01-09 21:31:46,565 INFO L125 PetriNetUnfolderBase]: For 37/73 co-relation queries the response was YES. [2025-01-09 21:31:46,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9048 conditions, 8449 events. 386/8449 cut-off events. For 37/73 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 77374 event pairs, 16 based on Foata normal form. 2/7129 useless extension candidates. Maximal degree in co-relation 7625. Up to 183 conditions per place. [2025-01-09 21:31:46,834 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2025-01-09 21:31:46,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2025-01-09 21:31:46,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:46,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:46,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3251 transitions. [2025-01-09 21:31:46,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9753975397539754 [2025-01-09 21:31:46,836 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3251 transitions. [2025-01-09 21:31:46,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2025-01-09 21:31:46,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:46,845 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2025-01-09 21:31:46,846 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=953, PETRI_TRANSITIONS=986} [2025-01-09 21:31:46,846 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -88 predicate places. [2025-01-09 21:31:46,846 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2025-01-09 21:31:46,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1081.0) internal successors, (3243), 3 states have internal predecessors, (3243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:46,847 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:46,847 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:46,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 21:31:46,847 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:46,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:46,848 INFO L85 PathProgramCache]: Analyzing trace with hash 988921081, now seen corresponding path program 1 times [2025-01-09 21:31:46,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:46,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217836159] [2025-01-09 21:31:46,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:46,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:46,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-01-09 21:31:46,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-01-09 21:31:46,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:46,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:46,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:46,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:46,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217836159] [2025-01-09 21:31:46,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217836159] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:46,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:46,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:46,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630001807] [2025-01-09 21:31:46,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:46,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:46,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:46,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:46,886 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:46,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1057 out of 1111 [2025-01-09 21:31:46,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:46,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:46,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1057 of 1111 [2025-01-09 21:31:46,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:50,147 INFO L124 PetriNetUnfolderBase]: 674/9720 cut-off events. [2025-01-09 21:31:50,147 INFO L125 PetriNetUnfolderBase]: For 301/368 co-relation queries the response was YES. [2025-01-09 21:31:50,404 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11215 conditions, 9720 events. 674/9720 cut-off events. For 301/368 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 108499 event pairs, 166 based on Foata normal form. 2/8329 useless extension candidates. Maximal degree in co-relation 9620. Up to 682 conditions per place. [2025-01-09 21:31:50,494 INFO L140 encePairwiseOnDemand]: 1094/1111 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2025-01-09 21:31:50,494 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2025-01-09 21:31:50,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:50,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:50,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2025-01-09 21:31:50,496 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9633963396339634 [2025-01-09 21:31:50,496 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3211 transitions. [2025-01-09 21:31:50,496 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2025-01-09 21:31:50,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:31:50,505 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2025-01-09 21:31:50,505 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2197, PETRI_PLACES=948, PETRI_TRANSITIONS=982} [2025-01-09 21:31:50,506 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -93 predicate places. [2025-01-09 21:31:50,506 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2025-01-09 21:31:50,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1059.3333333333333) internal successors, (3178), 3 states have internal predecessors, (3178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:50,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:50,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:50,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 21:31:50,507 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:50,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:50,507 INFO L85 PathProgramCache]: Analyzing trace with hash -699724715, now seen corresponding path program 1 times [2025-01-09 21:31:50,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:50,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119299322] [2025-01-09 21:31:50,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:50,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 21:31:50,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 21:31:50,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:50,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:50,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:50,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:50,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119299322] [2025-01-09 21:31:50,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119299322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:50,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:50,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:50,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538702208] [2025-01-09 21:31:50,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:50,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:50,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:50,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:50,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:50,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1111 [2025-01-09 21:31:50,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:50,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:50,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1111 [2025-01-09 21:31:50,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:53,633 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2025-01-09 21:31:53,633 INFO L125 PetriNetUnfolderBase]: For 903/986 co-relation queries the response was YES. [2025-01-09 21:31:54,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 903/986 co-relation queries the response was YES. Maximal size of possible extension queue 157. Compared 112715 event pairs, 190 based on Foata normal form. 2/8817 useless extension candidates. Maximal degree in co-relation 10496. Up to 585 conditions per place. [2025-01-09 21:31:54,146 INFO L140 encePairwiseOnDemand]: 1108/1111 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2025-01-09 21:31:54,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2025-01-09 21:31:54,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:54,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:54,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3231 transitions. [2025-01-09 21:31:54,147 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9693969396939695 [2025-01-09 21:31:54,148 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3231 transitions. [2025-01-09 21:31:54,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2025-01-09 21:31:54,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:54,158 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2025-01-09 21:31:54,159 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=947, PETRI_TRANSITIONS=981} [2025-01-09 21:31:54,159 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -94 predicate places. [2025-01-09 21:31:54,159 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2025-01-09 21:31:54,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.6666666666667) internal successors, (3215), 3 states have internal predecessors, (3215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:54,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:54,160 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:54,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 21:31:54,160 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:54,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:54,160 INFO L85 PathProgramCache]: Analyzing trace with hash 12710063, now seen corresponding path program 1 times [2025-01-09 21:31:54,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:54,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239547182] [2025-01-09 21:31:54,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:54,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:54,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 21:31:54,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 21:31:54,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:54,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:54,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:54,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:54,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239547182] [2025-01-09 21:31:54,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239547182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:54,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:54,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:54,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534114460] [2025-01-09 21:31:54,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:54,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:54,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:54,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:54,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:54,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1071 out of 1111 [2025-01-09 21:31:54,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:54,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:54,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1071 of 1111 [2025-01-09 21:31:54,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:57,923 INFO L124 PetriNetUnfolderBase]: 450/8876 cut-off events. [2025-01-09 21:31:57,923 INFO L125 PetriNetUnfolderBase]: For 66/88 co-relation queries the response was YES. [2025-01-09 21:31:58,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10032 conditions, 8876 events. 450/8876 cut-off events. For 66/88 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 92284 event pairs, 11 based on Foata normal form. 0/7728 useless extension candidates. Maximal degree in co-relation 7688. Up to 204 conditions per place. [2025-01-09 21:31:58,258 INFO L140 encePairwiseOnDemand]: 1104/1111 looper letters, 15 selfloop transitions, 3 changer transitions 0/979 dead transitions. [2025-01-09 21:31:58,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 945 places, 979 transitions, 2217 flow [2025-01-09 21:31:58,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:58,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:58,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2025-01-09 21:31:58,261 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9705970597059705 [2025-01-09 21:31:58,261 INFO L175 Difference]: Start difference. First operand has 947 places, 981 transitions, 2183 flow. Second operand 3 states and 3235 transitions. [2025-01-09 21:31:58,261 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 945 places, 979 transitions, 2217 flow [2025-01-09 21:31:58,265 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 943 places, 979 transitions, 2211 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:58,270 INFO L231 Difference]: Finished difference. Result has 943 places, 977 transitions, 2175 flow [2025-01-09 21:31:58,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1111, PETRI_DIFFERENCE_MINUEND_FLOW=2169, PETRI_DIFFERENCE_MINUEND_PLACES=941, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=977, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=974, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2175, PETRI_PLACES=943, PETRI_TRANSITIONS=977} [2025-01-09 21:31:58,271 INFO L279 CegarLoopForPetriNet]: 1041 programPoint places, -98 predicate places. [2025-01-09 21:31:58,271 INFO L471 AbstractCegarLoop]: Abstraction has has 943 places, 977 transitions, 2175 flow [2025-01-09 21:31:58,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1073.0) internal successors, (3219), 3 states have internal predecessors, (3219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:58,272 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:58,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 21:31:58,272 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 279 more)] === [2025-01-09 21:31:58,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:58,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2077844897, now seen corresponding path program 1 times [2025-01-09 21:31:58,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:58,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331838716] [2025-01-09 21:31:58,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:58,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:58,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-09 21:31:58,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-09 21:31:58,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:58,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:58,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:58,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331838716] [2025-01-09 21:31:58,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331838716] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:58,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:58,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:58,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064093601] [2025-01-09 21:31:58,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:58,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:58,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:58,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:58,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:58,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1076 out of 1111 [2025-01-09 21:31:58,331 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 943 places, 977 transitions, 2175 flow. Second operand has 3 states, 3 states have (on average 1077.3333333333333) internal successors, (3232), 3 states have internal predecessors, (3232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:58,331 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:58,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1076 of 1111 [2025-01-09 21:31:58,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand