./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/reorder_5.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread/reorder_5.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 10:42:03,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 10:42:03,646 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 10:42:03,652 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 10:42:03,652 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 10:42:03,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 10:42:03,667 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 10:42:03,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 10:42:03,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 10:42:03,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 10:42:03,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 10:42:03,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 10:42:03,668 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 10:42:03,668 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 10:42:03,669 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 10:42:03,669 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 10:42:03,669 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 10:42:03,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:03,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 10:42:03,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 10:42:03,669 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 10:42:03,670 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 10:42:03,670 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 10:42:03,670 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 10:42:03,670 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 10:42:03,670 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 10:42:03,670 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 10:42:03,670 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 10:42:03,670 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/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 -> 0517a9ebb69eeca4ecbb6ac063832eb703719698fb2ee670ca348e2c511f9dfd [2025-03-17 10:42:03,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 10:42:03,919 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 10:42:03,921 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 10:42:03,922 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 10:42:03,922 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 10:42:03,922 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/reorder_5.i [2025-03-17 10:42:05,094 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4639b3/77a2d9c750e0499792fc50176e4e379f/FLAG8d8d1dd98 [2025-03-17 10:42:05,445 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 10:42:05,446 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/reorder_5.i [2025-03-17 10:42:05,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4639b3/77a2d9c750e0499792fc50176e4e379f/FLAG8d8d1dd98 [2025-03-17 10:42:05,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0a4639b3/77a2d9c750e0499792fc50176e4e379f [2025-03-17 10:42:05,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 10:42:05,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 10:42:05,656 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:05,656 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 10:42:05,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 10:42:05,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:05" (1/1) ... [2025-03-17 10:42:05,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57b6f424 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:05, skipping insertion in model container [2025-03-17 10:42:05,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 10:42:05" (1/1) ... [2025-03-17 10:42:05,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 10:42:06,119 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:06,126 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 10:42:06,176 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 10:42:06,223 INFO L204 MainTranslator]: Completed translation [2025-03-17 10:42:06,224 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06 WrapperNode [2025-03-17 10:42:06,224 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 10:42:06,225 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:06,225 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 10:42:06,225 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 10:42:06,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,243 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,270 INFO L138 Inliner]: procedures = 371, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 208 [2025-03-17 10:42:06,270 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 10:42:06,271 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 10:42:06,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 10:42:06,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 10:42:06,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,278 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,279 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,287 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,289 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,290 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,292 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 10:42:06,293 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 10:42:06,293 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 10:42:06,293 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 10:42:06,294 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (1/1) ... [2025-03-17 10:42:06,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 10:42:06,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 10:42:06,327 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 10:42:06,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 10:42:06,348 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure setThread [2025-03-17 10:42:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setThread [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure checkThread [2025-03-17 10:42:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure checkThread [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 10:42:06,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 10:42:06,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 10:42:06,350 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 10:42:06,462 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 10:42:06,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 10:42:06,782 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252: havoc main_~#setPool~0#1.base, main_~#setPool~0#1.offset; [2025-03-17 10:42:06,783 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252-1: SUMMARY for call ULTIMATE.dealloc(main_~#setPool~0#1.base, main_~#setPool~0#1.offset); srcloc: null [2025-03-17 10:42:06,783 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253: havoc main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset; [2025-03-17 10:42:06,783 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1253-1: SUMMARY for call ULTIMATE.dealloc(main_~#checkPool~0#1.base, main_~#checkPool~0#1.offset); srcloc: null [2025-03-17 10:42:06,784 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 10:42:06,784 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 10:42:06,816 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 10:42:06,819 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 10:42:06,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:06 BoogieIcfgContainer [2025-03-17 10:42:06,819 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 10:42:06,821 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 10:42:06,821 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 10:42:06,825 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 10:42:06,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 10:42:05" (1/3) ... [2025-03-17 10:42:06,825 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131f0f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:06, skipping insertion in model container [2025-03-17 10:42:06,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 10:42:06" (2/3) ... [2025-03-17 10:42:06,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@131f0f34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 10:42:06, skipping insertion in model container [2025-03-17 10:42:06,826 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 10:42:06" (3/3) ... [2025-03-17 10:42:06,827 INFO L128 eAbstractionObserver]: Analyzing ICFG reorder_5.i [2025-03-17 10:42:06,839 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 10:42:06,840 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG reorder_5.i that has 3 procedures, 224 locations, 1 initial locations, 4 loop locations, and 26 error locations. [2025-03-17 10:42:06,840 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 10:42:06,910 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-17 10:42:06,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 230 places, 242 transitions, 504 flow [2025-03-17 10:42:07,071 INFO L124 PetriNetUnfolderBase]: 37/514 cut-off events. [2025-03-17 10:42:07,072 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-17 10:42:07,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 514 events. 37/514 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 2034 event pairs, 0 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 278. Up to 8 conditions per place. [2025-03-17 10:42:07,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 230 places, 242 transitions, 504 flow [2025-03-17 10:42:07,092 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 230 places, 242 transitions, 504 flow [2025-03-17 10:42:07,102 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:42:07,114 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;@48dbc49c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:42:07,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2025-03-17 10:42:07,120 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:42:07,121 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-17 10:42:07,121 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:42:07,121 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:07,122 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] [2025-03-17 10:42:07,122 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:07,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:07,127 INFO L85 PathProgramCache]: Analyzing trace with hash 381077563, now seen corresponding path program 1 times [2025-03-17 10:42:07,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:07,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346362313] [2025-03-17 10:42:07,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:07,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:07,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 10:42:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 10:42:07,211 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:07,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:07,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:07,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346362313] [2025-03-17 10:42:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346362313] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:07,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:07,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:07,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595837325] [2025-03-17 10:42:07,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:07,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:07,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:07,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:07,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:07,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-03-17 10:42:07,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 242 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:07,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:07,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-03-17 10:42:07,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:07,531 INFO L124 PetriNetUnfolderBase]: 63/784 cut-off events. [2025-03-17 10:42:07,531 INFO L125 PetriNetUnfolderBase]: For 74/126 co-relation queries the response was YES. [2025-03-17 10:42:07,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 944 conditions, 784 events. 63/784 cut-off events. For 74/126 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3946 event pairs, 50 based on Foata normal form. 53/708 useless extension candidates. Maximal degree in co-relation 557. Up to 128 conditions per place. [2025-03-17 10:42:07,539 INFO L140 encePairwiseOnDemand]: 222/242 looper letters, 18 selfloop transitions, 1 changer transitions 6/222 dead transitions. [2025-03-17 10:42:07,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 222 transitions, 502 flow [2025-03-17 10:42:07,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 647 transitions. [2025-03-17 10:42:07,555 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8911845730027548 [2025-03-17 10:42:07,558 INFO L175 Difference]: Start difference. First operand has 230 places, 242 transitions, 504 flow. Second operand 3 states and 647 transitions. [2025-03-17 10:42:07,559 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 222 transitions, 502 flow [2025-03-17 10:42:07,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 222 transitions, 502 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:07,570 INFO L231 Difference]: Finished difference. Result has 223 places, 216 transitions, 454 flow [2025-03-17 10:42:07,573 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=464, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=216} [2025-03-17 10:42:07,577 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -7 predicate places. [2025-03-17 10:42:07,577 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 216 transitions, 454 flow [2025-03-17 10:42:07,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:07,579 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:07,579 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] [2025-03-17 10:42:07,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 10:42:07,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:07,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:07,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1071669629, now seen corresponding path program 1 times [2025-03-17 10:42:07,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:07,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930567159] [2025-03-17 10:42:07,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:07,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:07,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 10:42:07,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 10:42:07,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:07,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:07,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930567159] [2025-03-17 10:42:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930567159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:07,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010115276] [2025-03-17 10:42:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:07,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:07,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:07,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:07,675 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-03-17 10:42:07,677 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 216 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:07,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:07,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-03-17 10:42:07,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:07,884 INFO L124 PetriNetUnfolderBase]: 60/1377 cut-off events. [2025-03-17 10:42:07,885 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-03-17 10:42:07,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1544 conditions, 1377 events. 60/1377 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 8669 event pairs, 28 based on Foata normal form. 0/1162 useless extension candidates. Maximal degree in co-relation 742. Up to 51 conditions per place. [2025-03-17 10:42:07,890 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/225 dead transitions. [2025-03-17 10:42:07,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 225 transitions, 534 flow [2025-03-17 10:42:07,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:07,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:07,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-03-17 10:42:07,895 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-03-17 10:42:07,896 INFO L175 Difference]: Start difference. First operand has 223 places, 216 transitions, 454 flow. Second operand 3 states and 662 transitions. [2025-03-17 10:42:07,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 225 transitions, 534 flow [2025-03-17 10:42:07,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 225 transitions, 533 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:07,903 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 453 flow [2025-03-17 10:42:07,904 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-03-17 10:42:07,905 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -13 predicate places. [2025-03-17 10:42:07,905 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 453 flow [2025-03-17 10:42:07,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:07,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:07,906 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:07,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 10:42:07,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:07,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:07,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1138113390, now seen corresponding path program 1 times [2025-03-17 10:42:07,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:07,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171296341] [2025-03-17 10:42:07,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:07,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:07,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 10:42:07,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 10:42:07,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:07,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:07,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:07,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:07,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171296341] [2025-03-17 10:42:07,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171296341] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:07,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:07,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:07,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16396734] [2025-03-17 10:42:07,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:07,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:07,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:07,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:07,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:07,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 242 [2025-03-17 10:42:08,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:08,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 242 [2025-03-17 10:42:08,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:08,175 INFO L124 PetriNetUnfolderBase]: 232/1654 cut-off events. [2025-03-17 10:42:08,176 INFO L125 PetriNetUnfolderBase]: For 154/458 co-relation queries the response was YES. [2025-03-17 10:42:08,179 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2183 conditions, 1654 events. 232/1654 cut-off events. For 154/458 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10741 event pairs, 52 based on Foata normal form. 19/1466 useless extension candidates. Maximal degree in co-relation 1088. Up to 355 conditions per place. [2025-03-17 10:42:08,182 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 15 selfloop transitions, 1 changer transitions 24/219 dead transitions. [2025-03-17 10:42:08,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 219 transitions, 527 flow [2025-03-17 10:42:08,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:08,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:08,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 630 transitions. [2025-03-17 10:42:08,184 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8677685950413223 [2025-03-17 10:42:08,184 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 453 flow. Second operand 3 states and 630 transitions. [2025-03-17 10:42:08,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 219 transitions, 527 flow [2025-03-17 10:42:08,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 219 transitions, 526 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:08,189 INFO L231 Difference]: Finished difference. Result has 212 places, 191 transitions, 406 flow [2025-03-17 10:42:08,189 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=440, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=406, PETRI_PLACES=212, PETRI_TRANSITIONS=191} [2025-03-17 10:42:08,190 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -18 predicate places. [2025-03-17 10:42:08,190 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 191 transitions, 406 flow [2025-03-17 10:42:08,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 198.66666666666666) internal successors, (596), 3 states have internal predecessors, (596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:08,191 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] [2025-03-17 10:42:08,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 10:42:08,191 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:08,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:08,192 INFO L85 PathProgramCache]: Analyzing trace with hash -773415250, now seen corresponding path program 1 times [2025-03-17 10:42:08,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:08,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963692700] [2025-03-17 10:42:08,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:08,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:08,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 10:42:08,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 10:42:08,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:08,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:08,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:08,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:08,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963692700] [2025-03-17 10:42:08,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963692700] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:08,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:08,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:08,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938783025] [2025-03-17 10:42:08,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:08,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:08,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:08,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:08,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:08,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 242 [2025-03-17 10:42:08,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 191 transitions, 406 flow. Second operand has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,261 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:08,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 242 [2025-03-17 10:42:08,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:08,390 INFO L124 PetriNetUnfolderBase]: 184/1551 cut-off events. [2025-03-17 10:42:08,390 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-03-17 10:42:08,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2020 conditions, 1551 events. 184/1551 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 10295 event pairs, 156 based on Foata normal form. 0/1351 useless extension candidates. Maximal degree in co-relation 1839. Up to 362 conditions per place. [2025-03-17 10:42:08,395 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/188 dead transitions. [2025-03-17 10:42:08,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 188 transitions, 440 flow [2025-03-17 10:42:08,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:08,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:08,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 633 transitions. [2025-03-17 10:42:08,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.871900826446281 [2025-03-17 10:42:08,397 INFO L175 Difference]: Start difference. First operand has 212 places, 191 transitions, 406 flow. Second operand 3 states and 633 transitions. [2025-03-17 10:42:08,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 188 transitions, 440 flow [2025-03-17 10:42:08,400 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 188 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:08,402 INFO L231 Difference]: Finished difference. Result has 192 places, 188 transitions, 407 flow [2025-03-17 10:42:08,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=407, PETRI_PLACES=192, PETRI_TRANSITIONS=188} [2025-03-17 10:42:08,403 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -38 predicate places. [2025-03-17 10:42:08,403 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 188 transitions, 407 flow [2025-03-17 10:42:08,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.66666666666666) internal successors, (611), 3 states have internal predecessors, (611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:08,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:08,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 10:42:08,404 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:08,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:08,404 INFO L85 PathProgramCache]: Analyzing trace with hash 268542788, now seen corresponding path program 1 times [2025-03-17 10:42:08,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:08,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574348308] [2025-03-17 10:42:08,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:08,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:08,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 10:42:08,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 10:42:08,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:08,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:08,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:08,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:08,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574348308] [2025-03-17 10:42:08,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574348308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:08,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:08,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:08,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348537758] [2025-03-17 10:42:08,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:08,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:08,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:08,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:08,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:08,470 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-03-17 10:42:08,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 188 transitions, 407 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:08,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-03-17 10:42:08,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:08,622 INFO L124 PetriNetUnfolderBase]: 124/1330 cut-off events. [2025-03-17 10:42:08,623 INFO L125 PetriNetUnfolderBase]: For 112/216 co-relation queries the response was YES. [2025-03-17 10:42:08,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1330 events. 124/1330 cut-off events. For 112/216 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8426 event pairs, 96 based on Foata normal form. 0/1141 useless extension candidates. Maximal degree in co-relation 840. Up to 250 conditions per place. [2025-03-17 10:42:08,627 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 17 selfloop transitions, 2 changer transitions 3/187 dead transitions. [2025-03-17 10:42:08,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 187 transitions, 445 flow [2025-03-17 10:42:08,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:08,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:08,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-17 10:42:08,628 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-03-17 10:42:08,629 INFO L175 Difference]: Start difference. First operand has 192 places, 188 transitions, 407 flow. Second operand 3 states and 636 transitions. [2025-03-17 10:42:08,629 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 187 transitions, 445 flow [2025-03-17 10:42:08,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 187 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:08,635 INFO L231 Difference]: Finished difference. Result has 193 places, 184 transitions, 403 flow [2025-03-17 10:42:08,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=405, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=403, PETRI_PLACES=193, PETRI_TRANSITIONS=184} [2025-03-17 10:42:08,636 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -37 predicate places. [2025-03-17 10:42:08,636 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 184 transitions, 403 flow [2025-03-17 10:42:08,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:08,636 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] [2025-03-17 10:42:08,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 10:42:08,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:08,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:08,637 INFO L85 PathProgramCache]: Analyzing trace with hash 217820038, now seen corresponding path program 1 times [2025-03-17 10:42:08,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:08,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-03-17 10:42:08,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:08,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:08,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:42:08,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:42:08,652 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:08,652 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:08,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:08,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:08,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697323397] [2025-03-17 10:42:08,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697323397] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:08,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:08,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:08,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330854681] [2025-03-17 10:42:08,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:08,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:08,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:08,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:08,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:08,708 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 213 out of 242 [2025-03-17 10:42:08,709 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 184 transitions, 403 flow. Second operand has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:08,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 213 of 242 [2025-03-17 10:42:08,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:08,837 INFO L124 PetriNetUnfolderBase]: 60/1177 cut-off events. [2025-03-17 10:42:08,837 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-03-17 10:42:08,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1370 conditions, 1177 events. 60/1177 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6864 event pairs, 28 based on Foata normal form. 0/1033 useless extension candidates. Maximal degree in co-relation 684. Up to 51 conditions per place. [2025-03-17 10:42:08,842 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 21 selfloop transitions, 1 changer transitions 0/193 dead transitions. [2025-03-17 10:42:08,843 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 483 flow [2025-03-17 10:42:08,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:08,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:08,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 662 transitions. [2025-03-17 10:42:08,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9118457300275482 [2025-03-17 10:42:08,845 INFO L175 Difference]: Start difference. First operand has 193 places, 184 transitions, 403 flow. Second operand 3 states and 662 transitions. [2025-03-17 10:42:08,845 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 483 flow [2025-03-17 10:42:08,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 479 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:08,847 INFO L231 Difference]: Finished difference. Result has 189 places, 183 transitions, 399 flow [2025-03-17 10:42:08,848 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=183, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=189, PETRI_TRANSITIONS=183} [2025-03-17 10:42:08,848 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-03-17 10:42:08,848 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 183 transitions, 399 flow [2025-03-17 10:42:08,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.66666666666666) internal successors, (641), 3 states have internal predecessors, (641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,849 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:08,849 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] [2025-03-17 10:42:08,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 10:42:08,849 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:08,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:08,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1630578327, now seen corresponding path program 1 times [2025-03-17 10:42:08,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:08,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440453791] [2025-03-17 10:42:08,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:08,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:08,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 10:42:08,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 10:42:08,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:08,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:08,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:08,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:08,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440453791] [2025-03-17 10:42:08,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440453791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:08,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:08,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:08,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025509834] [2025-03-17 10:42:08,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:08,891 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:08,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:08,891 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:08,891 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:08,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 242 [2025-03-17 10:42:08,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 183 transitions, 399 flow. Second operand has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:08,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:08,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 242 [2025-03-17 10:42:08,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:09,023 INFO L124 PetriNetUnfolderBase]: 120/1268 cut-off events. [2025-03-17 10:42:09,023 INFO L125 PetriNetUnfolderBase]: For 118/222 co-relation queries the response was YES. [2025-03-17 10:42:09,026 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1268 events. 120/1268 cut-off events. For 118/222 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 7936 event pairs, 92 based on Foata normal form. 0/1085 useless extension candidates. Maximal degree in co-relation 808. Up to 234 conditions per place. [2025-03-17 10:42:09,028 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 18 selfloop transitions, 2 changer transitions 0/182 dead transitions. [2025-03-17 10:42:09,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 182 transitions, 437 flow [2025-03-17 10:42:09,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:09,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:09,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2025-03-17 10:42:09,030 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746556473829201 [2025-03-17 10:42:09,030 INFO L175 Difference]: Start difference. First operand has 189 places, 183 transitions, 399 flow. Second operand 3 states and 635 transitions. [2025-03-17 10:42:09,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 182 transitions, 437 flow [2025-03-17 10:42:09,031 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 182 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:09,033 INFO L231 Difference]: Finished difference. Result has 189 places, 182 transitions, 400 flow [2025-03-17 10:42:09,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=396, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=182, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=400, PETRI_PLACES=189, PETRI_TRANSITIONS=182} [2025-03-17 10:42:09,035 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -41 predicate places. [2025-03-17 10:42:09,035 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 182 transitions, 400 flow [2025-03-17 10:42:09,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 206.33333333333334) internal successors, (619), 3 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:09,035 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:09,035 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:09,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 10:42:09,036 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:09,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:09,037 INFO L85 PathProgramCache]: Analyzing trace with hash -1354774386, now seen corresponding path program 1 times [2025-03-17 10:42:09,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:09,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137511598] [2025-03-17 10:42:09,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:09,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:09,050 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 10:42:09,059 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 10:42:09,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:09,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:09,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137511598] [2025-03-17 10:42:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137511598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:09,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:09,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:42:09,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636995113] [2025-03-17 10:42:09,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:09,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:09,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:09,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:09,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:09,099 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 242 [2025-03-17 10:42:09,100 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 182 transitions, 400 flow. Second operand has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:09,100 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:09,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 242 [2025-03-17 10:42:09,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:09,186 INFO L124 PetriNetUnfolderBase]: 58/1164 cut-off events. [2025-03-17 10:42:09,187 INFO L125 PetriNetUnfolderBase]: For 130/306 co-relation queries the response was YES. [2025-03-17 10:42:09,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1365 conditions, 1164 events. 58/1164 cut-off events. For 130/306 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 6780 event pairs, 28 based on Foata normal form. 2/1023 useless extension candidates. Maximal degree in co-relation 695. Up to 110 conditions per place. [2025-03-17 10:42:09,192 INFO L140 encePairwiseOnDemand]: 240/242 looper letters, 16 selfloop transitions, 0 changer transitions 1/181 dead transitions. [2025-03-17 10:42:09,192 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 181 transitions, 429 flow [2025-03-17 10:42:09,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:09,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:09,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 636 transitions. [2025-03-17 10:42:09,194 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8760330578512396 [2025-03-17 10:42:09,194 INFO L175 Difference]: Start difference. First operand has 189 places, 182 transitions, 400 flow. Second operand 3 states and 636 transitions. [2025-03-17 10:42:09,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 181 transitions, 429 flow [2025-03-17 10:42:09,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 181 transitions, 421 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 10:42:09,197 INFO L231 Difference]: Finished difference. Result has 188 places, 180 transitions, 387 flow [2025-03-17 10:42:09,198 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=387, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=181, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=387, PETRI_PLACES=188, PETRI_TRANSITIONS=180} [2025-03-17 10:42:09,198 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -42 predicate places. [2025-03-17 10:42:09,199 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 180 transitions, 387 flow [2025-03-17 10:42:09,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 207.66666666666666) internal successors, (623), 3 states have internal predecessors, (623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:09,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:09,200 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] [2025-03-17 10:42:09,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 10:42:09,200 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:09,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:09,200 INFO L85 PathProgramCache]: Analyzing trace with hash 2097111441, now seen corresponding path program 1 times [2025-03-17 10:42:09,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:09,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758491922] [2025-03-17 10:42:09,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:09,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:09,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 10:42:09,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 10:42:09,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:09,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:09,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:09,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:09,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758491922] [2025-03-17 10:42:09,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758491922] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:09,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:09,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:09,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017234798] [2025-03-17 10:42:09,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:09,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:09,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:09,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:09,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:09,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 242 [2025-03-17 10:42:09,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 180 transitions, 387 flow. Second operand has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:09,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:09,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 242 [2025-03-17 10:42:09,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:10,089 INFO L124 PetriNetUnfolderBase]: 652/3388 cut-off events. [2025-03-17 10:42:10,089 INFO L125 PetriNetUnfolderBase]: For 96/106 co-relation queries the response was YES. [2025-03-17 10:42:10,095 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4910 conditions, 3388 events. 652/3388 cut-off events. For 96/106 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 28227 event pairs, 296 based on Foata normal form. 0/3003 useless extension candidates. Maximal degree in co-relation 4904. Up to 1255 conditions per place. [2025-03-17 10:42:10,103 INFO L140 encePairwiseOnDemand]: 236/242 looper letters, 44 selfloop transitions, 5 changer transitions 4/187 dead transitions. [2025-03-17 10:42:10,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 187 transitions, 501 flow [2025-03-17 10:42:10,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:10,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1137 transitions. [2025-03-17 10:42:10,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7830578512396694 [2025-03-17 10:42:10,107 INFO L175 Difference]: Start difference. First operand has 188 places, 180 transitions, 387 flow. Second operand 6 states and 1137 transitions. [2025-03-17 10:42:10,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 187 transitions, 501 flow [2025-03-17 10:42:10,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 187 transitions, 499 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:10,112 INFO L231 Difference]: Finished difference. Result has 190 places, 175 transitions, 385 flow [2025-03-17 10:42:10,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=383, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=174, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=385, PETRI_PLACES=190, PETRI_TRANSITIONS=175} [2025-03-17 10:42:10,113 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -40 predicate places. [2025-03-17 10:42:10,114 INFO L471 AbstractCegarLoop]: Abstraction has has 190 places, 175 transitions, 385 flow [2025-03-17 10:42:10,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.66666666666666) internal successors, (1096), 6 states have internal predecessors, (1096), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:10,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:10,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:10,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 10:42:10,115 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:10,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:10,115 INFO L85 PathProgramCache]: Analyzing trace with hash 1581034050, now seen corresponding path program 1 times [2025-03-17 10:42:10,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:10,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75118309] [2025-03-17 10:42:10,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:10,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:10,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:42:10,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:42:10,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:10,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:10,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:10,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75118309] [2025-03-17 10:42:10,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75118309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:10,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:42:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319771882] [2025-03-17 10:42:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:10,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:42:10,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:10,199 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:42:10,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:42:10,326 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 242 [2025-03-17 10:42:10,327 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 175 transitions, 385 flow. Second operand has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:10,327 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:10,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 242 [2025-03-17 10:42:10,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:10,481 INFO L124 PetriNetUnfolderBase]: 159/1449 cut-off events. [2025-03-17 10:42:10,481 INFO L125 PetriNetUnfolderBase]: For 90/192 co-relation queries the response was YES. [2025-03-17 10:42:10,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1906 conditions, 1449 events. 159/1449 cut-off events. For 90/192 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 9748 event pairs, 120 based on Foata normal form. 11/1288 useless extension candidates. Maximal degree in co-relation 1900. Up to 209 conditions per place. [2025-03-17 10:42:10,487 INFO L140 encePairwiseOnDemand]: 230/242 looper letters, 42 selfloop transitions, 10 changer transitions 0/203 dead transitions. [2025-03-17 10:42:10,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 203 transitions, 569 flow [2025-03-17 10:42:10,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:42:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 10:42:10,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 858 transitions. [2025-03-17 10:42:10,490 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8863636363636364 [2025-03-17 10:42:10,490 INFO L175 Difference]: Start difference. First operand has 190 places, 175 transitions, 385 flow. Second operand 4 states and 858 transitions. [2025-03-17 10:42:10,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 203 transitions, 569 flow [2025-03-17 10:42:10,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 203 transitions, 559 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:42:10,493 INFO L231 Difference]: Finished difference. Result has 186 places, 183 transitions, 449 flow [2025-03-17 10:42:10,494 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=175, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=449, PETRI_PLACES=186, PETRI_TRANSITIONS=183} [2025-03-17 10:42:10,495 INFO L279 CegarLoopForPetriNet]: 230 programPoint places, -44 predicate places. [2025-03-17 10:42:10,495 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 183 transitions, 449 flow [2025-03-17 10:42:10,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 202.5) internal successors, (810), 4 states have internal predecessors, (810), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:10,496 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:10,496 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:10,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 10:42:10,496 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 30 more)] === [2025-03-17 10:42:10,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1843956427, now seen corresponding path program 1 times [2025-03-17 10:42:10,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:10,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971896548] [2025-03-17 10:42:10,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:10,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:10,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:42:10,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:42:10,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:10,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:42:10,533 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:42:10,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-03-17 10:42:10,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-03-17 10:42:10,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:10,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:42:10,574 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:42:10,574 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:42:10,575 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (32 of 33 remaining) [2025-03-17 10:42:10,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (31 of 33 remaining) [2025-03-17 10:42:10,576 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (30 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (29 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (28 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (27 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (26 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (25 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (24 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (23 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (22 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (21 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (20 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (19 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (18 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (16 of 33 remaining) [2025-03-17 10:42:10,577 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (15 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (13 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (8 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (6 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 33 remaining) [2025-03-17 10:42:10,578 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 33 remaining) [2025-03-17 10:42:10,579 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 33 remaining) [2025-03-17 10:42:10,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 10:42:10,579 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:10,581 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:42:10,581 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-17 10:42:10,614 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-17 10:42:10,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 258 places, 271 transitions, 586 flow [2025-03-17 10:42:10,749 INFO L124 PetriNetUnfolderBase]: 149/1607 cut-off events. [2025-03-17 10:42:10,749 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-03-17 10:42:10,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1696 conditions, 1607 events. 149/1607 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 9251 event pairs, 2 based on Foata normal form. 0/1314 useless extension candidates. Maximal degree in co-relation 931. Up to 32 conditions per place. [2025-03-17 10:42:10,757 INFO L82 GeneralOperation]: Start removeDead. Operand has 258 places, 271 transitions, 586 flow [2025-03-17 10:42:10,767 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 271 transitions, 586 flow [2025-03-17 10:42:10,768 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:42:10,769 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;@48dbc49c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:42:10,769 INFO L334 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2025-03-17 10:42:10,771 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:42:10,773 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-17 10:42:10,773 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:42:10,773 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:10,773 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] [2025-03-17 10:42:10,773 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:10,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:10,774 INFO L85 PathProgramCache]: Analyzing trace with hash -300789637, now seen corresponding path program 1 times [2025-03-17 10:42:10,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:10,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633966026] [2025-03-17 10:42:10,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:10,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:10,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 10:42:10,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 10:42:10,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:10,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:10,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:10,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:10,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633966026] [2025-03-17 10:42:10,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633966026] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:10,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:10,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:10,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219579366] [2025-03-17 10:42:10,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:10,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:10,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:10,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:10,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:10,810 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-03-17 10:42:10,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 271 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:10,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:10,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-03-17 10:42:10,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:11,667 INFO L124 PetriNetUnfolderBase]: 2218/9953 cut-off events. [2025-03-17 10:42:11,667 INFO L125 PetriNetUnfolderBase]: For 2120/5189 co-relation queries the response was YES. [2025-03-17 10:42:11,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13940 conditions, 9953 events. 2218/9953 cut-off events. For 2120/5189 co-relation queries the response was YES. Maximal size of possible extension queue 298. Compared 103754 event pairs, 1905 based on Foata normal form. 879/9106 useless extension candidates. Maximal degree in co-relation 9049. Up to 3249 conditions per place. [2025-03-17 10:42:11,761 INFO L140 encePairwiseOnDemand]: 246/271 looper letters, 28 selfloop transitions, 1 changer transitions 4/245 dead transitions. [2025-03-17 10:42:11,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 245 transitions, 592 flow [2025-03-17 10:42:11,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:11,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 701 transitions. [2025-03-17 10:42:11,764 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8622386223862238 [2025-03-17 10:42:11,764 INFO L175 Difference]: Start difference. First operand has 258 places, 271 transitions, 586 flow. Second operand 3 states and 701 transitions. [2025-03-17 10:42:11,764 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 245 transitions, 592 flow [2025-03-17 10:42:11,766 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 245 transitions, 592 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:11,771 INFO L231 Difference]: Finished difference. Result has 246 places, 241 transitions, 528 flow [2025-03-17 10:42:11,772 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=245, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=244, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=528, PETRI_PLACES=246, PETRI_TRANSITIONS=241} [2025-03-17 10:42:11,773 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -12 predicate places. [2025-03-17 10:42:11,773 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 241 transitions, 528 flow [2025-03-17 10:42:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:11,774 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:11,774 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] [2025-03-17 10:42:11,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 10:42:11,774 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:11,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:11,775 INFO L85 PathProgramCache]: Analyzing trace with hash -734716080, now seen corresponding path program 1 times [2025-03-17 10:42:11,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:11,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614972841] [2025-03-17 10:42:11,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:11,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:11,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-17 10:42:11,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-17 10:42:11,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:11,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:11,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:11,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:11,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614972841] [2025-03-17 10:42:11,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614972841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:11,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:11,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:11,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414424572] [2025-03-17 10:42:11,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:11,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:11,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:11,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:11,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:11,808 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-03-17 10:42:11,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 241 transitions, 528 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:11,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:11,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-03-17 10:42:11,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:13,413 INFO L124 PetriNetUnfolderBase]: 2492/17389 cut-off events. [2025-03-17 10:42:13,414 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-03-17 10:42:13,460 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22356 conditions, 17389 events. 2492/17389 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 215995 event pairs, 1706 based on Foata normal form. 0/14144 useless extension candidates. Maximal degree in co-relation 11147. Up to 1670 conditions per place. [2025-03-17 10:42:13,515 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/260 dead transitions. [2025-03-17 10:42:13,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 260 transitions, 690 flow [2025-03-17 10:42:13,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:13,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:13,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-03-17 10:42:13,517 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-03-17 10:42:13,517 INFO L175 Difference]: Start difference. First operand has 246 places, 241 transitions, 528 flow. Second operand 3 states and 721 transitions. [2025-03-17 10:42:13,517 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 260 transitions, 690 flow [2025-03-17 10:42:13,520 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 260 transitions, 689 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:13,522 INFO L231 Difference]: Finished difference. Result has 242 places, 240 transitions, 527 flow [2025-03-17 10:42:13,523 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=239, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=242, PETRI_TRANSITIONS=240} [2025-03-17 10:42:13,523 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -16 predicate places. [2025-03-17 10:42:13,523 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 240 transitions, 527 flow [2025-03-17 10:42:13,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:13,524 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:13,524 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:13,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 10:42:13,524 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:13,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:13,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1301228210, now seen corresponding path program 1 times [2025-03-17 10:42:13,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:13,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370428886] [2025-03-17 10:42:13,525 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:13,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:13,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-17 10:42:13,530 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-17 10:42:13,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:13,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:13,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:13,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370428886] [2025-03-17 10:42:13,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370428886] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:13,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:13,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:13,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901382126] [2025-03-17 10:42:13,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:13,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:13,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:13,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:13,542 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:13,560 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 271 [2025-03-17 10:42:13,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 240 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:13,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:13,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 271 [2025-03-17 10:42:13,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:16,825 INFO L124 PetriNetUnfolderBase]: 14770/40622 cut-off events. [2025-03-17 10:42:16,825 INFO L125 PetriNetUnfolderBase]: For 8274/46430 co-relation queries the response was YES. [2025-03-17 10:42:16,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64561 conditions, 40622 events. 14770/40622 cut-off events. For 8274/46430 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 463629 event pairs, 4272 based on Foata normal form. 121/35650 useless extension candidates. Maximal degree in co-relation 32276. Up to 17809 conditions per place. [2025-03-17 10:42:17,022 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 41 selfloop transitions, 2 changer transitions 18/255 dead transitions. [2025-03-17 10:42:17,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 237 places, 255 transitions, 696 flow [2025-03-17 10:42:17,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:17,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:17,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-03-17 10:42:17,024 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-03-17 10:42:17,024 INFO L175 Difference]: Start difference. First operand has 242 places, 240 transitions, 527 flow. Second operand 3 states and 686 transitions. [2025-03-17 10:42:17,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 237 places, 255 transitions, 696 flow [2025-03-17 10:42:17,027 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 255 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:17,029 INFO L231 Difference]: Finished difference. Result has 237 places, 220 transitions, 496 flow [2025-03-17 10:42:17,029 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=237, PETRI_TRANSITIONS=220} [2025-03-17 10:42:17,030 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -21 predicate places. [2025-03-17 10:42:17,030 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 220 transitions, 496 flow [2025-03-17 10:42:17,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 208.66666666666666) internal successors, (626), 3 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:17,030 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:17,030 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] [2025-03-17 10:42:17,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 10:42:17,031 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:17,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash 71459374, now seen corresponding path program 1 times [2025-03-17 10:42:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205248217] [2025-03-17 10:42:17,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:17,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-17 10:42:17,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-17 10:42:17,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:17,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:17,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:17,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:17,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205248217] [2025-03-17 10:42:17,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205248217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:17,047 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:17,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:17,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88295977] [2025-03-17 10:42:17,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:17,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:17,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:17,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:17,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:17,060 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 271 [2025-03-17 10:42:17,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 220 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:17,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:17,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 271 [2025-03-17 10:42:17,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:18,812 INFO L124 PetriNetUnfolderBase]: 6096/21809 cut-off events. [2025-03-17 10:42:18,813 INFO L125 PetriNetUnfolderBase]: For 4256/10796 co-relation queries the response was YES. [2025-03-17 10:42:18,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33778 conditions, 21809 events. 6096/21809 cut-off events. For 4256/10796 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 243999 event pairs, 5210 based on Foata normal form. 0/19055 useless extension candidates. Maximal degree in co-relation 28671. Up to 8524 conditions per place. [2025-03-17 10:42:18,964 INFO L140 encePairwiseOnDemand]: 265/271 looper letters, 28 selfloop transitions, 2 changer transitions 0/217 dead transitions. [2025-03-17 10:42:18,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 217 transitions, 550 flow [2025-03-17 10:42:18,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:18,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:18,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 682 transitions. [2025-03-17 10:42:18,966 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388683886838868 [2025-03-17 10:42:18,967 INFO L175 Difference]: Start difference. First operand has 237 places, 220 transitions, 496 flow. Second operand 3 states and 682 transitions. [2025-03-17 10:42:18,967 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 217 transitions, 550 flow [2025-03-17 10:42:18,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 217 transitions, 550 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:18,972 INFO L231 Difference]: Finished difference. Result has 221 places, 217 transitions, 498 flow [2025-03-17 10:42:18,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=218, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=498, PETRI_PLACES=221, PETRI_TRANSITIONS=217} [2025-03-17 10:42:18,973 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -37 predicate places. [2025-03-17 10:42:18,973 INFO L471 AbstractCegarLoop]: Abstraction has has 221 places, 217 transitions, 498 flow [2025-03-17 10:42:18,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.66666666666666) internal successors, (650), 3 states have internal predecessors, (650), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:18,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:18,974 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] [2025-03-17 10:42:18,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 10:42:18,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:18,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:18,975 INFO L85 PathProgramCache]: Analyzing trace with hash 444246116, now seen corresponding path program 1 times [2025-03-17 10:42:18,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:18,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513868019] [2025-03-17 10:42:18,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:18,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:18,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-17 10:42:18,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-17 10:42:18,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:18,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:18,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:18,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:18,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513868019] [2025-03-17 10:42:18,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513868019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:18,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:18,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:18,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239435651] [2025-03-17 10:42:18,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:18,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:18,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:18,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:18,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:19,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-03-17 10:42:19,011 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 221 places, 217 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:19,011 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:19,011 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-03-17 10:42:19,011 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:20,560 INFO L124 PetriNetUnfolderBase]: 4656/18252 cut-off events. [2025-03-17 10:42:20,561 INFO L125 PetriNetUnfolderBase]: For 4254/12402 co-relation queries the response was YES. [2025-03-17 10:42:20,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27758 conditions, 18252 events. 4656/18252 cut-off events. For 4254/12402 co-relation queries the response was YES. Maximal size of possible extension queue 558. Compared 205556 event pairs, 3782 based on Foata normal form. 0/15259 useless extension candidates. Maximal degree in co-relation 24022. Up to 6578 conditions per place. [2025-03-17 10:42:20,652 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 28 selfloop transitions, 2 changer transitions 2/216 dead transitions. [2025-03-17 10:42:20,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 216 transitions, 556 flow [2025-03-17 10:42:20,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:20,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:20,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-03-17 10:42:20,654 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-03-17 10:42:20,654 INFO L175 Difference]: Start difference. First operand has 221 places, 217 transitions, 498 flow. Second operand 3 states and 685 transitions. [2025-03-17 10:42:20,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 216 transitions, 556 flow [2025-03-17 10:42:20,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 216 transitions, 556 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:20,658 INFO L231 Difference]: Finished difference. Result has 222 places, 214 transitions, 496 flow [2025-03-17 10:42:20,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=496, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=496, PETRI_PLACES=222, PETRI_TRANSITIONS=214} [2025-03-17 10:42:20,659 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2025-03-17 10:42:20,659 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 214 transitions, 496 flow [2025-03-17 10:42:20,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:20,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:20,659 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:20,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 10:42:20,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:20,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1896282746, now seen corresponding path program 1 times [2025-03-17 10:42:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883706182] [2025-03-17 10:42:20,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:20,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-17 10:42:20,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-17 10:42:20,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:20,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:20,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:20,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:20,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883706182] [2025-03-17 10:42:20,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883706182] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:20,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:20,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787619104] [2025-03-17 10:42:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:20,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:20,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:20,692 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:20,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:20,702 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 271 [2025-03-17 10:42:20,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 214 transitions, 496 flow. Second operand has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:20,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:20,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 271 [2025-03-17 10:42:20,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:21,828 INFO L124 PetriNetUnfolderBase]: 2546/15313 cut-off events. [2025-03-17 10:42:21,828 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-03-17 10:42:21,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20987 conditions, 15313 events. 2546/15313 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 413. Compared 181172 event pairs, 1706 based on Foata normal form. 0/12925 useless extension candidates. Maximal degree in co-relation 19194. Up to 1670 conditions per place. [2025-03-17 10:42:21,927 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 41 selfloop transitions, 1 changer transitions 0/233 dead transitions. [2025-03-17 10:42:21,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 233 transitions, 658 flow [2025-03-17 10:42:21,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:21,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 721 transitions. [2025-03-17 10:42:21,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8868388683886839 [2025-03-17 10:42:21,931 INFO L175 Difference]: Start difference. First operand has 222 places, 214 transitions, 496 flow. Second operand 3 states and 721 transitions. [2025-03-17 10:42:21,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 233 transitions, 658 flow [2025-03-17 10:42:21,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 233 transitions, 654 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 10:42:21,937 INFO L231 Difference]: Finished difference. Result has 219 places, 213 transitions, 492 flow [2025-03-17 10:42:21,937 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=490, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=213, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=492, PETRI_PLACES=219, PETRI_TRANSITIONS=213} [2025-03-17 10:42:21,937 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-03-17 10:42:21,937 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 213 transitions, 492 flow [2025-03-17 10:42:21,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 226.66666666666666) internal successors, (680), 3 states have internal predecessors, (680), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:21,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:21,938 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] [2025-03-17 10:42:21,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 10:42:21,938 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:21,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:21,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1986481462, now seen corresponding path program 1 times [2025-03-17 10:42:21,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:21,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643268818] [2025-03-17 10:42:21,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:21,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:21,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 10:42:21,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 10:42:21,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:21,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:21,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:21,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:21,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643268818] [2025-03-17 10:42:21,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643268818] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:21,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:21,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:21,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591363329] [2025-03-17 10:42:21,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:21,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:21,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:21,974 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:21,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:21,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 218 out of 271 [2025-03-17 10:42:21,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 213 transitions, 492 flow. Second operand has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:21,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:21,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 218 of 271 [2025-03-17 10:42:21,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:23,768 INFO L124 PetriNetUnfolderBase]: 5342/19618 cut-off events. [2025-03-17 10:42:23,769 INFO L125 PetriNetUnfolderBase]: For 4260/12460 co-relation queries the response was YES. [2025-03-17 10:42:23,884 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30270 conditions, 19618 events. 5342/19618 cut-off events. For 4260/12460 co-relation queries the response was YES. Maximal size of possible extension queue 594. Compared 222624 event pairs, 4482 based on Foata normal form. 0/16493 useless extension candidates. Maximal degree in co-relation 25847. Up to 7458 conditions per place. [2025-03-17 10:42:23,938 INFO L140 encePairwiseOnDemand]: 268/271 looper letters, 29 selfloop transitions, 2 changer transitions 0/212 dead transitions. [2025-03-17 10:42:23,938 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 212 transitions, 552 flow [2025-03-17 10:42:23,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 685 transitions. [2025-03-17 10:42:23,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8425584255842559 [2025-03-17 10:42:23,939 INFO L175 Difference]: Start difference. First operand has 219 places, 213 transitions, 492 flow. Second operand 3 states and 685 transitions. [2025-03-17 10:42:23,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 212 transitions, 552 flow [2025-03-17 10:42:23,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 219 places, 212 transitions, 551 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:23,945 INFO L231 Difference]: Finished difference. Result has 219 places, 212 transitions, 493 flow [2025-03-17 10:42:23,945 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=489, PETRI_DIFFERENCE_MINUEND_PLACES=217, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=212, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=210, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=493, PETRI_PLACES=219, PETRI_TRANSITIONS=212} [2025-03-17 10:42:23,945 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -39 predicate places. [2025-03-17 10:42:23,945 INFO L471 AbstractCegarLoop]: Abstraction has has 219 places, 212 transitions, 493 flow [2025-03-17 10:42:23,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:23,946 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:23,946 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:23,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-17 10:42:23,946 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:23,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:23,947 INFO L85 PathProgramCache]: Analyzing trace with hash -91776133, now seen corresponding path program 1 times [2025-03-17 10:42:23,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:23,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945279241] [2025-03-17 10:42:23,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:23,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:23,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 10:42:23,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 10:42:23,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:23,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:23,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:23,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:23,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945279241] [2025-03-17 10:42:23,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945279241] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:23,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:23,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 10:42:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467439385] [2025-03-17 10:42:23,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:23,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:23,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:23,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:23,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:23,977 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 271 [2025-03-17 10:42:23,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 219 places, 212 transitions, 493 flow. Second operand has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:23,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:23,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 271 [2025-03-17 10:42:23,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:25,533 INFO L124 PetriNetUnfolderBase]: 3752/18416 cut-off events. [2025-03-17 10:42:25,533 INFO L125 PetriNetUnfolderBase]: For 4748/26624 co-relation queries the response was YES. [2025-03-17 10:42:25,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26174 conditions, 18416 events. 3752/18416 cut-off events. For 4748/26624 co-relation queries the response was YES. Maximal size of possible extension queue 542. Compared 217841 event pairs, 2730 based on Foata normal form. 2/15381 useless extension candidates. Maximal degree in co-relation 23379. Up to 5036 conditions per place. [2025-03-17 10:42:25,634 INFO L140 encePairwiseOnDemand]: 269/271 looper letters, 27 selfloop transitions, 0 changer transitions 1/211 dead transitions. [2025-03-17 10:42:25,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 211 transitions, 544 flow [2025-03-17 10:42:25,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 10:42:25,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 10:42:25,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-03-17 10:42:25,637 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437884378843789 [2025-03-17 10:42:25,637 INFO L175 Difference]: Start difference. First operand has 219 places, 212 transitions, 493 flow. Second operand 3 states and 686 transitions. [2025-03-17 10:42:25,637 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 211 transitions, 544 flow [2025-03-17 10:42:25,640 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 217 places, 211 transitions, 536 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-17 10:42:25,641 INFO L231 Difference]: Finished difference. Result has 218 places, 210 transitions, 480 flow [2025-03-17 10:42:25,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=480, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=211, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=480, PETRI_PLACES=218, PETRI_TRANSITIONS=210} [2025-03-17 10:42:25,641 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -40 predicate places. [2025-03-17 10:42:25,642 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 210 transitions, 480 flow [2025-03-17 10:42:25,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.66666666666666) internal successors, (662), 3 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:25,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:25,642 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] [2025-03-17 10:42:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-17 10:42:25,642 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:25,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash -130146575, now seen corresponding path program 1 times [2025-03-17 10:42:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066400232] [2025-03-17 10:42:25,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:25,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-17 10:42:25,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-17 10:42:25,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:25,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:25,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:25,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066400232] [2025-03-17 10:42:25,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066400232] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:25,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:25,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:25,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849364604] [2025-03-17 10:42:25,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:25,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:25,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:25,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:25,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:26,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-03-17 10:42:26,014 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 210 transitions, 480 flow. Second operand has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:26,014 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:26,014 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-03-17 10:42:26,014 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:30,944 INFO L124 PetriNetUnfolderBase]: 21016/65744 cut-off events. [2025-03-17 10:42:30,944 INFO L125 PetriNetUnfolderBase]: For 3106/3248 co-relation queries the response was YES. [2025-03-17 10:42:31,171 INFO L83 FinitePrefix]: Finished finitePrefix Result has 104271 conditions, 65744 events. 21016/65744 cut-off events. For 3106/3248 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 823264 event pairs, 9754 based on Foata normal form. 0/59499 useless extension candidates. Maximal degree in co-relation 104262. Up to 29941 conditions per place. [2025-03-17 10:42:31,303 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 64 selfloop transitions, 5 changer transitions 3/225 dead transitions. [2025-03-17 10:42:31,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 221 places, 225 transitions, 650 flow [2025-03-17 10:42:31,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:31,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:31,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1235 transitions. [2025-03-17 10:42:31,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7595325953259533 [2025-03-17 10:42:31,306 INFO L175 Difference]: Start difference. First operand has 218 places, 210 transitions, 480 flow. Second operand 6 states and 1235 transitions. [2025-03-17 10:42:31,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 221 places, 225 transitions, 650 flow [2025-03-17 10:42:31,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 220 places, 225 transitions, 648 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:31,312 INFO L231 Difference]: Finished difference. Result has 220 places, 206 transitions, 480 flow [2025-03-17 10:42:31,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=215, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=480, PETRI_PLACES=220, PETRI_TRANSITIONS=206} [2025-03-17 10:42:31,313 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -38 predicate places. [2025-03-17 10:42:31,313 INFO L471 AbstractCegarLoop]: Abstraction has has 220 places, 206 transitions, 480 flow [2025-03-17 10:42:31,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.66666666666666) internal successors, (1174), 6 states have internal predecessors, (1174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:31,313 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:31,314 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:31,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-17 10:42:31,314 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:31,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:31,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2006717154, now seen corresponding path program 1 times [2025-03-17 10:42:31,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:31,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050924238] [2025-03-17 10:42:31,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:31,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:31,322 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-17 10:42:31,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-17 10:42:31,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:31,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:31,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:31,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:31,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050924238] [2025-03-17 10:42:31,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050924238] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:31,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:31,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 10:42:31,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223838663] [2025-03-17 10:42:31,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:31,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 10:42:31,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:31,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 10:42:31,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 10:42:31,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 271 [2025-03-17 10:42:31,453 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 220 places, 206 transitions, 480 flow. Second operand has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:31,453 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:31,453 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 271 [2025-03-17 10:42:31,453 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:33,742 INFO L124 PetriNetUnfolderBase]: 7222/26805 cut-off events. [2025-03-17 10:42:33,743 INFO L125 PetriNetUnfolderBase]: For 3680/8506 co-relation queries the response was YES. [2025-03-17 10:42:33,845 INFO L83 FinitePrefix]: Finished finitePrefix Result has 40888 conditions, 26805 events. 7222/26805 cut-off events. For 3680/8506 co-relation queries the response was YES. Maximal size of possible extension queue 664. Compared 316038 event pairs, 5043 based on Foata normal form. 137/23508 useless extension candidates. Maximal degree in co-relation 40879. Up to 5892 conditions per place. [2025-03-17 10:42:33,907 INFO L140 encePairwiseOnDemand]: 258/271 looper letters, 77 selfloop transitions, 11 changer transitions 0/259 dead transitions. [2025-03-17 10:42:33,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 220 places, 259 transitions, 826 flow [2025-03-17 10:42:33,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 10:42:33,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-17 10:42:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 946 transitions. [2025-03-17 10:42:33,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8726937269372693 [2025-03-17 10:42:33,909 INFO L175 Difference]: Start difference. First operand has 220 places, 206 transitions, 480 flow. Second operand 4 states and 946 transitions. [2025-03-17 10:42:33,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 220 places, 259 transitions, 826 flow [2025-03-17 10:42:33,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 259 transitions, 816 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:42:33,917 INFO L231 Difference]: Finished difference. Result has 217 places, 215 transitions, 552 flow [2025-03-17 10:42:33,917 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=470, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=552, PETRI_PLACES=217, PETRI_TRANSITIONS=215} [2025-03-17 10:42:33,917 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -41 predicate places. [2025-03-17 10:42:33,918 INFO L471 AbstractCegarLoop]: Abstraction has has 217 places, 215 transitions, 552 flow [2025-03-17 10:42:33,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 215.5) internal successors, (862), 4 states have internal predecessors, (862), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:33,918 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:33,918 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-17 10:42:33,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-17 10:42:33,918 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:33,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:33,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1731877248, now seen corresponding path program 1 times [2025-03-17 10:42:33,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:33,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469811708] [2025-03-17 10:42:33,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:33,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:33,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-17 10:42:33,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-17 10:42:33,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:33,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:34,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:34,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469811708] [2025-03-17 10:42:34,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469811708] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:34,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:34,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 10:42:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335980811] [2025-03-17 10:42:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:34,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:34,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:34,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:34,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:34,208 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-03-17 10:42:34,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 215 transitions, 552 flow. Second operand has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:34,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:34,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-03-17 10:42:34,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:36,649 INFO L124 PetriNetUnfolderBase]: 7028/27245 cut-off events. [2025-03-17 10:42:36,649 INFO L125 PetriNetUnfolderBase]: For 7164/10057 co-relation queries the response was YES. [2025-03-17 10:42:36,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44175 conditions, 27245 events. 7028/27245 cut-off events. For 7164/10057 co-relation queries the response was YES. Maximal size of possible extension queue 630. Compared 324189 event pairs, 4588 based on Foata normal form. 3/23823 useless extension candidates. Maximal degree in co-relation 44164. Up to 5944 conditions per place. [2025-03-17 10:42:36,813 INFO L140 encePairwiseOnDemand]: 257/271 looper letters, 88 selfloop transitions, 14 changer transitions 0/271 dead transitions. [2025-03-17 10:42:36,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 271 transitions, 948 flow [2025-03-17 10:42:36,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 10:42:36,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-03-17 10:42:36,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1587 transitions. [2025-03-17 10:42:36,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8365840801265155 [2025-03-17 10:42:36,815 INFO L175 Difference]: Start difference. First operand has 217 places, 215 transitions, 552 flow. Second operand 7 states and 1587 transitions. [2025-03-17 10:42:36,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 271 transitions, 948 flow [2025-03-17 10:42:36,821 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 271 transitions, 946 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 10:42:36,823 INFO L231 Difference]: Finished difference. Result has 225 places, 218 transitions, 607 flow [2025-03-17 10:42:36,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=550, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=607, PETRI_PLACES=225, PETRI_TRANSITIONS=218} [2025-03-17 10:42:36,824 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2025-03-17 10:42:36,824 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 218 transitions, 607 flow [2025-03-17 10:42:36,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 213.66666666666666) internal successors, (1282), 6 states have internal predecessors, (1282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:36,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:36,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:36,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-17 10:42:36,825 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:36,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:36,825 INFO L85 PathProgramCache]: Analyzing trace with hash -1791053505, now seen corresponding path program 1 times [2025-03-17 10:42:36,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:36,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240430030] [2025-03-17 10:42:36,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:36,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:36,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-03-17 10:42:36,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-03-17 10:42:36,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:36,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:37,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-03-17 10:42:37,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:37,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240430030] [2025-03-17 10:42:37,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240430030] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:37,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:37,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:37,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137435275] [2025-03-17 10:42:37,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:37,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 10:42:37,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:37,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 10:42:37,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 10:42:37,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 271 [2025-03-17 10:42:37,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 218 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:37,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:37,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 271 [2025-03-17 10:42:37,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:41,730 INFO L124 PetriNetUnfolderBase]: 21085/50115 cut-off events. [2025-03-17 10:42:41,730 INFO L125 PetriNetUnfolderBase]: For 8511/8515 co-relation queries the response was YES. [2025-03-17 10:42:41,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87702 conditions, 50115 events. 21085/50115 cut-off events. For 8511/8515 co-relation queries the response was YES. Maximal size of possible extension queue 856. Compared 518597 event pairs, 9342 based on Foata normal form. 0/47064 useless extension candidates. Maximal degree in co-relation 87688. Up to 25899 conditions per place. [2025-03-17 10:42:42,093 INFO L140 encePairwiseOnDemand]: 264/271 looper letters, 90 selfloop transitions, 6 changer transitions 0/249 dead transitions. [2025-03-17 10:42:42,093 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 229 places, 249 transitions, 861 flow [2025-03-17 10:42:42,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 10:42:42,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 10:42:42,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1251 transitions. [2025-03-17 10:42:42,098 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7693726937269373 [2025-03-17 10:42:42,098 INFO L175 Difference]: Start difference. First operand has 225 places, 218 transitions, 607 flow. Second operand 6 states and 1251 transitions. [2025-03-17 10:42:42,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 229 places, 249 transitions, 861 flow [2025-03-17 10:42:42,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 249 transitions, 837 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-03-17 10:42:42,110 INFO L231 Difference]: Finished difference. Result has 226 places, 217 transitions, 593 flow [2025-03-17 10:42:42,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=593, PETRI_PLACES=226, PETRI_TRANSITIONS=217} [2025-03-17 10:42:42,111 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -32 predicate places. [2025-03-17 10:42:42,111 INFO L471 AbstractCegarLoop]: Abstraction has has 226 places, 217 transitions, 593 flow [2025-03-17 10:42:42,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 195.83333333333334) internal successors, (1175), 6 states have internal predecessors, (1175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:42,111 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:42,111 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:42,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-17 10:42:42,111 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:42,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:42,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1275178679, now seen corresponding path program 1 times [2025-03-17 10:42:42,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:42,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632622144] [2025-03-17 10:42:42,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:42,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-17 10:42:42,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-17 10:42:42,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:42,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:42,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:42,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632622144] [2025-03-17 10:42:42,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632622144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:42,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:42,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:42,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63184586] [2025-03-17 10:42:42,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:42,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:42:42,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:42,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:42:42,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:42:42,265 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-03-17 10:42:42,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 217 transitions, 593 flow. Second operand has 5 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:42,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:42,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-03-17 10:42:42,267 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:45,843 INFO L124 PetriNetUnfolderBase]: 9470/39937 cut-off events. [2025-03-17 10:42:45,844 INFO L125 PetriNetUnfolderBase]: For 9275/10579 co-relation queries the response was YES. [2025-03-17 10:42:46,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63375 conditions, 39937 events. 9470/39937 cut-off events. For 9275/10579 co-relation queries the response was YES. Maximal size of possible extension queue 756. Compared 513999 event pairs, 3653 based on Foata normal form. 13/35253 useless extension candidates. Maximal degree in co-relation 63361. Up to 6455 conditions per place. [2025-03-17 10:42:46,147 INFO L140 encePairwiseOnDemand]: 259/271 looper letters, 86 selfloop transitions, 24 changer transitions 0/280 dead transitions. [2025-03-17 10:42:46,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 230 places, 280 transitions, 1037 flow [2025-03-17 10:42:46,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:42:46,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 10:42:46,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1161 transitions. [2025-03-17 10:42:46,150 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8568265682656827 [2025-03-17 10:42:46,150 INFO L175 Difference]: Start difference. First operand has 226 places, 217 transitions, 593 flow. Second operand 5 states and 1161 transitions. [2025-03-17 10:42:46,150 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 230 places, 280 transitions, 1037 flow [2025-03-17 10:42:46,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 280 transitions, 1025 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 10:42:46,166 INFO L231 Difference]: Finished difference. Result has 229 places, 231 transitions, 767 flow [2025-03-17 10:42:46,167 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=767, PETRI_PLACES=229, PETRI_TRANSITIONS=231} [2025-03-17 10:42:46,168 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -29 predicate places. [2025-03-17 10:42:46,168 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 231 transitions, 767 flow [2025-03-17 10:42:46,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 213.8) internal successors, (1069), 5 states have internal predecessors, (1069), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:46,168 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:46,168 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] [2025-03-17 10:42:46,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-17 10:42:46,169 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:46,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:46,169 INFO L85 PathProgramCache]: Analyzing trace with hash -252843807, now seen corresponding path program 1 times [2025-03-17 10:42:46,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:46,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439271194] [2025-03-17 10:42:46,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:46,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:46,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-17 10:42:46,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-17 10:42:46,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:46,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:46,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:46,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439271194] [2025-03-17 10:42:46,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [439271194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:46,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:46,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 10:42:46,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399670197] [2025-03-17 10:42:46,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:46,244 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 10:42:46,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:46,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 10:42:46,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 10:42:46,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 271 [2025-03-17 10:42:46,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 231 transitions, 767 flow. Second operand has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:46,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:46,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 271 [2025-03-17 10:42:46,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 10:42:50,756 INFO L124 PetriNetUnfolderBase]: 11390/44658 cut-off events. [2025-03-17 10:42:50,756 INFO L125 PetriNetUnfolderBase]: For 22277/23609 co-relation queries the response was YES. [2025-03-17 10:42:50,958 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75801 conditions, 44658 events. 11390/44658 cut-off events. For 22277/23609 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 573629 event pairs, 4202 based on Foata normal form. 0/40191 useless extension candidates. Maximal degree in co-relation 75784. Up to 8244 conditions per place. [2025-03-17 10:42:51,038 INFO L140 encePairwiseOnDemand]: 259/271 looper letters, 76 selfloop transitions, 26 changer transitions 4/278 dead transitions. [2025-03-17 10:42:51,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 278 transitions, 1147 flow [2025-03-17 10:42:51,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 10:42:51,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-17 10:42:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1151 transitions. [2025-03-17 10:42:51,040 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8494464944649447 [2025-03-17 10:42:51,040 INFO L175 Difference]: Start difference. First operand has 229 places, 231 transitions, 767 flow. Second operand 5 states and 1151 transitions. [2025-03-17 10:42:51,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 278 transitions, 1147 flow [2025-03-17 10:42:51,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 278 transitions, 1141 flow, removed 3 selfloop flow, removed 0 redundant places. [2025-03-17 10:42:51,062 INFO L231 Difference]: Finished difference. Result has 235 places, 235 transitions, 870 flow [2025-03-17 10:42:51,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=271, PETRI_DIFFERENCE_MINUEND_FLOW=761, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=231, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=870, PETRI_PLACES=235, PETRI_TRANSITIONS=235} [2025-03-17 10:42:51,063 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -23 predicate places. [2025-03-17 10:42:51,063 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 235 transitions, 870 flow [2025-03-17 10:42:51,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 214.0) internal successors, (1070), 5 states have internal predecessors, (1070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:51,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:51,064 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:51,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-17 10:42:51,064 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 35 more)] === [2025-03-17 10:42:51,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:51,065 INFO L85 PathProgramCache]: Analyzing trace with hash 997254706, now seen corresponding path program 1 times [2025-03-17 10:42:51,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:51,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546672079] [2025-03-17 10:42:51,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:51,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:51,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:42:51,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:42:51,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:51,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:42:51,081 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-17 10:42:51,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-03-17 10:42:51,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-03-17 10:42:51,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:51,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-17 10:42:51,103 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-17 10:42:51,103 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (36 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (35 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (34 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (33 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (32 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (31 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (30 of 38 remaining) [2025-03-17 10:42:51,104 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (29 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (28 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (27 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (26 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (25 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (24 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (23 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (22 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (21 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (20 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (19 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (18 of 38 remaining) [2025-03-17 10:42:51,105 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (17 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (16 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (13 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (11 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (9 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (8 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr1ASSERT_VIOLATIONDATA_RACE (7 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location setThreadErr0ASSERT_VIOLATIONDATA_RACE (6 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (4 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (3 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 38 remaining) [2025-03-17 10:42:51,106 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr1ASSERT_VIOLATIONDATA_RACE (1 of 38 remaining) [2025-03-17 10:42:51,107 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location checkThreadErr0ASSERT_VIOLATIONDATA_RACE (0 of 38 remaining) [2025-03-17 10:42:51,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-17 10:42:51,107 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 10:42:51,107 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-17 10:42:51,107 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-17 10:42:51,130 INFO L143 ThreadInstanceAdder]: Constructed 12 joinOtherThreadTransitions. [2025-03-17 10:42:51,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 286 places, 300 transitions, 672 flow [2025-03-17 10:42:51,471 INFO L124 PetriNetUnfolderBase]: 641/5372 cut-off events. [2025-03-17 10:42:51,471 INFO L125 PetriNetUnfolderBase]: For 419/419 co-relation queries the response was YES. [2025-03-17 10:42:51,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5808 conditions, 5372 events. 641/5372 cut-off events. For 419/419 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 42183 event pairs, 64 based on Foata normal form. 0/4431 useless extension candidates. Maximal degree in co-relation 3077. Up to 192 conditions per place. [2025-03-17 10:42:51,509 INFO L82 GeneralOperation]: Start removeDead. Operand has 286 places, 300 transitions, 672 flow [2025-03-17 10:42:51,534 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 286 places, 300 transitions, 672 flow [2025-03-17 10:42:51,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 10:42:51,536 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;@48dbc49c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 10:42:51,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 43 error locations. [2025-03-17 10:42:51,537 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 10:42:51,537 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2025-03-17 10:42:51,537 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 10:42:51,537 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 10:42:51,537 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] [2025-03-17 10:42:51,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [setThreadErr1ASSERT_VIOLATIONDATA_RACE, setThreadErr0ASSERT_VIOLATIONDATA_RACE, checkThreadErr2ASSERT_VIOLATIONDATA_RACE (and 40 more)] === [2025-03-17 10:42:51,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 10:42:51,537 INFO L85 PathProgramCache]: Analyzing trace with hash 939635963, now seen corresponding path program 1 times [2025-03-17 10:42:51,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 10:42:51,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217996388] [2025-03-17 10:42:51,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 10:42:51,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 10:42:51,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-17 10:42:51,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-17 10:42:51,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 10:42:51,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 10:42:51,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 10:42:51,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 10:42:51,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217996388] [2025-03-17 10:42:51,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217996388] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 10:42:51,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 10:42:51,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 10:42:51,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476326731] [2025-03-17 10:42:51,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 10:42:51,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 10:42:51,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 10:42:51,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 10:42:51,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 10:42:51,561 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 300 [2025-03-17 10:42:51,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 286 places, 300 transitions, 672 flow. Second operand has 3 states, 3 states have (on average 229.66666666666666) internal successors, (689), 3 states have internal predecessors, (689), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 10:42:51,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 10:42:51,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 300 [2025-03-17 10:42:51,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand