./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i --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/pthread-race-challenges/per-thread-index-inc-race-2.i -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 729ea5b7f047316231f562bf88a66f84bb913811f2b458cb706ab3ed78d2b3a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:36:50,098 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:36:50,159 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:36:50,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:36:50,165 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:36:50,187 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:36:50,188 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:36:50,188 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:36:50,188 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:36:50,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:36:50,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:36:50,188 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:36:50,188 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:36:50,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:36:50,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:36:50,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:50,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:50,191 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:36:50,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:36:50,192 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:36:50,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:36:50,192 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 -> 729ea5b7f047316231f562bf88a66f84bb913811f2b458cb706ab3ed78d2b3a0 [2025-01-09 21:36:50,439 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:36:50,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:36:50,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:36:50,450 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:36:50,450 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:36:50,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i [2025-01-09 21:36:51,594 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d64dd4b42/65d655ba4beb480388c5636a4df6c2ad/FLAGad2e1a2cb [2025-01-09 21:36:51,878 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:36:51,880 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-inc-race-2.i [2025-01-09 21:36:51,897 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d64dd4b42/65d655ba4beb480388c5636a4df6c2ad/FLAGad2e1a2cb [2025-01-09 21:36:52,152 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d64dd4b42/65d655ba4beb480388c5636a4df6c2ad [2025-01-09 21:36:52,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:36:52,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:36:52,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:52,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:36:52,159 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:36:52,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29192b8d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52, skipping insertion in model container [2025-01-09 21:36:52,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,178 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:36:52,540 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:52,549 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:36:52,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:36:52,609 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:36:52,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52 WrapperNode [2025-01-09 21:36:52,610 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:36:52,611 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:52,611 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:36:52,611 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:36:52,615 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:36:52" (1/1) ... [2025-01-09 21:36:52,624 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:36:52" (1/1) ... [2025-01-09 21:36:52,637 INFO L138 Inliner]: procedures = 277, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 70 [2025-01-09 21:36:52,637 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:36:52,637 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:36:52,637 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:36:52,637 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:36:52,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,645 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,645 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,649 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,650 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,651 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,652 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,653 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,654 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:36:52,655 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:36:52,655 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:36:52,655 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:36:52,655 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (1/1) ... [2025-01-09 21:36:52,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:36:52,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:36:52,688 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:36:52,696 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:36:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:36:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:36:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:36:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:36:52,711 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:36:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:36:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:36:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:36:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-01-09 21:36:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-01-09 21:36:52,712 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:36:52,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:36:52,713 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:36:52,810 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:36:52,811 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:36:53,019 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:36:53,019 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:36:53,029 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:36:53,029 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:36:53,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:53 BoogieIcfgContainer [2025-01-09 21:36:53,029 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:36:53,030 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:36:53,031 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:36:53,033 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:36:53,033 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:36:52" (1/3) ... [2025-01-09 21:36:53,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41563637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:53, skipping insertion in model container [2025-01-09 21:36:53,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:36:52" (2/3) ... [2025-01-09 21:36:53,034 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41563637 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:36:53, skipping insertion in model container [2025-01-09 21:36:53,034 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:36:53" (3/3) ... [2025-01-09 21:36:53,035 INFO L128 eAbstractionObserver]: Analyzing ICFG per-thread-index-inc-race-2.i [2025-01-09 21:36:53,044 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:36:53,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG per-thread-index-inc-race-2.i that has 2 procedures, 119 locations, 1 initial locations, 2 loop locations, and 9 error locations. [2025-01-09 21:36:53,045 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:36:53,087 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:36:53,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 122 places, 121 transitions, 249 flow [2025-01-09 21:36:53,185 INFO L124 PetriNetUnfolderBase]: 2/154 cut-off events. [2025-01-09 21:36:53,189 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:36:53,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 154 events. 2/154 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 242 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 70. Up to 3 conditions per place. [2025-01-09 21:36:53,195 INFO L82 GeneralOperation]: Start removeDead. Operand has 122 places, 121 transitions, 249 flow [2025-01-09 21:36:53,199 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 121 transitions, 249 flow [2025-01-09 21:36:53,205 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:36:53,212 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;@1855d4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:36:53,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-01-09 21:36:53,218 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:36:53,219 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-01-09 21:36:53,219 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:36:53,219 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:53,219 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:53,220 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:53,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:53,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1888059827, now seen corresponding path program 1 times [2025-01-09 21:36:53,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:53,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179503060] [2025-01-09 21:36:53,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:53,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:53,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:36:53,295 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:36:53,295 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:53,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:53,384 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:36:53,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:53,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179503060] [2025-01-09 21:36:53,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179503060] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:53,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:53,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:53,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679924332] [2025-01-09 21:36:53,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:53,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:53,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:53,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:53,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:53,431 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 121 [2025-01-09 21:36:53,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 121 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:36:53,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:53,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 121 [2025-01-09 21:36:53,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:53,511 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-01-09 21:36:53,511 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:36:53,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 230 events. 7/230 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 579 event pairs, 6 based on Foata normal form. 1/203 useless extension candidates. Maximal degree in co-relation 172. Up to 25 conditions per place. [2025-01-09 21:36:53,513 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 10 selfloop transitions, 2 changer transitions 1/119 dead transitions. [2025-01-09 21:36:53,513 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 119 transitions, 269 flow [2025-01-09 21:36:53,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:53,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 335 transitions. [2025-01-09 21:36:53,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9228650137741047 [2025-01-09 21:36:53,525 INFO L175 Difference]: Start difference. First operand has 122 places, 121 transitions, 249 flow. Second operand 3 states and 335 transitions. [2025-01-09 21:36:53,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 119 transitions, 269 flow [2025-01-09 21:36:53,529 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 119 transitions, 269 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:53,532 INFO L231 Difference]: Finished difference. Result has 123 places, 118 transitions, 247 flow [2025-01-09 21:36:53,534 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=247, PETRI_PLACES=123, PETRI_TRANSITIONS=118} [2025-01-09 21:36:53,538 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 1 predicate places. [2025-01-09 21:36:53,538 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 118 transitions, 247 flow [2025-01-09 21:36:53,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 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:36:53,539 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:53,539 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:53,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:36:53,539 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:53,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1956340960, now seen corresponding path program 1 times [2025-01-09 21:36:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:53,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147037186] [2025-01-09 21:36:53,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:53,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:36:53,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:36:53,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:53,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:53,618 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:36:53,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:53,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147037186] [2025-01-09 21:36:53,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147037186] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:53,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:53,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:53,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144010904] [2025-01-09 21:36:53,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:53,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:53,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:53,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:53,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:53,632 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-01-09 21:36:53,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 123 places, 118 transitions, 247 flow. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:36:53,633 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:53,633 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-01-09 21:36:53,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:53,670 INFO L124 PetriNetUnfolderBase]: 9/220 cut-off events. [2025-01-09 21:36:53,670 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:36:53,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 257 conditions, 220 events. 9/220 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 498 event pairs, 3 based on Foata normal form. 0/202 useless extension candidates. Maximal degree in co-relation 217. Up to 24 conditions per place. [2025-01-09 21:36:53,671 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 11 selfloop transitions, 2 changer transitions 0/120 dead transitions. [2025-01-09 21:36:53,671 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 277 flow [2025-01-09 21:36:53,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:53,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:53,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 342 transitions. [2025-01-09 21:36:53,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9421487603305785 [2025-01-09 21:36:53,673 INFO L175 Difference]: Start difference. First operand has 123 places, 118 transitions, 247 flow. Second operand 3 states and 342 transitions. [2025-01-09 21:36:53,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 277 flow [2025-01-09 21:36:53,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 120 transitions, 273 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:53,675 INFO L231 Difference]: Finished difference. Result has 121 places, 118 transitions, 253 flow [2025-01-09 21:36:53,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=239, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=253, PETRI_PLACES=121, PETRI_TRANSITIONS=118} [2025-01-09 21:36:53,676 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2025-01-09 21:36:53,676 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 118 transitions, 253 flow [2025-01-09 21:36:53,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:36:53,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:53,676 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] [2025-01-09 21:36:53,677 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:36:53,677 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:53,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:53,677 INFO L85 PathProgramCache]: Analyzing trace with hash 118445053, now seen corresponding path program 1 times [2025-01-09 21:36:53,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:53,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936643974] [2025-01-09 21:36:53,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:53,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:53,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:36:53,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:36:53,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:53,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:53,795 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:36:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:53,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936643974] [2025-01-09 21:36:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936643974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:53,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:53,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:53,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296418121] [2025-01-09 21:36:53,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:53,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:53,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:53,892 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 121 [2025-01-09 21:36:53,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 118 transitions, 253 flow. Second operand has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:36:53,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:53,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 121 [2025-01-09 21:36:53,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:53,952 INFO L124 PetriNetUnfolderBase]: 16/262 cut-off events. [2025-01-09 21:36:53,953 INFO L125 PetriNetUnfolderBase]: For 4/9 co-relation queries the response was YES. [2025-01-09 21:36:53,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 335 conditions, 262 events. 16/262 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 791 event pairs, 6 based on Foata normal form. 1/244 useless extension candidates. Maximal degree in co-relation 228. Up to 44 conditions per place. [2025-01-09 21:36:53,954 INFO L140 encePairwiseOnDemand]: 113/121 looper letters, 15 selfloop transitions, 2 changer transitions 5/125 dead transitions. [2025-01-09 21:36:53,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 311 flow [2025-01-09 21:36:53,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:53,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:53,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 653 transitions. [2025-01-09 21:36:53,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8994490358126722 [2025-01-09 21:36:53,956 INFO L175 Difference]: Start difference. First operand has 121 places, 118 transitions, 253 flow. Second operand 6 states and 653 transitions. [2025-01-09 21:36:53,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 311 flow [2025-01-09 21:36:53,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 125 transitions, 311 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:53,959 INFO L231 Difference]: Finished difference. Result has 130 places, 118 transitions, 271 flow [2025-01-09 21:36:53,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=271, PETRI_PLACES=130, PETRI_TRANSITIONS=118} [2025-01-09 21:36:53,960 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 8 predicate places. [2025-01-09 21:36:53,960 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 118 transitions, 271 flow [2025-01-09 21:36:53,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 106.4) internal successors, (532), 5 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:36:53,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:53,960 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] [2025-01-09 21:36:53,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:36:53,961 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:53,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:53,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1973103175, now seen corresponding path program 1 times [2025-01-09 21:36:53,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:53,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843894653] [2025-01-09 21:36:53,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:53,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:53,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:36:53,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:36:53,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:53,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:54,343 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:36:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:54,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843894653] [2025-01-09 21:36:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843894653] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826558190] [2025-01-09 21:36:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:54,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:54,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:54,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:54,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:54,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 121 [2025-01-09 21:36:54,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 118 transitions, 271 flow. Second operand has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 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:36:54,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:54,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 121 [2025-01-09 21:36:54,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:54,569 INFO L124 PetriNetUnfolderBase]: 100/528 cut-off events. [2025-01-09 21:36:54,569 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2025-01-09 21:36:54,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 850 conditions, 528 events. 100/528 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2765 event pairs, 45 based on Foata normal form. 0/485 useless extension candidates. Maximal degree in co-relation 742. Up to 190 conditions per place. [2025-01-09 21:36:54,572 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 33 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-01-09 21:36:54,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 147 transitions, 439 flow [2025-01-09 21:36:54,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:54,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 620 transitions. [2025-01-09 21:36:54,573 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8539944903581267 [2025-01-09 21:36:54,574 INFO L175 Difference]: Start difference. First operand has 130 places, 118 transitions, 271 flow. Second operand 6 states and 620 transitions. [2025-01-09 21:36:54,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 147 transitions, 439 flow [2025-01-09 21:36:54,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 147 transitions, 425 flow, removed 5 selfloop flow, removed 5 redundant places. [2025-01-09 21:36:54,576 INFO L231 Difference]: Finished difference. Result has 132 places, 139 transitions, 407 flow [2025-01-09 21:36:54,577 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=257, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=139} [2025-01-09 21:36:54,577 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2025-01-09 21:36:54,577 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 139 transitions, 407 flow [2025-01-09 21:36:54,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 95.5) internal successors, (573), 6 states have internal predecessors, (573), 0 states have call successors, (0), 0 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:36:54,578 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:54,578 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:54,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:36:54,578 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:54,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:54,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1848922442, now seen corresponding path program 1 times [2025-01-09 21:36:54,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:54,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117481727] [2025-01-09 21:36:54,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:54,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:54,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:36:54,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:36:54,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:54,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:54,612 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:36:54,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:54,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117481727] [2025-01-09 21:36:54,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117481727] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:54,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:54,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:54,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211339537] [2025-01-09 21:36:54,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:54,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:54,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:54,613 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:54,613 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:54,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-01-09 21:36:54,622 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 139 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:36:54,622 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:54,622 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-01-09 21:36:54,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:54,652 INFO L124 PetriNetUnfolderBase]: 24/266 cut-off events. [2025-01-09 21:36:54,652 INFO L125 PetriNetUnfolderBase]: For 32/43 co-relation queries the response was YES. [2025-01-09 21:36:54,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 434 conditions, 266 events. 24/266 cut-off events. For 32/43 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 868 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 336. Up to 49 conditions per place. [2025-01-09 21:36:54,653 INFO L140 encePairwiseOnDemand]: 117/121 looper letters, 7 selfloop transitions, 2 changer transitions 0/137 dead transitions. [2025-01-09 21:36:54,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 137 transitions, 421 flow [2025-01-09 21:36:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-01-09 21:36:54,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-01-09 21:36:54,655 INFO L175 Difference]: Start difference. First operand has 132 places, 139 transitions, 407 flow. Second operand 3 states and 338 transitions. [2025-01-09 21:36:54,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 137 transitions, 421 flow [2025-01-09 21:36:54,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 137 transitions, 421 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:54,658 INFO L231 Difference]: Finished difference. Result has 132 places, 137 transitions, 407 flow [2025-01-09 21:36:54,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=135, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=132, PETRI_TRANSITIONS=137} [2025-01-09 21:36:54,658 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 10 predicate places. [2025-01-09 21:36:54,658 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 137 transitions, 407 flow [2025-01-09 21:36:54,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 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:36:54,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:54,659 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] [2025-01-09 21:36:54,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:36:54,659 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:54,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:54,659 INFO L85 PathProgramCache]: Analyzing trace with hash -381313381, now seen corresponding path program 1 times [2025-01-09 21:36:54,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:54,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786177768] [2025-01-09 21:36:54,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:54,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:54,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:36:54,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:36:54,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:54,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:54,690 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:36:54,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:54,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786177768] [2025-01-09 21:36:54,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786177768] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:54,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:54,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:54,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359749064] [2025-01-09 21:36:54,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:54,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:54,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:54,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:54,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:54,703 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 121 [2025-01-09 21:36:54,704 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 137 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:36:54,704 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:54,704 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 121 [2025-01-09 21:36:54,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:54,733 INFO L124 PetriNetUnfolderBase]: 24/265 cut-off events. [2025-01-09 21:36:54,733 INFO L125 PetriNetUnfolderBase]: For 33/44 co-relation queries the response was YES. [2025-01-09 21:36:54,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 437 conditions, 265 events. 24/265 cut-off events. For 33/44 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 863 event pairs, 0 based on Foata normal form. 0/251 useless extension candidates. Maximal degree in co-relation 349. Up to 49 conditions per place. [2025-01-09 21:36:54,734 INFO L140 encePairwiseOnDemand]: 118/121 looper letters, 8 selfloop transitions, 2 changer transitions 0/136 dead transitions. [2025-01-09 21:36:54,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 136 transitions, 425 flow [2025-01-09 21:36:54,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:54,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:54,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-01-09 21:36:54,735 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.931129476584022 [2025-01-09 21:36:54,735 INFO L175 Difference]: Start difference. First operand has 132 places, 137 transitions, 407 flow. Second operand 3 states and 338 transitions. [2025-01-09 21:36:54,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 136 transitions, 425 flow [2025-01-09 21:36:54,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 136 transitions, 421 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:54,738 INFO L231 Difference]: Finished difference. Result has 131 places, 136 transitions, 405 flow [2025-01-09 21:36:54,738 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=131, PETRI_TRANSITIONS=136} [2025-01-09 21:36:54,739 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 9 predicate places. [2025-01-09 21:36:54,739 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 136 transitions, 405 flow [2025-01-09 21:36:54,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 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:36:54,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:54,739 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] [2025-01-09 21:36:54,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:36:54,739 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:54,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:54,740 INFO L85 PathProgramCache]: Analyzing trace with hash -687658053, now seen corresponding path program 1 times [2025-01-09 21:36:54,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:54,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547304198] [2025-01-09 21:36:54,740 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:54,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:54,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:36:54,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:36:54,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:54,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:55,023 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:36:55,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:55,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547304198] [2025-01-09 21:36:55,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547304198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:55,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:55,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:55,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058239612] [2025-01-09 21:36:55,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:55,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:55,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:55,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:55,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:55,120 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 121 [2025-01-09 21:36:55,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 136 transitions, 405 flow. Second operand has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 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:36:55,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:55,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 121 [2025-01-09 21:36:55,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:55,236 INFO L124 PetriNetUnfolderBase]: 104/614 cut-off events. [2025-01-09 21:36:55,237 INFO L125 PetriNetUnfolderBase]: For 106/108 co-relation queries the response was YES. [2025-01-09 21:36:55,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1136 conditions, 614 events. 104/614 cut-off events. For 106/108 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 3219 event pairs, 26 based on Foata normal form. 0/586 useless extension candidates. Maximal degree in co-relation 1017. Up to 203 conditions per place. [2025-01-09 21:36:55,240 INFO L140 encePairwiseOnDemand]: 110/121 looper letters, 48 selfloop transitions, 21 changer transitions 7/166 dead transitions. [2025-01-09 21:36:55,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 166 transitions, 646 flow [2025-01-09 21:36:55,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:55,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:55,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 631 transitions. [2025-01-09 21:36:55,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8691460055096418 [2025-01-09 21:36:55,243 INFO L175 Difference]: Start difference. First operand has 131 places, 136 transitions, 405 flow. Second operand 6 states and 631 transitions. [2025-01-09 21:36:55,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 166 transitions, 646 flow [2025-01-09 21:36:55,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 166 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:55,249 INFO L231 Difference]: Finished difference. Result has 139 places, 151 transitions, 562 flow [2025-01-09 21:36:55,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=121, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=562, PETRI_PLACES=139, PETRI_TRANSITIONS=151} [2025-01-09 21:36:55,250 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, 17 predicate places. [2025-01-09 21:36:55,251 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 151 transitions, 562 flow [2025-01-09 21:36:55,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 98.16666666666667) internal successors, (589), 6 states have internal predecessors, (589), 0 states have call successors, (0), 0 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:36:55,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:55,252 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:55,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:36:55,252 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-01-09 21:36:55,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:55,252 INFO L85 PathProgramCache]: Analyzing trace with hash -256048460, now seen corresponding path program 1 times [2025-01-09 21:36:55,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:55,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586859747] [2025-01-09 21:36:55,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:55,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:55,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:36:55,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:36:55,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:36:55,283 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:36:55,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-01-09 21:36:55,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-01-09 21:36:55,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:36:55,319 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:36:55,321 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:36:55,322 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-01-09 21:36:55,324 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-01-09 21:36:55,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-01-09 21:36:55,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-01-09 21:36:55,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-01-09 21:36:55,326 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-01-09 21:36:55,327 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-01-09 21:36:55,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:36:55,330 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:55,331 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:36:55,332 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:36:55,356 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:36:55,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 161 transitions, 338 flow [2025-01-09 21:36:55,381 INFO L124 PetriNetUnfolderBase]: 4/262 cut-off events. [2025-01-09 21:36:55,381 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2025-01-09 21:36:55,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 262 events. 4/262 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 605 event pairs, 0 based on Foata normal form. 0/231 useless extension candidates. Maximal degree in co-relation 156. Up to 6 conditions per place. [2025-01-09 21:36:55,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 161 transitions, 338 flow [2025-01-09 21:36:55,384 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 161 transitions, 338 flow [2025-01-09 21:36:55,385 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:36:55,385 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;@1855d4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:36:55,386 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-01-09 21:36:55,388 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:36:55,388 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-01-09 21:36:55,388 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:36:55,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:55,388 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:55,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:55,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:55,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1927271694, now seen corresponding path program 1 times [2025-01-09 21:36:55,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:55,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399965116] [2025-01-09 21:36:55,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:55,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:55,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:36:55,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:36:55,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:55,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:36:55,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:55,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399965116] [2025-01-09 21:36:55,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399965116] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:55,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:55,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:55,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596637331] [2025-01-09 21:36:55,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:55,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:55,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:55,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:55,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:55,448 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-01-09 21:36:55,449 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:36:55,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:55,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-01-09 21:36:55,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:55,568 INFO L124 PetriNetUnfolderBase]: 81/1022 cut-off events. [2025-01-09 21:36:55,568 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2025-01-09 21:36:55,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 1022 events. 81/1022 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6414 event pairs, 78 based on Foata normal form. 1/888 useless extension candidates. Maximal degree in co-relation 874. Up to 162 conditions per place. [2025-01-09 21:36:55,575 INFO L140 encePairwiseOnDemand]: 157/161 looper letters, 15 selfloop transitions, 2 changer transitions 1/159 dead transitions. [2025-01-09 21:36:55,576 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 159 transitions, 368 flow [2025-01-09 21:36:55,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:55,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 445 transitions. [2025-01-09 21:36:55,577 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9213250517598344 [2025-01-09 21:36:55,578 INFO L175 Difference]: Start difference. First operand has 163 places, 161 transitions, 338 flow. Second operand 3 states and 445 transitions. [2025-01-09 21:36:55,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 159 transitions, 368 flow [2025-01-09 21:36:55,579 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 159 transitions, 368 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:55,580 INFO L231 Difference]: Finished difference. Result has 164 places, 158 transitions, 336 flow [2025-01-09 21:36:55,581 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=164, PETRI_TRANSITIONS=158} [2025-01-09 21:36:55,581 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 1 predicate places. [2025-01-09 21:36:55,583 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 158 transitions, 336 flow [2025-01-09 21:36:55,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 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:36:55,583 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:55,583 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:55,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:36:55,583 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:55,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:55,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1362276800, now seen corresponding path program 1 times [2025-01-09 21:36:55,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:55,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417659779] [2025-01-09 21:36:55,584 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:55,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:55,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:36:55,595 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:36:55,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:55,616 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:36:55,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:55,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417659779] [2025-01-09 21:36:55,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417659779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:55,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:55,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630029382] [2025-01-09 21:36:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:55,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:55,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:55,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:55,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:55,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-01-09 21:36:55,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 158 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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:36:55,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:55,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-01-09 21:36:55,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:55,748 INFO L124 PetriNetUnfolderBase]: 132/1100 cut-off events. [2025-01-09 21:36:55,749 INFO L125 PetriNetUnfolderBase]: For 57/57 co-relation queries the response was YES. [2025-01-09 21:36:55,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1383 conditions, 1100 events. 132/1100 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6930 event pairs, 61 based on Foata normal form. 0/1013 useless extension candidates. Maximal degree in co-relation 1342. Up to 227 conditions per place. [2025-01-09 21:36:55,758 INFO L140 encePairwiseOnDemand]: 155/161 looper letters, 20 selfloop transitions, 3 changer transitions 0/163 dead transitions. [2025-01-09 21:36:55,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 163 transitions, 397 flow [2025-01-09 21:36:55,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:55,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:55,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 452 transitions. [2025-01-09 21:36:55,760 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9358178053830227 [2025-01-09 21:36:55,760 INFO L175 Difference]: Start difference. First operand has 164 places, 158 transitions, 336 flow. Second operand 3 states and 452 transitions. [2025-01-09 21:36:55,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 163 transitions, 397 flow [2025-01-09 21:36:55,762 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 163 transitions, 393 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:55,763 INFO L231 Difference]: Finished difference. Result has 161 places, 158 transitions, 347 flow [2025-01-09 21:36:55,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=155, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=347, PETRI_PLACES=161, PETRI_TRANSITIONS=158} [2025-01-09 21:36:55,765 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, -2 predicate places. [2025-01-09 21:36:55,766 INFO L471 AbstractCegarLoop]: Abstraction has has 161 places, 158 transitions, 347 flow [2025-01-09 21:36:55,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.0) internal successors, (429), 3 states have internal predecessors, (429), 0 states have call successors, (0), 0 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:36:55,766 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:55,766 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] [2025-01-09 21:36:55,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:36:55,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:55,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:55,768 INFO L85 PathProgramCache]: Analyzing trace with hash -1850583363, now seen corresponding path program 1 times [2025-01-09 21:36:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:55,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442244532] [2025-01-09 21:36:55,768 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:55,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:55,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:36:55,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:36:55,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:55,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:55,839 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:36:55,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:55,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442244532] [2025-01-09 21:36:55,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442244532] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:55,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:55,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003309638] [2025-01-09 21:36:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:55,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:36:55,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:55,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:36:55,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:36:55,928 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 161 [2025-01-09 21:36:55,930 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 161 places, 158 transitions, 347 flow. Second operand has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 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:36:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 161 [2025-01-09 21:36:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:56,090 INFO L124 PetriNetUnfolderBase]: 146/1826 cut-off events. [2025-01-09 21:36:56,091 INFO L125 PetriNetUnfolderBase]: For 43/49 co-relation queries the response was YES. [2025-01-09 21:36:56,096 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2220 conditions, 1826 events. 146/1826 cut-off events. For 43/49 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 14164 event pairs, 56 based on Foata normal form. 2/1657 useless extension candidates. Maximal degree in co-relation 944. Up to 258 conditions per place. [2025-01-09 21:36:56,101 INFO L140 encePairwiseOnDemand]: 153/161 looper letters, 20 selfloop transitions, 2 changer transitions 5/166 dead transitions. [2025-01-09 21:36:56,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 166 transitions, 417 flow [2025-01-09 21:36:56,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:56,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 874 transitions. [2025-01-09 21:36:56,103 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-01-09 21:36:56,103 INFO L175 Difference]: Start difference. First operand has 161 places, 158 transitions, 347 flow. Second operand 6 states and 874 transitions. [2025-01-09 21:36:56,104 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 166 transitions, 417 flow [2025-01-09 21:36:56,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 166 transitions, 417 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:56,106 INFO L231 Difference]: Finished difference. Result has 170 places, 159 transitions, 369 flow [2025-01-09 21:36:56,106 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=158, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=369, PETRI_PLACES=170, PETRI_TRANSITIONS=159} [2025-01-09 21:36:56,107 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 7 predicate places. [2025-01-09 21:36:56,107 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 159 transitions, 369 flow [2025-01-09 21:36:56,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 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:36:56,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:56,108 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] [2025-01-09 21:36:56,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:36:56,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:56,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:56,109 INFO L85 PathProgramCache]: Analyzing trace with hash 352835705, now seen corresponding path program 1 times [2025-01-09 21:36:56,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:56,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514937292] [2025-01-09 21:36:56,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:56,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:56,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:36:56,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:36:56,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:56,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:56,297 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:36:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514937292] [2025-01-09 21:36:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514937292] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:56,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:56,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:56,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359905408] [2025-01-09 21:36:56,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:56,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:56,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:56,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:56,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:56,404 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 161 [2025-01-09 21:36:56,405 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 159 transitions, 369 flow. Second operand has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 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:36:56,405 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:56,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 161 [2025-01-09 21:36:56,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:57,022 INFO L124 PetriNetUnfolderBase]: 1893/5512 cut-off events. [2025-01-09 21:36:57,022 INFO L125 PetriNetUnfolderBase]: For 318/318 co-relation queries the response was YES. [2025-01-09 21:36:57,034 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9162 conditions, 5512 events. 1893/5512 cut-off events. For 318/318 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 49715 event pairs, 800 based on Foata normal form. 0/5022 useless extension candidates. Maximal degree in co-relation 5978. Up to 2669 conditions per place. [2025-01-09 21:36:57,054 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 51 selfloop transitions, 38 changer transitions 0/213 dead transitions. [2025-01-09 21:36:57,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 213 transitions, 660 flow [2025-01-09 21:36:57,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 845 transitions. [2025-01-09 21:36:57,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8747412008281573 [2025-01-09 21:36:57,057 INFO L175 Difference]: Start difference. First operand has 170 places, 159 transitions, 369 flow. Second operand 6 states and 845 transitions. [2025-01-09 21:36:57,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 213 transitions, 660 flow [2025-01-09 21:36:57,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 213 transitions, 648 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 21:36:57,062 INFO L231 Difference]: Finished difference. Result has 173 places, 196 transitions, 611 flow [2025-01-09 21:36:57,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=159, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=145, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=611, PETRI_PLACES=173, PETRI_TRANSITIONS=196} [2025-01-09 21:36:57,062 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 10 predicate places. [2025-01-09 21:36:57,063 INFO L471 AbstractCegarLoop]: Abstraction has has 173 places, 196 transitions, 611 flow [2025-01-09 21:36:57,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 127.5) internal successors, (765), 6 states have internal predecessors, (765), 0 states have call successors, (0), 0 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:36:57,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:57,063 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] [2025-01-09 21:36:57,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:36:57,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:57,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:57,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1071695837, now seen corresponding path program 1 times [2025-01-09 21:36:57,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:57,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389690221] [2025-01-09 21:36:57,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:57,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:57,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:36:57,075 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:36:57,075 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:57,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:57,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:36:57,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:57,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389690221] [2025-01-09 21:36:57,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389690221] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:57,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:57,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:57,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239716930] [2025-01-09 21:36:57,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:57,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:57,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:57,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:57,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:57,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 138 out of 161 [2025-01-09 21:36:57,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 196 transitions, 611 flow. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:36:57,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:57,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 138 of 161 [2025-01-09 21:36:57,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:57,485 INFO L124 PetriNetUnfolderBase]: 825/3867 cut-off events. [2025-01-09 21:36:57,485 INFO L125 PetriNetUnfolderBase]: For 771/1132 co-relation queries the response was YES. [2025-01-09 21:36:57,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6909 conditions, 3867 events. 825/3867 cut-off events. For 771/1132 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 37167 event pairs, 171 based on Foata normal form. 1/3540 useless extension candidates. Maximal degree in co-relation 5959. Up to 1136 conditions per place. [2025-01-09 21:36:57,508 INFO L140 encePairwiseOnDemand]: 147/161 looper letters, 29 selfloop transitions, 10 changer transitions 0/213 dead transitions. [2025-01-09 21:36:57,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 175 places, 213 transitions, 734 flow [2025-01-09 21:36:57,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:57,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:57,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 457 transitions. [2025-01-09 21:36:57,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9461697722567288 [2025-01-09 21:36:57,510 INFO L175 Difference]: Start difference. First operand has 173 places, 196 transitions, 611 flow. Second operand 3 states and 457 transitions. [2025-01-09 21:36:57,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 175 places, 213 transitions, 734 flow [2025-01-09 21:36:57,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 175 places, 213 transitions, 734 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:36:57,519 INFO L231 Difference]: Finished difference. Result has 177 places, 206 transitions, 699 flow [2025-01-09 21:36:57,519 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=611, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=699, PETRI_PLACES=177, PETRI_TRANSITIONS=206} [2025-01-09 21:36:57,520 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 14 predicate places. [2025-01-09 21:36:57,520 INFO L471 AbstractCegarLoop]: Abstraction has has 177 places, 206 transitions, 699 flow [2025-01-09 21:36:57,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 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:36:57,520 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:57,520 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] [2025-01-09 21:36:57,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:36:57,521 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:57,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:57,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1393835710, now seen corresponding path program 1 times [2025-01-09 21:36:57,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:57,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650082828] [2025-01-09 21:36:57,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:57,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:57,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:36:57,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:36:57,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:57,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:57,546 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:36:57,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:57,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650082828] [2025-01-09 21:36:57,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650082828] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:57,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:57,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:36:57,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698543650] [2025-01-09 21:36:57,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:57,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:36:57,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:57,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:36:57,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:36:57,569 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-01-09 21:36:57,569 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 206 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:36:57,569 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:57,569 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-01-09 21:36:57,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:57,932 INFO L124 PetriNetUnfolderBase]: 939/4439 cut-off events. [2025-01-09 21:36:57,932 INFO L125 PetriNetUnfolderBase]: For 1055/1466 co-relation queries the response was YES. [2025-01-09 21:36:57,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8109 conditions, 4439 events. 939/4439 cut-off events. For 1055/1466 co-relation queries the response was YES. Maximal size of possible extension queue 232. Compared 44176 event pairs, 189 based on Foata normal form. 9/4096 useless extension candidates. Maximal degree in co-relation 7056. Up to 1277 conditions per place. [2025-01-09 21:36:57,970 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 26 selfloop transitions, 9 changer transitions 0/217 dead transitions. [2025-01-09 21:36:57,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 217 transitions, 815 flow [2025-01-09 21:36:57,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:36:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:36:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2025-01-09 21:36:57,972 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9399585921325052 [2025-01-09 21:36:57,972 INFO L175 Difference]: Start difference. First operand has 177 places, 206 transitions, 699 flow. Second operand 3 states and 454 transitions. [2025-01-09 21:36:57,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 217 transitions, 815 flow [2025-01-09 21:36:57,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 217 transitions, 789 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:57,984 INFO L231 Difference]: Finished difference. Result has 179 places, 213 transitions, 755 flow [2025-01-09 21:36:57,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=755, PETRI_PLACES=179, PETRI_TRANSITIONS=213} [2025-01-09 21:36:57,985 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 16 predicate places. [2025-01-09 21:36:57,985 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 213 transitions, 755 flow [2025-01-09 21:36:57,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.33333333333334) internal successors, (433), 3 states have internal predecessors, (433), 0 states have call successors, (0), 0 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:36:57,986 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:57,986 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] [2025-01-09 21:36:57,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:36:57,986 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:57,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:57,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1235965122, now seen corresponding path program 1 times [2025-01-09 21:36:57,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:57,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211966176] [2025-01-09 21:36:57,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:57,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:57,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:36:58,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:36:58,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:58,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:58,200 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:36:58,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:58,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211966176] [2025-01-09 21:36:58,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211966176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:58,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:58,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:58,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591393467] [2025-01-09 21:36:58,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:58,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:58,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:58,201 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:58,201 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:36:58,299 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-01-09 21:36:58,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 213 transitions, 755 flow. Second operand has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 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:36:58,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:36:58,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-01-09 21:36:58,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:36:59,639 INFO L124 PetriNetUnfolderBase]: 3454/12323 cut-off events. [2025-01-09 21:36:59,639 INFO L125 PetriNetUnfolderBase]: For 3198/3534 co-relation queries the response was YES. [2025-01-09 21:36:59,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25262 conditions, 12323 events. 3454/12323 cut-off events. For 3198/3534 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 138410 event pairs, 1208 based on Foata normal form. 8/11435 useless extension candidates. Maximal degree in co-relation 23207. Up to 4790 conditions per place. [2025-01-09 21:36:59,698 INFO L140 encePairwiseOnDemand]: 146/161 looper letters, 84 selfloop transitions, 38 changer transitions 0/268 dead transitions. [2025-01-09 21:36:59,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 268 transitions, 1179 flow [2025-01-09 21:36:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:36:59,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:36:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 856 transitions. [2025-01-09 21:36:59,700 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8861283643892339 [2025-01-09 21:36:59,700 INFO L175 Difference]: Start difference. First operand has 179 places, 213 transitions, 755 flow. Second operand 6 states and 856 transitions. [2025-01-09 21:36:59,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 268 transitions, 1179 flow [2025-01-09 21:36:59,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 268 transitions, 1161 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:36:59,715 INFO L231 Difference]: Finished difference. Result has 187 places, 250 transitions, 1055 flow [2025-01-09 21:36:59,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=737, PETRI_DIFFERENCE_MINUEND_PLACES=177, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1055, PETRI_PLACES=187, PETRI_TRANSITIONS=250} [2025-01-09 21:36:59,717 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 24 predicate places. [2025-01-09 21:36:59,717 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 250 transitions, 1055 flow [2025-01-09 21:36:59,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.16666666666666) internal successors, (781), 6 states have internal predecessors, (781), 0 states have call successors, (0), 0 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:36:59,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:36:59,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:36:59,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:36:59,718 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:36:59,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:36:59,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1955041636, now seen corresponding path program 1 times [2025-01-09 21:36:59,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:36:59,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33245631] [2025-01-09 21:36:59,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:36:59,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:36:59,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-01-09 21:36:59,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-01-09 21:36:59,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:36:59,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:36:59,931 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:36:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:36:59,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33245631] [2025-01-09 21:36:59,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [33245631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:36:59,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:36:59,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:36:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139545252] [2025-01-09 21:36:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:36:59,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:36:59,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:36:59,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:36:59,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:00,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 161 [2025-01-09 21:37:00,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 250 transitions, 1055 flow. Second operand has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 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:37:00,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:00,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 161 [2025-01-09 21:37:00,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:01,817 INFO L124 PetriNetUnfolderBase]: 6373/20044 cut-off events. [2025-01-09 21:37:01,818 INFO L125 PetriNetUnfolderBase]: For 9913/10232 co-relation queries the response was YES. [2025-01-09 21:37:01,879 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48823 conditions, 20044 events. 6373/20044 cut-off events. For 9913/10232 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 224591 event pairs, 1628 based on Foata normal form. 12/18655 useless extension candidates. Maximal degree in co-relation 42894. Up to 8149 conditions per place. [2025-01-09 21:37:01,939 INFO L140 encePairwiseOnDemand]: 142/161 looper letters, 139 selfloop transitions, 118 changer transitions 0/405 dead transitions. [2025-01-09 21:37:01,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 405 transitions, 2443 flow [2025-01-09 21:37:01,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:01,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:01,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 882 transitions. [2025-01-09 21:37:01,942 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9130434782608695 [2025-01-09 21:37:01,942 INFO L175 Difference]: Start difference. First operand has 187 places, 250 transitions, 1055 flow. Second operand 6 states and 882 transitions. [2025-01-09 21:37:01,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 405 transitions, 2443 flow [2025-01-09 21:37:01,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 405 transitions, 2311 flow, removed 66 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:01,991 INFO L231 Difference]: Finished difference. Result has 196 places, 362 transitions, 2121 flow [2025-01-09 21:37:01,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=991, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2121, PETRI_PLACES=196, PETRI_TRANSITIONS=362} [2025-01-09 21:37:01,991 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 33 predicate places. [2025-01-09 21:37:01,992 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 362 transitions, 2121 flow [2025-01-09 21:37:01,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.83333333333334) internal successors, (785), 6 states have internal predecessors, (785), 0 states have call successors, (0), 0 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:37:01,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:01,992 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:01,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:37:01,992 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:37:01,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:01,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2082862110, now seen corresponding path program 1 times [2025-01-09 21:37:01,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:01,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996326464] [2025-01-09 21:37:01,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:01,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:02,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 76 statements into 1 equivalence classes. [2025-01-09 21:37:02,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 76 of 76 statements. [2025-01-09 21:37:02,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:02,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:02,025 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:37:02,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:02,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996326464] [2025-01-09 21:37:02,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996326464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:02,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:02,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:02,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908394527] [2025-01-09 21:37:02,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:02,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:02,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:02,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:02,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:02,048 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 161 [2025-01-09 21:37:02,048 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 362 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 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:37:02,048 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:02,048 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 161 [2025-01-09 21:37:02,049 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:03,513 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([356] L1064-1-->L1064-2: Formula: (= (store |v_#race_12| |v_ULTIMATE.start_main_~tids~0#1.base_11| (store (select |v_#race_12| |v_ULTIMATE.start_main_~tids~0#1.base_11|) (+ (* |v_ULTIMATE.start_main_~i~1#1_5| 4) |v_ULTIMATE.start_main_~tids~0#1.offset_11|) 0)) |v_#race_11|) InVars {#race=|v_#race_12|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_11|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_5|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_11|} OutVars{#race=|v_#race_11|, ULTIMATE.start_main_~tids~0#1.offset=|v_ULTIMATE.start_main_~tids~0#1.offset_11|, ULTIMATE.start_main_~i~1#1=|v_ULTIMATE.start_main_~i~1#1_5|, ULTIMATE.start_main_~tids~0#1.base=|v_ULTIMATE.start_main_~tids~0#1.base_11|} AuxVars[] AssignedVars[#race][137], [Black: 187#(and (= |ULTIMATE.start_main_#t~nondet14#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet14#1|)), Black: 188#(and (= |ULTIMATE.start_main_#t~nondet14#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet14#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet14#1|)), Black: 197#(= |#race~next_j~0| 0), 118#L1064-2true, Black: 202#(= |threadThread1of2ForFork0_#t~nondet5| |#race~next_j~0|), Black: 208#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 205#true, Black: 210#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 3)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), Black: 209#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 2)) 0) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4) 1)) 0)), 226#true, Black: 220#(and (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 221#(and (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ 3 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ 2 (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), Black: 218#(= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))), Black: 219#(and (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset))) (= |threadThread1of2ForFork0_#t~nondet8| (select (select |#race| ~datas~0.base) (+ (* threadThread1of2ForFork0_~j~0 4) ~datas~0.offset 1)))), 162#true, Black: 169#true, 171#(= |#race~datas~0| 0), 27#L1052-11true, Black: 175#(= |ULTIMATE.start_main_~i~0#1| 0), 207#(= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~1#1| 4))) 0), 184#true, 216#true, 163#true, Black: 189#(and (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 3 (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet14#1|) (= |ULTIMATE.start_main_#t~nondet14#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))) (= |ULTIMATE.start_main_#t~nondet14#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| 2 (* |ULTIMATE.start_main_~i~0#1| 4)))) (= (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet14#1|)), Black: 186#(= |ULTIMATE.start_main_#t~nondet14#1| (select (select |#race| |ULTIMATE.start_main_~tids~0#1.base|) (+ |ULTIMATE.start_main_~tids~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))]) [2025-01-09 21:37:03,514 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2025-01-09 21:37:03,514 INFO L297 olderBase$Statistics]: existing Event has 86 ancestors and is cut-off event [2025-01-09 21:37:03,514 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:37:03,514 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2025-01-09 21:37:03,529 INFO L124 PetriNetUnfolderBase]: 4356/15262 cut-off events. [2025-01-09 21:37:03,529 INFO L125 PetriNetUnfolderBase]: For 11250/12847 co-relation queries the response was YES. [2025-01-09 21:37:03,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41943 conditions, 15262 events. 4356/15262 cut-off events. For 11250/12847 co-relation queries the response was YES. Maximal size of possible extension queue 550. Compared 172907 event pairs, 352 based on Foata normal form. 12/14582 useless extension candidates. Maximal degree in co-relation 37833. Up to 3719 conditions per place. [2025-01-09 21:37:03,647 INFO L140 encePairwiseOnDemand]: 154/161 looper letters, 28 selfloop transitions, 11 changer transitions 0/372 dead transitions. [2025-01-09 21:37:03,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 372 transitions, 2236 flow [2025-01-09 21:37:03,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:03,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2025-01-09 21:37:03,648 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937888198757764 [2025-01-09 21:37:03,648 INFO L175 Difference]: Start difference. First operand has 196 places, 362 transitions, 2121 flow. Second operand 3 states and 453 transitions. [2025-01-09 21:37:03,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 372 transitions, 2236 flow [2025-01-09 21:37:03,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 372 transitions, 2200 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:03,809 INFO L231 Difference]: Finished difference. Result has 200 places, 369 transitions, 2173 flow [2025-01-09 21:37:03,810 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=161, PETRI_DIFFERENCE_MINUEND_FLOW=2085, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2173, PETRI_PLACES=200, PETRI_TRANSITIONS=369} [2025-01-09 21:37:03,810 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 37 predicate places. [2025-01-09 21:37:03,810 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 369 transitions, 2173 flow [2025-01-09 21:37:03,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.66666666666666) internal successors, (434), 3 states have internal predecessors, (434), 0 states have call successors, (0), 0 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:37:03,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:03,812 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:03,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:37:03,812 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-01-09 21:37:03,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:03,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1391805496, now seen corresponding path program 1 times [2025-01-09 21:37:03,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:03,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009450425] [2025-01-09 21:37:03,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:03,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:03,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:37:03,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:37:03,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:03,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:03,831 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:37:03,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 21:37:03,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 21:37:03,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:03,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:37:03,852 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:37:03,852 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:37:03,852 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2025-01-09 21:37:03,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2025-01-09 21:37:03,852 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2025-01-09 21:37:03,853 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2025-01-09 21:37:03,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr2ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2025-01-09 21:37:03,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr3ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2025-01-09 21:37:03,854 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr4ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2025-01-09 21:37:03,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:37:03,854 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:03,854 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:37:03,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:37:03,890 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:37:03,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 204 places, 201 transitions, 429 flow [2025-01-09 21:37:03,921 INFO L124 PetriNetUnfolderBase]: 9/421 cut-off events. [2025-01-09 21:37:03,921 INFO L125 PetriNetUnfolderBase]: For 19/22 co-relation queries the response was YES. [2025-01-09 21:37:03,923 INFO L83 FinitePrefix]: Finished finitePrefix Result has 446 conditions, 421 events. 9/421 cut-off events. For 19/22 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1281 event pairs, 1 based on Foata normal form. 0/371 useless extension candidates. Maximal degree in co-relation 270. Up to 12 conditions per place. [2025-01-09 21:37:03,923 INFO L82 GeneralOperation]: Start removeDead. Operand has 204 places, 201 transitions, 429 flow [2025-01-09 21:37:03,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 201 transitions, 429 flow [2025-01-09 21:37:03,927 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:37:03,928 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;@1855d4e0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:37:03,928 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-09 21:37:03,929 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:37:03,929 INFO L124 PetriNetUnfolderBase]: 1/32 cut-off events. [2025-01-09 21:37:03,929 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:37:03,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:03,930 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] [2025-01-09 21:37:03,930 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:37:03,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:03,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1232502537, now seen corresponding path program 1 times [2025-01-09 21:37:03,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:03,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305008163] [2025-01-09 21:37:03,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:03,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:03,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-01-09 21:37:03,937 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-01-09 21:37:03,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:03,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:03,946 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:37:03,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:03,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305008163] [2025-01-09 21:37:03,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305008163] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:03,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:03,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:03,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286334821] [2025-01-09 21:37:03,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:03,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:03,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:03,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:03,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:03,967 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-01-09 21:37:03,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 201 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:37:03,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:03,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-01-09 21:37:03,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:04,332 INFO L124 PetriNetUnfolderBase]: 656/5099 cut-off events. [2025-01-09 21:37:04,332 INFO L125 PetriNetUnfolderBase]: For 337/337 co-relation queries the response was YES. [2025-01-09 21:37:04,348 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6310 conditions, 5099 events. 656/5099 cut-off events. For 337/337 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 50983 event pairs, 643 based on Foata normal form. 1/4437 useless extension candidates. Maximal degree in co-relation 4712. Up to 1052 conditions per place. [2025-01-09 21:37:04,360 INFO L140 encePairwiseOnDemand]: 197/201 looper letters, 20 selfloop transitions, 2 changer transitions 1/199 dead transitions. [2025-01-09 21:37:04,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 199 transitions, 469 flow [2025-01-09 21:37:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:04,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:04,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-01-09 21:37:04,361 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9203980099502488 [2025-01-09 21:37:04,361 INFO L175 Difference]: Start difference. First operand has 204 places, 201 transitions, 429 flow. Second operand 3 states and 555 transitions. [2025-01-09 21:37:04,362 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 199 transitions, 469 flow [2025-01-09 21:37:04,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 199 transitions, 469 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:04,364 INFO L231 Difference]: Finished difference. Result has 205 places, 198 transitions, 427 flow [2025-01-09 21:37:04,364 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=427, PETRI_PLACES=205, PETRI_TRANSITIONS=198} [2025-01-09 21:37:04,364 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 1 predicate places. [2025-01-09 21:37:04,364 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 198 transitions, 427 flow [2025-01-09 21:37:04,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 0 states have call successors, (0), 0 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:37:04,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:04,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:04,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:37:04,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:37:04,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:04,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1643990688, now seen corresponding path program 1 times [2025-01-09 21:37:04,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:04,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177232549] [2025-01-09 21:37:04,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:04,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:04,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:37:04,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:37:04,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:04,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:04,379 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:37:04,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:04,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177232549] [2025-01-09 21:37:04,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177232549] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:04,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:04,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:04,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465942301] [2025-01-09 21:37:04,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:04,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:04,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:04,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:04,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:04,392 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-01-09 21:37:04,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 198 transitions, 427 flow. Second operand has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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:37:04,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:04,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-01-09 21:37:04,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:04,826 INFO L124 PetriNetUnfolderBase]: 1275/6749 cut-off events. [2025-01-09 21:37:04,827 INFO L125 PetriNetUnfolderBase]: For 527/527 co-relation queries the response was YES. [2025-01-09 21:37:04,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8947 conditions, 6749 events. 1275/6749 cut-off events. For 527/527 co-relation queries the response was YES. Maximal size of possible extension queue 199. Compared 69108 event pairs, 437 based on Foata normal form. 0/6232 useless extension candidates. Maximal degree in co-relation 8905. Up to 1872 conditions per place. [2025-01-09 21:37:04,880 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 29 selfloop transitions, 4 changer transitions 0/206 dead transitions. [2025-01-09 21:37:04,880 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 206 transitions, 521 flow [2025-01-09 21:37:04,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:04,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:04,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2025-01-09 21:37:04,881 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9320066334991708 [2025-01-09 21:37:04,881 INFO L175 Difference]: Start difference. First operand has 205 places, 198 transitions, 427 flow. Second operand 3 states and 562 transitions. [2025-01-09 21:37:04,881 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 206 transitions, 521 flow [2025-01-09 21:37:04,883 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 206 transitions, 517 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:04,884 INFO L231 Difference]: Finished difference. Result has 201 places, 198 transitions, 443 flow [2025-01-09 21:37:04,884 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=415, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=201, PETRI_TRANSITIONS=198} [2025-01-09 21:37:04,884 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -3 predicate places. [2025-01-09 21:37:04,885 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 198 transitions, 443 flow [2025-01-09 21:37:04,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.0) internal successors, (528), 3 states have internal predecessors, (528), 0 states have call successors, (0), 0 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:37:04,885 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:04,885 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:04,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:37:04,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:37:04,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:04,885 INFO L85 PathProgramCache]: Analyzing trace with hash -360642691, now seen corresponding path program 1 times [2025-01-09 21:37:04,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:04,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158552646] [2025-01-09 21:37:04,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:04,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:04,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:37:04,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:37:04,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:04,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:04,924 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:37:04,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:04,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158552646] [2025-01-09 21:37:04,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158552646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:04,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:04,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:04,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490081247] [2025-01-09 21:37:04,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:04,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:37:04,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:04,926 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:37:04,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:37:04,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 201 [2025-01-09 21:37:04,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 198 transitions, 443 flow. Second operand has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:37:04,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:04,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 201 [2025-01-09 21:37:04,999 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:05,768 INFO L124 PetriNetUnfolderBase]: 931/9765 cut-off events. [2025-01-09 21:37:05,768 INFO L125 PetriNetUnfolderBase]: For 265/270 co-relation queries the response was YES. [2025-01-09 21:37:05,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11802 conditions, 9765 events. 931/9765 cut-off events. For 265/270 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 112685 event pairs, 658 based on Foata normal form. 1/8801 useless extension candidates. Maximal degree in co-relation 6768. Up to 1296 conditions per place. [2025-01-09 21:37:05,823 INFO L140 encePairwiseOnDemand]: 193/201 looper letters, 24 selfloop transitions, 2 changer transitions 5/206 dead transitions. [2025-01-09 21:37:05,823 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 206 transitions, 521 flow [2025-01-09 21:37:05,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1094 transitions. [2025-01-09 21:37:05,825 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9071310116086235 [2025-01-09 21:37:05,825 INFO L175 Difference]: Start difference. First operand has 201 places, 198 transitions, 443 flow. Second operand 6 states and 1094 transitions. [2025-01-09 21:37:05,825 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 206 transitions, 521 flow [2025-01-09 21:37:05,826 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 206 transitions, 521 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:05,828 INFO L231 Difference]: Finished difference. Result has 210 places, 199 transitions, 465 flow [2025-01-09 21:37:05,828 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=201, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=210, PETRI_TRANSITIONS=199} [2025-01-09 21:37:05,828 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 6 predicate places. [2025-01-09 21:37:05,828 INFO L471 AbstractCegarLoop]: Abstraction has has 210 places, 199 transitions, 465 flow [2025-01-09 21:37:05,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 178.4) internal successors, (892), 5 states have internal predecessors, (892), 0 states have call successors, (0), 0 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:37:05,829 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:05,829 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] [2025-01-09 21:37:05,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:37:05,829 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:37:05,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:05,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1842776377, now seen corresponding path program 1 times [2025-01-09 21:37:05,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:05,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807158188] [2025-01-09 21:37:05,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:05,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:05,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-09 21:37:05,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-09 21:37:05,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:05,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:05,948 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:37:05,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:05,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807158188] [2025-01-09 21:37:05,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [807158188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:05,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:05,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:05,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450292357] [2025-01-09 21:37:05,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:05,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:05,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:05,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:05,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:06,059 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 201 [2025-01-09 21:37:06,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 210 places, 199 transitions, 465 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 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:37:06,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:06,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 201 [2025-01-09 21:37:06,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:12,298 INFO L124 PetriNetUnfolderBase]: 24761/64696 cut-off events. [2025-01-09 21:37:12,299 INFO L125 PetriNetUnfolderBase]: For 3804/3820 co-relation queries the response was YES. [2025-01-09 21:37:12,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104239 conditions, 64696 events. 24761/64696 cut-off events. For 3804/3820 co-relation queries the response was YES. Maximal size of possible extension queue 1903. Compared 805444 event pairs, 14369 based on Foata normal form. 0/58621 useless extension candidates. Maximal degree in co-relation 67395. Up to 30787 conditions per place. [2025-01-09 21:37:12,782 INFO L140 encePairwiseOnDemand]: 182/201 looper letters, 68 selfloop transitions, 54 changer transitions 0/278 dead transitions. [2025-01-09 21:37:12,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 278 transitions, 879 flow [2025-01-09 21:37:12,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:37:12,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:37:12,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2025-01-09 21:37:12,784 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8872305140961857 [2025-01-09 21:37:12,784 INFO L175 Difference]: Start difference. First operand has 210 places, 199 transitions, 465 flow. Second operand 6 states and 1070 transitions. [2025-01-09 21:37:12,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 278 transitions, 879 flow [2025-01-09 21:37:12,792 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 278 transitions, 867 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-01-09 21:37:12,794 INFO L231 Difference]: Finished difference. Result has 213 places, 252 transitions, 811 flow [2025-01-09 21:37:12,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=811, PETRI_PLACES=213, PETRI_TRANSITIONS=252} [2025-01-09 21:37:12,795 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 9 predicate places. [2025-01-09 21:37:12,795 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 252 transitions, 811 flow [2025-01-09 21:37:12,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 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:37:12,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:12,795 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:12,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:37:12,795 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:37:12,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:12,796 INFO L85 PathProgramCache]: Analyzing trace with hash 107937964, now seen corresponding path program 1 times [2025-01-09 21:37:12,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:12,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155464501] [2025-01-09 21:37:12,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:12,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:12,802 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:37:12,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:37:12,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:12,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:12,815 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:37:12,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155464501] [2025-01-09 21:37:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155464501] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:12,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:12,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:12,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454576605] [2025-01-09 21:37:12,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:12,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:12,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:12,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:12,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:12,838 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 167 out of 201 [2025-01-09 21:37:12,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 252 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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:37:12,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:12,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 167 of 201 [2025-01-09 21:37:12,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:20,421 INFO L124 PetriNetUnfolderBase]: 21007/70384 cut-off events. [2025-01-09 21:37:20,421 INFO L125 PetriNetUnfolderBase]: For 17693/24007 co-relation queries the response was YES. [2025-01-09 21:37:20,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 129102 conditions, 70384 events. 21007/70384 cut-off events. For 17693/24007 co-relation queries the response was YES. Maximal size of possible extension queue 2431. Compared 998952 event pairs, 6604 based on Foata normal form. 14/63904 useless extension candidates. Maximal degree in co-relation 101439. Up to 23127 conditions per place. [2025-01-09 21:37:21,126 INFO L140 encePairwiseOnDemand]: 180/201 looper letters, 44 selfloop transitions, 15 changer transitions 0/278 dead transitions. [2025-01-09 21:37:21,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 278 transitions, 1002 flow [2025-01-09 21:37:21,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:21,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:21,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 566 transitions. [2025-01-09 21:37:21,128 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9386401326699834 [2025-01-09 21:37:21,128 INFO L175 Difference]: Start difference. First operand has 213 places, 252 transitions, 811 flow. Second operand 3 states and 566 transitions. [2025-01-09 21:37:21,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 278 transitions, 1002 flow [2025-01-09 21:37:21,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 278 transitions, 1002 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:37:21,616 INFO L231 Difference]: Finished difference. Result has 217 places, 267 transitions, 943 flow [2025-01-09 21:37:21,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=811, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=943, PETRI_PLACES=217, PETRI_TRANSITIONS=267} [2025-01-09 21:37:21,616 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 13 predicate places. [2025-01-09 21:37:21,616 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 267 transitions, 943 flow [2025-01-09 21:37:21,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.33333333333334) internal successors, (505), 3 states have internal predecessors, (505), 0 states have call successors, (0), 0 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:37:21,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:21,617 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] [2025-01-09 21:37:21,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:37:21,617 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:37:21,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:21,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1833653649, now seen corresponding path program 1 times [2025-01-09 21:37:21,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:21,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255535994] [2025-01-09 21:37:21,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:21,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:21,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-01-09 21:37:21,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-01-09 21:37:21,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:21,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:21,637 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:37:21,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:21,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255535994] [2025-01-09 21:37:21,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255535994] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:21,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:21,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:37:21,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095530022] [2025-01-09 21:37:21,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:21,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:37:21,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:21,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:37:21,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:37:21,667 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 201 [2025-01-09 21:37:21,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 267 transitions, 943 flow. Second operand has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:37:21,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:21,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 201 [2025-01-09 21:37:21,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:37:31,002 INFO L124 PetriNetUnfolderBase]: 24700/86900 cut-off events. [2025-01-09 21:37:31,002 INFO L125 PetriNetUnfolderBase]: For 25617/33288 co-relation queries the response was YES. [2025-01-09 21:37:31,511 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162963 conditions, 86900 events. 24700/86900 cut-off events. For 25617/33288 co-relation queries the response was YES. Maximal size of possible extension queue 2986. Compared 1296462 event pairs, 7700 based on Foata normal form. 169/79817 useless extension candidates. Maximal degree in co-relation 132373. Up to 28165 conditions per place. [2025-01-09 21:37:31,883 INFO L140 encePairwiseOnDemand]: 191/201 looper letters, 40 selfloop transitions, 16 changer transitions 0/289 dead transitions. [2025-01-09 21:37:31,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 289 transitions, 1153 flow [2025-01-09 21:37:31,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:37:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:37:31,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2025-01-09 21:37:31,887 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9402985074626866 [2025-01-09 21:37:31,887 INFO L175 Difference]: Start difference. First operand has 217 places, 267 transitions, 943 flow. Second operand 3 states and 567 transitions. [2025-01-09 21:37:31,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 289 transitions, 1153 flow [2025-01-09 21:37:32,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 289 transitions, 1111 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:37:32,883 INFO L231 Difference]: Finished difference. Result has 219 places, 281 transitions, 1059 flow [2025-01-09 21:37:32,883 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=201, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=267, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=251, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1059, PETRI_PLACES=219, PETRI_TRANSITIONS=281} [2025-01-09 21:37:32,883 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, 15 predicate places. [2025-01-09 21:37:32,883 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 281 transitions, 1059 flow [2025-01-09 21:37:32,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 177.33333333333334) internal successors, (532), 3 states have internal predecessors, (532), 0 states have call successors, (0), 0 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:37:32,884 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:37:32,888 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:37:32,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:37:32,889 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:37:32,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:37:32,889 INFO L85 PathProgramCache]: Analyzing trace with hash -682530831, now seen corresponding path program 1 times [2025-01-09 21:37:32,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:37:32,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879768648] [2025-01-09 21:37:32,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:37:32,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:37:32,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:37:32,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:37:32,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:37:32,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:37:33,023 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:37:33,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:37:33,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879768648] [2025-01-09 21:37:33,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879768648] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:37:33,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:37:33,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:37:33,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220502933] [2025-01-09 21:37:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:37:33,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:37:33,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:37:33,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:37:33,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:37:33,137 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 160 out of 201 [2025-01-09 21:37:33,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 281 transitions, 1059 flow. Second operand has 6 states, 6 states have (on average 162.16666666666666) internal successors, (973), 6 states have internal predecessors, (973), 0 states have call successors, (0), 0 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:37:33,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:37:33,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 160 of 201 [2025-01-09 21:37:33,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand