./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-node-trans.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:30:44,079 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:30:44,131 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:30:44,136 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:30:44,139 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:30:44,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:30:44,163 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:30:44,163 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:30:44,163 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:30:44,163 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:30:44,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:30:44,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:30:44,164 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:30:44,164 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:30:44,165 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:44,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:30:44,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:44,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:30:44,166 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:30:44,167 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:30:44,167 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 -> c9008ebcceff34245d74f1892a84a552f8268a9318e8a2970f14b3ec6b594daf [2025-01-09 21:30:44,394 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:30:44,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:30:44,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:30:44,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:30:44,407 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:30:44,409 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-01-09 21:30:45,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/941209824/a5af16d79a194a04990c08559edef152/FLAG6f29a4ad4 [2025-01-09 21:30:45,859 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:30:45,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-node-trans.wvr.c [2025-01-09 21:30:45,872 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/941209824/a5af16d79a194a04990c08559edef152/FLAG6f29a4ad4 [2025-01-09 21:30:46,151 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/941209824/a5af16d79a194a04990c08559edef152 [2025-01-09 21:30:46,153 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:30:46,155 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:30:46,160 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:46,160 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:30:46,164 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:30:46,168 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,168 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f04b204 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46, skipping insertion in model container [2025-01-09 21:30:46,168 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,194 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:30:46,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:46,386 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:30:46,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:30:46,445 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:30:46,445 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46 WrapperNode [2025-01-09 21:30:46,445 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:30:46,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:46,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:30:46,446 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:30:46,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,465 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,494 INFO L138 Inliner]: procedures = 26, calls = 52, calls flagged for inlining = 23, calls inlined = 35, statements flattened = 775 [2025-01-09 21:30:46,495 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:30:46,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:30:46,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:30:46,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:30:46,500 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,520 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,522 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,525 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,527 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,528 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,532 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:30:46,532 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:30:46,532 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:30:46,532 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:30:46,533 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (1/1) ... [2025-01-09 21:30:46,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:30:46,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:30:46,566 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:30:46,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:30:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:30:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:30:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:30:46,585 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:30:46,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:30:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:30:46,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:30:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-01-09 21:30:46,586 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-01-09 21:30:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:30:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:30:46,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:30:46,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:30:46,587 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:30:46,721 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:30:46,722 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:30:47,603 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:30:47,603 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:30:47,631 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:30:47,631 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:30:47,631 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:47 BoogieIcfgContainer [2025-01-09 21:30:47,631 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:30:47,661 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:30:47,662 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:30:47,665 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:30:47,665 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:30:46" (1/3) ... [2025-01-09 21:30:47,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598f0887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:47, skipping insertion in model container [2025-01-09 21:30:47,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:30:46" (2/3) ... [2025-01-09 21:30:47,666 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@598f0887 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:30:47, skipping insertion in model container [2025-01-09 21:30:47,666 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:30:47" (3/3) ... [2025-01-09 21:30:47,667 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-node-trans.wvr.c [2025-01-09 21:30:47,676 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:30:47,677 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-node-trans.wvr.c that has 4 procedures, 1001 locations, 1 initial locations, 6 loop locations, and 114 error locations. [2025-01-09 21:30:47,677 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:30:47,792 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:30:47,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1010 places, 1042 transitions, 2105 flow [2025-01-09 21:30:48,201 INFO L124 PetriNetUnfolderBase]: 42/1039 cut-off events. [2025-01-09 21:30:48,203 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:30:48,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1039 events. 42/1039 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2151 event pairs, 0 based on Foata normal form. 0/883 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2025-01-09 21:30:48,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 1010 places, 1042 transitions, 2105 flow [2025-01-09 21:30:48,234 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 988 places, 1018 transitions, 2054 flow [2025-01-09 21:30:48,239 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:30:48,261 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;@64f0d980, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:30:48,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 192 error locations. [2025-01-09 21:30:48,269 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:30:48,269 INFO L124 PetriNetUnfolderBase]: 0/34 cut-off events. [2025-01-09 21:30:48,269 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:30:48,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:48,270 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:48,270 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:48,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:48,274 INFO L85 PathProgramCache]: Analyzing trace with hash 880450352, now seen corresponding path program 1 times [2025-01-09 21:30:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:48,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237203422] [2025-01-09 21:30:48,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:48,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-09 21:30:48,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-09 21:30:48,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:48,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:48,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:48,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:48,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237203422] [2025-01-09 21:30:48,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237203422] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:48,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:48,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:48,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563686345] [2025-01-09 21:30:48,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:48,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:48,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:48,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:48,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:48,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-01-09 21:30:48,464 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 988 places, 1018 transitions, 2054 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:48,464 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:48,464 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-01-09 21:30:48,466 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:48,954 INFO L124 PetriNetUnfolderBase]: 54/1757 cut-off events. [2025-01-09 21:30:48,955 INFO L125 PetriNetUnfolderBase]: For 26/26 co-relation queries the response was YES. [2025-01-09 21:30:48,973 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1852 conditions, 1757 events. 54/1757 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7947 event pairs, 21 based on Foata normal form. 53/1509 useless extension candidates. Maximal degree in co-relation 1271. Up to 62 conditions per place. [2025-01-09 21:30:48,995 INFO L140 encePairwiseOnDemand]: 1017/1042 looper letters, 19 selfloop transitions, 2 changer transitions 16/995 dead transitions. [2025-01-09 21:30:48,996 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 989 places, 995 transitions, 2050 flow [2025-01-09 21:30:48,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3029 transitions. [2025-01-09 21:30:49,013 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9689699296225208 [2025-01-09 21:30:49,015 INFO L175 Difference]: Start difference. First operand has 988 places, 1018 transitions, 2054 flow. Second operand 3 states and 3029 transitions. [2025-01-09 21:30:49,015 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 989 places, 995 transitions, 2050 flow [2025-01-09 21:30:49,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 995 transitions, 2038 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-01-09 21:30:49,038 INFO L231 Difference]: Finished difference. Result has 983 places, 979 transitions, 1968 flow [2025-01-09 21:30:49,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1996, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=995, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=993, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1968, PETRI_PLACES=983, PETRI_TRANSITIONS=979} [2025-01-09 21:30:49,044 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -5 predicate places. [2025-01-09 21:30:49,044 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 979 transitions, 1968 flow [2025-01-09 21:30:49,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,046 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:49,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:30:49,046 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:49,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,047 INFO L85 PathProgramCache]: Analyzing trace with hash -166198398, now seen corresponding path program 1 times [2025-01-09 21:30:49,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726376415] [2025-01-09 21:30:49,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-01-09 21:30:49,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-01-09 21:30:49,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:49,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726376415] [2025-01-09 21:30:49,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726376415] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116285252] [2025-01-09 21:30:49,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,159 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-01-09 21:30:49,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 979 transitions, 1968 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-01-09 21:30:49,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:49,718 INFO L124 PetriNetUnfolderBase]: 114/2523 cut-off events. [2025-01-09 21:30:49,719 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:30:49,747 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2690 conditions, 2523 events. 114/2523 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 15058 event pairs, 60 based on Foata normal form. 0/2116 useless extension candidates. Maximal degree in co-relation 2647. Up to 146 conditions per place. [2025-01-09 21:30:49,763 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/969 dead transitions. [2025-01-09 21:30:49,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 959 places, 969 transitions, 2002 flow [2025-01-09 21:30:49,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:49,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:49,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-01-09 21:30:49,770 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-01-09 21:30:49,770 INFO L175 Difference]: Start difference. First operand has 983 places, 979 transitions, 1968 flow. Second operand 3 states and 2980 transitions. [2025-01-09 21:30:49,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 959 places, 969 transitions, 2002 flow [2025-01-09 21:30:49,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 969 transitions, 1998 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:49,782 INFO L231 Difference]: Finished difference. Result has 957 places, 969 transitions, 1946 flow [2025-01-09 21:30:49,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1944, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=969, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=968, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1946, PETRI_PLACES=957, PETRI_TRANSITIONS=969} [2025-01-09 21:30:49,783 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-01-09 21:30:49,784 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 969 transitions, 1946 flow [2025-01-09 21:30:49,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,785 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:49,785 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:49,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:30:49,785 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:49,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:49,788 INFO L85 PathProgramCache]: Analyzing trace with hash 880275668, now seen corresponding path program 1 times [2025-01-09 21:30:49,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:49,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392352631] [2025-01-09 21:30:49,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:49,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:49,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-01-09 21:30:49,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-01-09 21:30:49,812 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:49,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:49,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:49,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392352631] [2025-01-09 21:30:49,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392352631] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:49,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:49,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:49,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196456403] [2025-01-09 21:30:49,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:49,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:49,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:49,848 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:49,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:49,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-01-09 21:30:49,950 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 969 transitions, 1946 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:49,953 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:49,953 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-01-09 21:30:49,953 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:50,428 INFO L124 PetriNetUnfolderBase]: 90/2666 cut-off events. [2025-01-09 21:30:50,429 INFO L125 PetriNetUnfolderBase]: For 5/9 co-relation queries the response was YES. [2025-01-09 21:30:50,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2666 events. 90/2666 cut-off events. For 5/9 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16449 event pairs, 39 based on Foata normal form. 0/2208 useless extension candidates. Maximal degree in co-relation 2738. Up to 89 conditions per place. [2025-01-09 21:30:50,464 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/968 dead transitions. [2025-01-09 21:30:50,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 958 places, 968 transitions, 1986 flow [2025-01-09 21:30:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:50,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-01-09 21:30:50,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-01-09 21:30:50,477 INFO L175 Difference]: Start difference. First operand has 957 places, 969 transitions, 1946 flow. Second operand 3 states and 3007 transitions. [2025-01-09 21:30:50,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 958 places, 968 transitions, 1986 flow [2025-01-09 21:30:50,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 957 places, 968 transitions, 1985 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:50,493 INFO L231 Difference]: Finished difference. Result has 957 places, 968 transitions, 1947 flow [2025-01-09 21:30:50,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1943, PETRI_DIFFERENCE_MINUEND_PLACES=955, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=968, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=966, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1947, PETRI_PLACES=957, PETRI_TRANSITIONS=968} [2025-01-09 21:30:50,495 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -31 predicate places. [2025-01-09 21:30:50,495 INFO L471 AbstractCegarLoop]: Abstraction has has 957 places, 968 transitions, 1947 flow [2025-01-09 21:30:50,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:50,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:50,497 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] [2025-01-09 21:30:50,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:30:50,497 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:50,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:50,499 INFO L85 PathProgramCache]: Analyzing trace with hash 1700801885, now seen corresponding path program 1 times [2025-01-09 21:30:50,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:50,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425268522] [2025-01-09 21:30:50,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:50,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:50,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:30:50,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:30:50,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:50,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:50,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:50,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:50,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425268522] [2025-01-09 21:30:50,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425268522] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:50,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:50,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:50,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722437778] [2025-01-09 21:30:50,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:50,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:50,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:50,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:50,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:50,658 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-01-09 21:30:50,662 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 957 places, 968 transitions, 1947 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:50,662 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:50,662 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-01-09 21:30:50,662 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:51,543 INFO L124 PetriNetUnfolderBase]: 225/3970 cut-off events. [2025-01-09 21:30:51,543 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2025-01-09 21:30:51,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4298 conditions, 3970 events. 225/3970 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 30200 event pairs, 132 based on Foata normal form. 0/3337 useless extension candidates. Maximal degree in co-relation 4256. Up to 264 conditions per place. [2025-01-09 21:30:51,594 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/958 dead transitions. [2025-01-09 21:30:51,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 958 transitions, 1981 flow [2025-01-09 21:30:51,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:51,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:51,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-01-09 21:30:51,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-01-09 21:30:51,599 INFO L175 Difference]: Start difference. First operand has 957 places, 968 transitions, 1947 flow. Second operand 3 states and 2980 transitions. [2025-01-09 21:30:51,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 958 transitions, 1981 flow [2025-01-09 21:30:51,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 958 transitions, 1977 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:51,609 INFO L231 Difference]: Finished difference. Result has 947 places, 958 transitions, 1925 flow [2025-01-09 21:30:51,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1923, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=958, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=957, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1925, PETRI_PLACES=947, PETRI_TRANSITIONS=958} [2025-01-09 21:30:51,612 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-01-09 21:30:51,612 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 958 transitions, 1925 flow [2025-01-09 21:30:51,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:51,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:51,613 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:51,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:30:51,614 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:51,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:51,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1419325282, now seen corresponding path program 1 times [2025-01-09 21:30:51,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:51,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676540347] [2025-01-09 21:30:51,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:51,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:51,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-01-09 21:30:51,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-01-09 21:30:51,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:51,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:51,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:51,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:51,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676540347] [2025-01-09 21:30:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676540347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:51,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:51,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:51,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738814483] [2025-01-09 21:30:51,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:51,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:51,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:51,682 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:51,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:51,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 995 out of 1042 [2025-01-09 21:30:51,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 958 transitions, 1925 flow. Second operand has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:51,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:51,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 995 of 1042 [2025-01-09 21:30:51,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,138 INFO L124 PetriNetUnfolderBase]: 75/1833 cut-off events. [2025-01-09 21:30:52,138 INFO L125 PetriNetUnfolderBase]: For 20/47 co-relation queries the response was YES. [2025-01-09 21:30:52,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1934 conditions, 1833 events. 75/1833 cut-off events. For 20/47 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 8393 event pairs, 39 based on Foata normal form. 0/1560 useless extension candidates. Maximal degree in co-relation 1891. Up to 89 conditions per place. [2025-01-09 21:30:52,160 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 19 selfloop transitions, 2 changer transitions 0/957 dead transitions. [2025-01-09 21:30:52,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 948 places, 957 transitions, 1965 flow [2025-01-09 21:30:52,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:52,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:52,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3007 transitions. [2025-01-09 21:30:52,171 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9619321817018555 [2025-01-09 21:30:52,171 INFO L175 Difference]: Start difference. First operand has 947 places, 958 transitions, 1925 flow. Second operand 3 states and 3007 transitions. [2025-01-09 21:30:52,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 948 places, 957 transitions, 1965 flow [2025-01-09 21:30:52,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 957 transitions, 1964 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:52,184 INFO L231 Difference]: Finished difference. Result has 947 places, 957 transitions, 1926 flow [2025-01-09 21:30:52,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1922, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=957, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=955, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1926, PETRI_PLACES=947, PETRI_TRANSITIONS=957} [2025-01-09 21:30:52,186 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -41 predicate places. [2025-01-09 21:30:52,186 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 957 transitions, 1926 flow [2025-01-09 21:30:52,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 996.3333333333334) internal successors, (2989), 3 states have internal predecessors, (2989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:52,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:52,188 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] [2025-01-09 21:30:52,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:52,188 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:52,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:52,189 INFO L85 PathProgramCache]: Analyzing trace with hash -18785714, now seen corresponding path program 1 times [2025-01-09 21:30:52,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:52,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678452028] [2025-01-09 21:30:52,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:52,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:52,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:30:52,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:30:52,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:52,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:52,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:52,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:52,228 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678452028] [2025-01-09 21:30:52,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678452028] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:52,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:52,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:52,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643028865] [2025-01-09 21:30:52,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:52,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:52,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:52,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:52,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:52,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 981 out of 1042 [2025-01-09 21:30:52,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 957 transitions, 1926 flow. Second operand has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:52,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:52,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 981 of 1042 [2025-01-09 21:30:52,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:52,992 INFO L124 PetriNetUnfolderBase]: 227/3703 cut-off events. [2025-01-09 21:30:52,992 INFO L125 PetriNetUnfolderBase]: For 65/94 co-relation queries the response was YES. [2025-01-09 21:30:53,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 3703 events. 227/3703 cut-off events. For 65/94 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 26673 event pairs, 132 based on Foata normal form. 0/3155 useless extension candidates. Maximal degree in co-relation 3952. Up to 274 conditions per place. [2025-01-09 21:30:53,025 INFO L140 encePairwiseOnDemand]: 1031/1042 looper letters, 26 selfloop transitions, 1 changer transitions 0/947 dead transitions. [2025-01-09 21:30:53,025 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 939 places, 947 transitions, 1960 flow [2025-01-09 21:30:53,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:53,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2980 transitions. [2025-01-09 21:30:53,029 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9532949456174025 [2025-01-09 21:30:53,029 INFO L175 Difference]: Start difference. First operand has 947 places, 957 transitions, 1926 flow. Second operand 3 states and 2980 transitions. [2025-01-09 21:30:53,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 939 places, 947 transitions, 1960 flow [2025-01-09 21:30:53,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 947 transitions, 1956 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:53,038 INFO L231 Difference]: Finished difference. Result has 937 places, 947 transitions, 1904 flow [2025-01-09 21:30:53,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1902, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=947, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=946, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1904, PETRI_PLACES=937, PETRI_TRANSITIONS=947} [2025-01-09 21:30:53,040 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-01-09 21:30:53,040 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 947 transitions, 1904 flow [2025-01-09 21:30:53,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 982.0) internal successors, (2946), 3 states have internal predecessors, (2946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:53,042 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:53,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:53,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:53,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:53,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1822166001, now seen corresponding path program 1 times [2025-01-09 21:30:53,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:53,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941373102] [2025-01-09 21:30:53,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:53,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:53,048 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 21:30:53,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 21:30:53,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:53,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:53,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941373102] [2025-01-09 21:30:53,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941373102] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:53,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36456009] [2025-01-09 21:30:53,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:53,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:53,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:53,089 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-01-09 21:30:53,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 947 transitions, 1904 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,092 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,092 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-01-09 21:30:53,092 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:53,232 INFO L124 PetriNetUnfolderBase]: 26/1247 cut-off events. [2025-01-09 21:30:53,233 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-01-09 21:30:53,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1275 conditions, 1247 events. 26/1247 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3301 event pairs, 2 based on Foata normal form. 0/1094 useless extension candidates. Maximal degree in co-relation 1232. Up to 16 conditions per place. [2025-01-09 21:30:53,246 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/946 dead transitions. [2025-01-09 21:30:53,246 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 946 transitions, 1928 flow [2025-01-09 21:30:53,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:53,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-01-09 21:30:53,250 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-01-09 21:30:53,250 INFO L175 Difference]: Start difference. First operand has 937 places, 947 transitions, 1904 flow. Second operand 3 states and 3023 transitions. [2025-01-09 21:30:53,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 946 transitions, 1928 flow [2025-01-09 21:30:53,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 937 places, 946 transitions, 1927 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:53,259 INFO L231 Difference]: Finished difference. Result has 937 places, 946 transitions, 1905 flow [2025-01-09 21:30:53,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1901, PETRI_DIFFERENCE_MINUEND_PLACES=935, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=946, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=944, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1905, PETRI_PLACES=937, PETRI_TRANSITIONS=946} [2025-01-09 21:30:53,261 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -51 predicate places. [2025-01-09 21:30:53,261 INFO L471 AbstractCegarLoop]: Abstraction has has 937 places, 946 transitions, 1905 flow [2025-01-09 21:30:53,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:53,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:53,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:53,263 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:53,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:53,264 INFO L85 PathProgramCache]: Analyzing trace with hash -1576203284, now seen corresponding path program 1 times [2025-01-09 21:30:53,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:53,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361926128] [2025-01-09 21:30:53,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:53,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:53,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:30:53,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:30:53,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:53,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361926128] [2025-01-09 21:30:53,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361926128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195023203] [2025-01-09 21:30:53,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:53,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:53,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:53,323 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-01-09 21:30:53,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 937 places, 946 transitions, 1905 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-01-09 21:30:53,327 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:53,627 INFO L124 PetriNetUnfolderBase]: 42/1848 cut-off events. [2025-01-09 21:30:53,627 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:30:53,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1891 conditions, 1848 events. 42/1848 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 8284 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1848. Up to 25 conditions per place. [2025-01-09 21:30:53,650 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/945 dead transitions. [2025-01-09 21:30:53,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 938 places, 945 transitions, 1931 flow [2025-01-09 21:30:53,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:53,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:53,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-01-09 21:30:53,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-01-09 21:30:53,655 INFO L175 Difference]: Start difference. First operand has 937 places, 946 transitions, 1905 flow. Second operand 3 states and 3021 transitions. [2025-01-09 21:30:53,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 938 places, 945 transitions, 1931 flow [2025-01-09 21:30:53,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 936 places, 945 transitions, 1927 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:53,667 INFO L231 Difference]: Finished difference. Result has 936 places, 945 transitions, 1903 flow [2025-01-09 21:30:53,668 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1899, PETRI_DIFFERENCE_MINUEND_PLACES=934, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=943, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1903, PETRI_PLACES=936, PETRI_TRANSITIONS=945} [2025-01-09 21:30:53,668 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -52 predicate places. [2025-01-09 21:30:53,669 INFO L471 AbstractCegarLoop]: Abstraction has has 936 places, 945 transitions, 1903 flow [2025-01-09 21:30:53,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:53,670 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:53,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:53,671 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:53,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:53,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1333402540, now seen corresponding path program 1 times [2025-01-09 21:30:53,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:53,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277305143] [2025-01-09 21:30:53,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:53,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:53,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:30:53,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:30:53,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:53,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:53,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:53,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277305143] [2025-01-09 21:30:53,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277305143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:53,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:53,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:53,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177228157] [2025-01-09 21:30:53,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:53,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:53,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:53,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:53,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:53,739 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-01-09 21:30:53,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 936 places, 945 transitions, 1903 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:53,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:53,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-01-09 21:30:53,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:54,079 INFO L124 PetriNetUnfolderBase]: 42/1847 cut-off events. [2025-01-09 21:30:54,080 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:30:54,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1890 conditions, 1847 events. 42/1847 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 8279 event pairs, 6 based on Foata normal form. 0/1598 useless extension candidates. Maximal degree in co-relation 1847. Up to 25 conditions per place. [2025-01-09 21:30:54,108 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/944 dead transitions. [2025-01-09 21:30:54,108 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 937 places, 944 transitions, 1929 flow [2025-01-09 21:30:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:54,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-01-09 21:30:54,112 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-01-09 21:30:54,113 INFO L175 Difference]: Start difference. First operand has 936 places, 945 transitions, 1903 flow. Second operand 3 states and 3021 transitions. [2025-01-09 21:30:54,113 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 937 places, 944 transitions, 1929 flow [2025-01-09 21:30:54,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 935 places, 944 transitions, 1925 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:54,125 INFO L231 Difference]: Finished difference. Result has 935 places, 944 transitions, 1901 flow [2025-01-09 21:30:54,126 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1897, PETRI_DIFFERENCE_MINUEND_PLACES=933, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=944, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=942, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1901, PETRI_PLACES=935, PETRI_TRANSITIONS=944} [2025-01-09 21:30:54,126 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -53 predicate places. [2025-01-09 21:30:54,126 INFO L471 AbstractCegarLoop]: Abstraction has has 935 places, 944 transitions, 1901 flow [2025-01-09 21:30:54,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:54,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:54,128 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:54,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:54,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:54,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:54,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1192217395, now seen corresponding path program 1 times [2025-01-09 21:30:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:54,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838344381] [2025-01-09 21:30:54,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:54,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:54,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 21:30:54,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 21:30:54,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:54,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:54,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:54,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:54,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838344381] [2025-01-09 21:30:54,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838344381] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:54,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:54,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:54,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408009072] [2025-01-09 21:30:54,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:54,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:54,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:54,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:54,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:54,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-01-09 21:30:54,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 935 places, 944 transitions, 1901 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:54,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:54,188 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-01-09 21:30:54,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:54,370 INFO L124 PetriNetUnfolderBase]: 23/1094 cut-off events. [2025-01-09 21:30:54,370 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:30:54,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1123 conditions, 1094 events. 23/1094 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2534 event pairs, 2 based on Foata normal form. 0/969 useless extension candidates. Maximal degree in co-relation 1080. Up to 16 conditions per place. [2025-01-09 21:30:54,385 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/943 dead transitions. [2025-01-09 21:30:54,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 936 places, 943 transitions, 1925 flow [2025-01-09 21:30:54,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:54,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:54,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-01-09 21:30:54,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-01-09 21:30:54,390 INFO L175 Difference]: Start difference. First operand has 935 places, 944 transitions, 1901 flow. Second operand 3 states and 3023 transitions. [2025-01-09 21:30:54,390 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 936 places, 943 transitions, 1925 flow [2025-01-09 21:30:54,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 934 places, 943 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:54,402 INFO L231 Difference]: Finished difference. Result has 934 places, 943 transitions, 1899 flow [2025-01-09 21:30:54,403 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1895, PETRI_DIFFERENCE_MINUEND_PLACES=932, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=943, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=941, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1899, PETRI_PLACES=934, PETRI_TRANSITIONS=943} [2025-01-09 21:30:54,404 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -54 predicate places. [2025-01-09 21:30:54,404 INFO L471 AbstractCegarLoop]: Abstraction has has 934 places, 943 transitions, 1899 flow [2025-01-09 21:30:54,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:54,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:54,406 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:54,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:54,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:54,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:54,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1797079620, now seen corresponding path program 1 times [2025-01-09 21:30:54,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:54,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841320110] [2025-01-09 21:30:54,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:54,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:54,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:30:54,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:30:54,417 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:54,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:54,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:54,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:54,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841320110] [2025-01-09 21:30:54,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841320110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:54,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:54,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:54,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805273930] [2025-01-09 21:30:54,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:54,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:54,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:54,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:54,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:54,510 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-01-09 21:30:54,513 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 934 places, 943 transitions, 1899 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:54,513 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:54,513 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-01-09 21:30:54,513 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:54,879 INFO L124 PetriNetUnfolderBase]: 33/1395 cut-off events. [2025-01-09 21:30:54,879 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-01-09 21:30:54,892 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 1395 events. 33/1395 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 4864 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1392. Up to 25 conditions per place. [2025-01-09 21:30:54,900 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/942 dead transitions. [2025-01-09 21:30:54,901 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 935 places, 942 transitions, 1925 flow [2025-01-09 21:30:54,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:54,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-01-09 21:30:54,905 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-01-09 21:30:54,905 INFO L175 Difference]: Start difference. First operand has 934 places, 943 transitions, 1899 flow. Second operand 3 states and 3021 transitions. [2025-01-09 21:30:54,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 935 places, 942 transitions, 1925 flow [2025-01-09 21:30:54,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 933 places, 942 transitions, 1921 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:54,916 INFO L231 Difference]: Finished difference. Result has 933 places, 942 transitions, 1897 flow [2025-01-09 21:30:54,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1893, PETRI_DIFFERENCE_MINUEND_PLACES=931, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=942, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=940, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1897, PETRI_PLACES=933, PETRI_TRANSITIONS=942} [2025-01-09 21:30:54,918 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -55 predicate places. [2025-01-09 21:30:54,918 INFO L471 AbstractCegarLoop]: Abstraction has has 933 places, 942 transitions, 1897 flow [2025-01-09 21:30:54,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:54,919 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:54,920 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:54,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:54,920 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:54,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1935781086, now seen corresponding path program 1 times [2025-01-09 21:30:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:54,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054356063] [2025-01-09 21:30:54,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:54,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:54,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:30:54,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:30:54,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:54,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:54,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:54,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:54,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054356063] [2025-01-09 21:30:54,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054356063] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:54,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:54,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:54,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700316475] [2025-01-09 21:30:54,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:54,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:54,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:54,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:54,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:54,974 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-01-09 21:30:54,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 933 places, 942 transitions, 1897 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:54,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:54,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-01-09 21:30:54,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,200 INFO L124 PetriNetUnfolderBase]: 33/1394 cut-off events. [2025-01-09 21:30:55,200 INFO L125 PetriNetUnfolderBase]: For 4/36 co-relation queries the response was YES. [2025-01-09 21:30:55,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1434 conditions, 1394 events. 33/1394 cut-off events. For 4/36 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4807 event pairs, 6 based on Foata normal form. 0/1219 useless extension candidates. Maximal degree in co-relation 1391. Up to 25 conditions per place. [2025-01-09 21:30:55,216 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/941 dead transitions. [2025-01-09 21:30:55,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 934 places, 941 transitions, 1923 flow [2025-01-09 21:30:55,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-01-09 21:30:55,220 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-01-09 21:30:55,220 INFO L175 Difference]: Start difference. First operand has 933 places, 942 transitions, 1897 flow. Second operand 3 states and 3021 transitions. [2025-01-09 21:30:55,220 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 934 places, 941 transitions, 1923 flow [2025-01-09 21:30:55,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 932 places, 941 transitions, 1919 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,229 INFO L231 Difference]: Finished difference. Result has 932 places, 941 transitions, 1895 flow [2025-01-09 21:30:55,230 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1891, PETRI_DIFFERENCE_MINUEND_PLACES=930, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=941, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=939, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1895, PETRI_PLACES=932, PETRI_TRANSITIONS=941} [2025-01-09 21:30:55,231 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -56 predicate places. [2025-01-09 21:30:55,231 INFO L471 AbstractCegarLoop]: Abstraction has has 932 places, 941 transitions, 1895 flow [2025-01-09 21:30:55,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:55,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:55,232 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:55,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,232 INFO L85 PathProgramCache]: Analyzing trace with hash 963404326, now seen corresponding path program 1 times [2025-01-09 21:30:55,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170718718] [2025-01-09 21:30:55,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 21:30:55,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 21:30:55,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:55,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170718718] [2025-01-09 21:30:55,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170718718] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154476407] [2025-01-09 21:30:55,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,274 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1003 out of 1042 [2025-01-09 21:30:55,275 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 932 places, 941 transitions, 1895 flow. Second operand has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,275 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,275 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1003 of 1042 [2025-01-09 21:30:55,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,373 INFO L124 PetriNetUnfolderBase]: 20/970 cut-off events. [2025-01-09 21:30:55,373 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-01-09 21:30:55,379 INFO L83 FinitePrefix]: Finished finitePrefix Result has 998 conditions, 970 events. 20/970 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2056 event pairs, 2 based on Foata normal form. 0/870 useless extension candidates. Maximal degree in co-relation 955. Up to 16 conditions per place. [2025-01-09 21:30:55,383 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 11 selfloop transitions, 2 changer transitions 0/940 dead transitions. [2025-01-09 21:30:55,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 933 places, 940 transitions, 1919 flow [2025-01-09 21:30:55,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3023 transitions. [2025-01-09 21:30:55,386 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9670505438259757 [2025-01-09 21:30:55,386 INFO L175 Difference]: Start difference. First operand has 932 places, 941 transitions, 1895 flow. Second operand 3 states and 3023 transitions. [2025-01-09 21:30:55,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 933 places, 940 transitions, 1919 flow [2025-01-09 21:30:55,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 931 places, 940 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,395 INFO L231 Difference]: Finished difference. Result has 931 places, 940 transitions, 1893 flow [2025-01-09 21:30:55,396 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1889, PETRI_DIFFERENCE_MINUEND_PLACES=929, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=940, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=938, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1893, PETRI_PLACES=931, PETRI_TRANSITIONS=940} [2025-01-09 21:30:55,397 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -57 predicate places. [2025-01-09 21:30:55,397 INFO L471 AbstractCegarLoop]: Abstraction has has 931 places, 940 transitions, 1893 flow [2025-01-09 21:30:55,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1004.3333333333334) internal successors, (3013), 3 states have internal predecessors, (3013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,398 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,398 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:55,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:55,399 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:55,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash -627493352, now seen corresponding path program 1 times [2025-01-09 21:30:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341937100] [2025-01-09 21:30:55,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 21:30:55,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 21:30:55,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:55,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341937100] [2025-01-09 21:30:55,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341937100] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318509145] [2025-01-09 21:30:55,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,453 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-01-09 21:30:55,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 931 places, 940 transitions, 1893 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-01-09 21:30:55,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,583 INFO L124 PetriNetUnfolderBase]: 30/1205 cut-off events. [2025-01-09 21:30:55,583 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-01-09 21:30:55,591 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1242 conditions, 1205 events. 30/1205 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 3065 event pairs, 6 based on Foata normal form. 0/1062 useless extension candidates. Maximal degree in co-relation 1199. Up to 25 conditions per place. [2025-01-09 21:30:55,595 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/939 dead transitions. [2025-01-09 21:30:55,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 932 places, 939 transitions, 1919 flow [2025-01-09 21:30:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-01-09 21:30:55,599 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-01-09 21:30:55,599 INFO L175 Difference]: Start difference. First operand has 931 places, 940 transitions, 1893 flow. Second operand 3 states and 3021 transitions. [2025-01-09 21:30:55,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 932 places, 939 transitions, 1919 flow [2025-01-09 21:30:55,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 930 places, 939 transitions, 1915 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,607 INFO L231 Difference]: Finished difference. Result has 930 places, 939 transitions, 1891 flow [2025-01-09 21:30:55,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1887, PETRI_DIFFERENCE_MINUEND_PLACES=928, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=939, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=937, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1891, PETRI_PLACES=930, PETRI_TRANSITIONS=939} [2025-01-09 21:30:55,609 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -58 predicate places. [2025-01-09 21:30:55,609 INFO L471 AbstractCegarLoop]: Abstraction has has 930 places, 939 transitions, 1891 flow [2025-01-09 21:30:55,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,610 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,610 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:55,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:55,610 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:55,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash 224653930, now seen corresponding path program 1 times [2025-01-09 21:30:55,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,611 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336175732] [2025-01-09 21:30:55,611 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:30:55,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:30:55,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:55,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:55,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:55,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336175732] [2025-01-09 21:30:55,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336175732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:55,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:55,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:55,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178075109] [2025-01-09 21:30:55,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:55,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:55,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:55,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:55,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:55,695 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1002 out of 1042 [2025-01-09 21:30:55,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 930 places, 939 transitions, 1891 flow. Second operand has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:55,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1002 of 1042 [2025-01-09 21:30:55,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:55,820 INFO L124 PetriNetUnfolderBase]: 30/1166 cut-off events. [2025-01-09 21:30:55,820 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2025-01-09 21:30:55,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1203 conditions, 1166 events. 30/1166 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2929 event pairs, 6 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1160. Up to 25 conditions per place. [2025-01-09 21:30:55,834 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 12 selfloop transitions, 2 changer transitions 0/938 dead transitions. [2025-01-09 21:30:55,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 938 transitions, 1917 flow [2025-01-09 21:30:55,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:55,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:55,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3021 transitions. [2025-01-09 21:30:55,838 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9664107485604606 [2025-01-09 21:30:55,838 INFO L175 Difference]: Start difference. First operand has 930 places, 939 transitions, 1891 flow. Second operand 3 states and 3021 transitions. [2025-01-09 21:30:55,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 938 transitions, 1917 flow [2025-01-09 21:30:55,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 938 transitions, 1913 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:55,847 INFO L231 Difference]: Finished difference. Result has 929 places, 938 transitions, 1889 flow [2025-01-09 21:30:55,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1885, PETRI_DIFFERENCE_MINUEND_PLACES=927, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=938, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=936, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1889, PETRI_PLACES=929, PETRI_TRANSITIONS=938} [2025-01-09 21:30:55,848 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -59 predicate places. [2025-01-09 21:30:55,848 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 938 transitions, 1889 flow [2025-01-09 21:30:55,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1003.3333333333334) internal successors, (3010), 3 states have internal predecessors, (3010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:55,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:55,850 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:55,850 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:55,850 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:30:55,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:55,850 INFO L85 PathProgramCache]: Analyzing trace with hash 2140670281, now seen corresponding path program 1 times [2025-01-09 21:30:55,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:55,851 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116506856] [2025-01-09 21:30:55,851 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:55,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:55,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:30:55,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:30:55,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:55,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:56,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:56,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:56,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116506856] [2025-01-09 21:30:56,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116506856] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:56,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:56,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:56,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412546978] [2025-01-09 21:30:56,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:56,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:56,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:56,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:56,321 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:56,733 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-01-09 21:30:56,736 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 938 transitions, 1889 flow. Second operand has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:30:56,736 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:56,736 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-01-09 21:30:56,736 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:10,294 INFO L124 PetriNetUnfolderBase]: 15257/85352 cut-off events. [2025-01-09 21:31:10,295 INFO L125 PetriNetUnfolderBase]: For 719/719 co-relation queries the response was YES. [2025-01-09 21:31:10,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107781 conditions, 85352 events. 15257/85352 cut-off events. For 719/719 co-relation queries the response was YES. Maximal size of possible extension queue 1173. Compared 1263217 event pairs, 14040 based on Foata normal form. 0/74616 useless extension candidates. Maximal degree in co-relation 107739. Up to 22026 conditions per place. [2025-01-09 21:31:10,801 INFO L140 encePairwiseOnDemand]: 1024/1042 looper letters, 87 selfloop transitions, 15 changer transitions 0/935 dead transitions. [2025-01-09 21:31:10,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 931 places, 935 transitions, 2087 flow [2025-01-09 21:31:10,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:31:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:31:10,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 5583 transitions. [2025-01-09 21:31:10,807 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8929942418426103 [2025-01-09 21:31:10,807 INFO L175 Difference]: Start difference. First operand has 929 places, 938 transitions, 1889 flow. Second operand 6 states and 5583 transitions. [2025-01-09 21:31:10,807 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 931 places, 935 transitions, 2087 flow [2025-01-09 21:31:10,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 929 places, 935 transitions, 2083 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:10,816 INFO L231 Difference]: Finished difference. Result has 929 places, 935 transitions, 1909 flow [2025-01-09 21:31:10,817 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1879, PETRI_DIFFERENCE_MINUEND_PLACES=924, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=935, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=920, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1909, PETRI_PLACES=929, PETRI_TRANSITIONS=935} [2025-01-09 21:31:10,817 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -59 predicate places. [2025-01-09 21:31:10,817 INFO L471 AbstractCegarLoop]: Abstraction has has 929 places, 935 transitions, 1909 flow [2025-01-09 21:31:10,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 914.5) internal successors, (5487), 6 states have internal predecessors, (5487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:10,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:10,818 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:10,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:31:10,819 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:31:10,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:10,819 INFO L85 PathProgramCache]: Analyzing trace with hash -96860890, now seen corresponding path program 1 times [2025-01-09 21:31:10,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:10,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851796387] [2025-01-09 21:31:10,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:10,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:10,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-01-09 21:31:10,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-01-09 21:31:10,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:10,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:10,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:10,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:10,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851796387] [2025-01-09 21:31:10,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851796387] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:10,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:10,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:10,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529949282] [2025-01-09 21:31:10,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:10,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:10,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:10,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:10,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:10,886 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-01-09 21:31:10,888 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 929 places, 935 transitions, 1909 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:10,888 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:10,888 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-01-09 21:31:10,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:11,069 INFO L124 PetriNetUnfolderBase]: 42/1526 cut-off events. [2025-01-09 21:31:11,070 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:31:11,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1593 conditions, 1526 events. 42/1526 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6366 event pairs, 12 based on Foata normal form. 0/1336 useless extension candidates. Maximal degree in co-relation 1550. Up to 38 conditions per place. [2025-01-09 21:31:11,091 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/934 dead transitions. [2025-01-09 21:31:11,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 930 places, 934 transitions, 1937 flow [2025-01-09 21:31:11,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:11,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:11,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-01-09 21:31:11,095 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-01-09 21:31:11,095 INFO L175 Difference]: Start difference. First operand has 929 places, 935 transitions, 1909 flow. Second operand 3 states and 3019 transitions. [2025-01-09 21:31:11,095 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 930 places, 934 transitions, 1937 flow [2025-01-09 21:31:11,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 925 places, 934 transitions, 1907 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:31:11,107 INFO L231 Difference]: Finished difference. Result has 925 places, 934 transitions, 1881 flow [2025-01-09 21:31:11,108 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1877, PETRI_DIFFERENCE_MINUEND_PLACES=923, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=934, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=932, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1881, PETRI_PLACES=925, PETRI_TRANSITIONS=934} [2025-01-09 21:31:11,108 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -63 predicate places. [2025-01-09 21:31:11,108 INFO L471 AbstractCegarLoop]: Abstraction has has 925 places, 934 transitions, 1881 flow [2025-01-09 21:31:11,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:11,109 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:11,109 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:11,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:31:11,109 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:31:11,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:11,110 INFO L85 PathProgramCache]: Analyzing trace with hash -517015476, now seen corresponding path program 1 times [2025-01-09 21:31:11,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:11,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356534972] [2025-01-09 21:31:11,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:11,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:11,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 21:31:11,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 21:31:11,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:11,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:11,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:11,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:11,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356534972] [2025-01-09 21:31:11,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356534972] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:11,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:11,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:11,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387556039] [2025-01-09 21:31:11,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:11,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:11,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:11,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:11,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:11,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-01-09 21:31:11,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 925 places, 934 transitions, 1881 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:11,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:11,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-01-09 21:31:11,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:11,664 INFO L124 PetriNetUnfolderBase]: 62/2127 cut-off events. [2025-01-09 21:31:11,665 INFO L125 PetriNetUnfolderBase]: For 4/7 co-relation queries the response was YES. [2025-01-09 21:31:11,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 2127 events. 62/2127 cut-off events. For 4/7 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10836 event pairs, 20 based on Foata normal form. 0/1833 useless extension candidates. Maximal degree in co-relation 2156. Up to 50 conditions per place. [2025-01-09 21:31:11,686 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/933 dead transitions. [2025-01-09 21:31:11,687 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 926 places, 933 transitions, 1909 flow [2025-01-09 21:31:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-01-09 21:31:11,691 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-01-09 21:31:11,691 INFO L175 Difference]: Start difference. First operand has 925 places, 934 transitions, 1881 flow. Second operand 3 states and 3019 transitions. [2025-01-09 21:31:11,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 926 places, 933 transitions, 1909 flow [2025-01-09 21:31:11,694 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 924 places, 933 transitions, 1905 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:11,700 INFO L231 Difference]: Finished difference. Result has 924 places, 933 transitions, 1879 flow [2025-01-09 21:31:11,700 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1875, PETRI_DIFFERENCE_MINUEND_PLACES=922, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=933, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=931, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1879, PETRI_PLACES=924, PETRI_TRANSITIONS=933} [2025-01-09 21:31:11,700 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -64 predicate places. [2025-01-09 21:31:11,700 INFO L471 AbstractCegarLoop]: Abstraction has has 924 places, 933 transitions, 1879 flow [2025-01-09 21:31:11,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:11,702 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:11,702 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:11,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:31:11,702 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:31:11,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:11,704 INFO L85 PathProgramCache]: Analyzing trace with hash -981952436, now seen corresponding path program 1 times [2025-01-09 21:31:11,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:11,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195011763] [2025-01-09 21:31:11,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:11,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:11,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-09 21:31:11,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-09 21:31:11,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:11,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:11,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:11,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:11,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195011763] [2025-01-09 21:31:11,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195011763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:11,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:11,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:11,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365953055] [2025-01-09 21:31:11,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:11,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:11,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:11,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:11,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:11,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1001 out of 1042 [2025-01-09 21:31:11,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 924 places, 933 transitions, 1879 flow. Second operand has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:11,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:11,803 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1001 of 1042 [2025-01-09 21:31:11,803 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:31:12,083 INFO L124 PetriNetUnfolderBase]: 53/1627 cut-off events. [2025-01-09 21:31:12,083 INFO L125 PetriNetUnfolderBase]: For 12/24 co-relation queries the response was YES. [2025-01-09 21:31:12,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1691 conditions, 1627 events. 53/1627 cut-off events. For 12/24 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 6146 event pairs, 20 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 1648. Up to 50 conditions per place. [2025-01-09 21:31:12,102 INFO L140 encePairwiseOnDemand]: 1039/1042 looper letters, 13 selfloop transitions, 2 changer transitions 0/932 dead transitions. [2025-01-09 21:31:12,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 925 places, 932 transitions, 1907 flow [2025-01-09 21:31:12,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:31:12,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:31:12,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3019 transitions. [2025-01-09 21:31:12,108 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9657709532949457 [2025-01-09 21:31:12,108 INFO L175 Difference]: Start difference. First operand has 924 places, 933 transitions, 1879 flow. Second operand 3 states and 3019 transitions. [2025-01-09 21:31:12,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 925 places, 932 transitions, 1907 flow [2025-01-09 21:31:12,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 923 places, 932 transitions, 1903 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:31:12,118 INFO L231 Difference]: Finished difference. Result has 923 places, 932 transitions, 1877 flow [2025-01-09 21:31:12,119 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1042, PETRI_DIFFERENCE_MINUEND_FLOW=1873, PETRI_DIFFERENCE_MINUEND_PLACES=921, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=932, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=930, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1877, PETRI_PLACES=923, PETRI_TRANSITIONS=932} [2025-01-09 21:31:12,119 INFO L279 CegarLoopForPetriNet]: 988 programPoint places, -65 predicate places. [2025-01-09 21:31:12,120 INFO L471 AbstractCegarLoop]: Abstraction has has 923 places, 932 transitions, 1877 flow [2025-01-09 21:31:12,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1002.3333333333334) internal successors, (3007), 3 states have internal predecessors, (3007), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:12,120 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:31:12,121 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:31:12,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:31:12,121 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 188 more)] === [2025-01-09 21:31:12,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:31:12,122 INFO L85 PathProgramCache]: Analyzing trace with hash 1952632552, now seen corresponding path program 1 times [2025-01-09 21:31:12,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:31:12,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482171722] [2025-01-09 21:31:12,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:31:12,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:31:12,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-01-09 21:31:12,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-01-09 21:31:12,147 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:31:12,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:31:12,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:31:12,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:31:12,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482171722] [2025-01-09 21:31:12,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482171722] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:31:12,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:31:12,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:31:12,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416198954] [2025-01-09 21:31:12,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:31:12,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:31:12,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:31:12,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:31:12,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:31:12,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 913 out of 1042 [2025-01-09 21:31:12,522 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 923 places, 932 transitions, 1877 flow. Second operand has 3 states, 3 states have (on average 915.0) internal successors, (2745), 3 states have internal predecessors, (2745), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:31:12,522 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:31:12,522 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 913 of 1042 [2025-01-09 21:31:12,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand