./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:27:08,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:27:08,661 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:27:08,667 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:27:08,667 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:27:08,683 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:27:08,684 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:27:08,684 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:27:08,684 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:27:08,684 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:27:08,684 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:27:08,685 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:08,685 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:08,685 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:27:08,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:27:08,686 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a178b12ba1b75e8e390c539a1b1599b5e56cbe73098e0c8e7ca0eeb62a619e80 [2025-01-09 21:27:08,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:27:08,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:27:08,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:27:08,899 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:27:08,899 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:27:08,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-01-09 21:27:09,974 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb15da897/3084f821cbab4b53a178cc439fb6b595/FLAGec74d6c6d [2025-01-09 21:27:10,222 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:27:10,225 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_19-callback_racing.i [2025-01-09 21:27:10,240 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb15da897/3084f821cbab4b53a178cc439fb6b595/FLAGec74d6c6d [2025-01-09 21:27:10,535 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/eb15da897/3084f821cbab4b53a178cc439fb6b595 [2025-01-09 21:27:10,537 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:27:10,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:27:10,539 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:10,539 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:27:10,543 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:27:10,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@413dff3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10, skipping insertion in model container [2025-01-09 21:27:10,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,576 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:27:10,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:10,823 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:27:10,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:27:10,903 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:27:10,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10 WrapperNode [2025-01-09 21:27:10,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:27:10,906 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:10,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:27:10,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:27:10,910 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,921 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,940 INFO L138 Inliner]: procedures = 174, calls = 45, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 161 [2025-01-09 21:27:10,942 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:27:10,943 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:27:10,943 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:27:10,943 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:27:10,948 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,948 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,956 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,956 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,965 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,965 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,967 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,970 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,971 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:27:10,976 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:27:10,976 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:27:10,977 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:27:10,977 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (1/1) ... [2025-01-09 21:27:10,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:27:11,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:27:11,021 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:27:11,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:27:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:27:11,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:27:11,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:27:11,041 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:27:11,140 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:27:11,141 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:27:11,359 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:27:11,360 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:27:11,384 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:27:11,385 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 21:27:11,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:11 BoogieIcfgContainer [2025-01-09 21:27:11,385 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:27:11,391 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:27:11,391 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:27:11,394 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:27:11,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:27:10" (1/3) ... [2025-01-09 21:27:11,395 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@851340a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:11, skipping insertion in model container [2025-01-09 21:27:11,395 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:27:10" (2/3) ... [2025-01-09 21:27:11,396 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@851340a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:27:11, skipping insertion in model container [2025-01-09 21:27:11,396 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:27:11" (3/3) ... [2025-01-09 21:27:11,397 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_19-callback_racing.i [2025-01-09 21:27:11,408 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:27:11,409 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_19-callback_racing.i that has 2 procedures, 165 locations, 1 initial locations, 7 loop locations, and 7 error locations. [2025-01-09 21:27:11,409 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:27:11,463 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:27:11,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 168 places, 178 transitions, 363 flow [2025-01-09 21:27:11,585 INFO L124 PetriNetUnfolderBase]: 21/285 cut-off events. [2025-01-09 21:27:11,588 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:27:11,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 290 conditions, 285 events. 21/285 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 960 event pairs, 0 based on Foata normal form. 0/248 useless extension candidates. Maximal degree in co-relation 140. Up to 6 conditions per place. [2025-01-09 21:27:11,598 INFO L82 GeneralOperation]: Start removeDead. Operand has 168 places, 178 transitions, 363 flow [2025-01-09 21:27:11,602 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 168 places, 178 transitions, 363 flow [2025-01-09 21:27:11,607 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:11,615 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;@6b712a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:11,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-01-09 21:27:11,625 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:11,626 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-01-09 21:27:11,626 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:11,626 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:11,627 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:11,627 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -2026767246, now seen corresponding path program 1 times [2025-01-09 21:27:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744763552] [2025-01-09 21:27:11,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:11,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:11,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:27:11,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:27:11,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:11,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:12,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:12,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:12,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744763552] [2025-01-09 21:27:12,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744763552] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:12,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:12,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:12,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244268714] [2025-01-09 21:27:12,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:12,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:12,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:12,370 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:12,370 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:12,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 178 [2025-01-09 21:27:12,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 178 transitions, 363 flow. Second operand has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:12,521 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:12,521 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 178 [2025-01-09 21:27:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:12,709 INFO L124 PetriNetUnfolderBase]: 93/781 cut-off events. [2025-01-09 21:27:12,710 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:27:12,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 995 conditions, 781 events. 93/781 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 4328 event pairs, 33 based on Foata normal form. 83/804 useless extension candidates. Maximal degree in co-relation 826. Up to 154 conditions per place. [2025-01-09 21:27:12,716 INFO L140 encePairwiseOnDemand]: 162/178 looper letters, 40 selfloop transitions, 5 changer transitions 0/181 dead transitions. [2025-01-09 21:27:12,716 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 181 transitions, 459 flow [2025-01-09 21:27:12,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:12,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:12,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 894 transitions. [2025-01-09 21:27:12,730 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8370786516853933 [2025-01-09 21:27:12,731 INFO L175 Difference]: Start difference. First operand has 168 places, 178 transitions, 363 flow. Second operand 6 states and 894 transitions. [2025-01-09 21:27:12,732 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 181 transitions, 459 flow [2025-01-09 21:27:12,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 181 transitions, 459 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:12,740 INFO L231 Difference]: Finished difference. Result has 170 places, 165 transitions, 347 flow [2025-01-09 21:27:12,741 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=347, PETRI_PLACES=170, PETRI_TRANSITIONS=165} [2025-01-09 21:27:12,743 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 2 predicate places. [2025-01-09 21:27:12,744 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 165 transitions, 347 flow [2025-01-09 21:27:12,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.5) internal successors, (831), 6 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:12,745 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:12,745 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-01-09 21:27:12,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:27:12,746 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:12,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1909611633, now seen corresponding path program 1 times [2025-01-09 21:27:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:12,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585076146] [2025-01-09 21:27:12,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:12,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:12,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:12,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:12,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:12,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:12,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:12,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585076146] [2025-01-09 21:27:12,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585076146] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:12,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:12,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:12,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842716744] [2025-01-09 21:27:12,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:12,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:12,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:12,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:12,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:12,849 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 178 [2025-01-09 21:27:12,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 165 transitions, 347 flow. Second operand has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:12,851 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:12,851 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 178 [2025-01-09 21:27:12,851 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:12,919 INFO L124 PetriNetUnfolderBase]: 50/624 cut-off events. [2025-01-09 21:27:12,919 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:27:12,921 INFO L83 FinitePrefix]: Finished finitePrefix Result has 751 conditions, 624 events. 50/624 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3060 event pairs, 18 based on Foata normal form. 1/578 useless extension candidates. Maximal degree in co-relation 669. Up to 94 conditions per place. [2025-01-09 21:27:12,923 INFO L140 encePairwiseOnDemand]: 175/178 looper letters, 20 selfloop transitions, 2 changer transitions 0/169 dead transitions. [2025-01-09 21:27:12,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 169 transitions, 399 flow [2025-01-09 21:27:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:12,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:12,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2025-01-09 21:27:12,926 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8801498127340824 [2025-01-09 21:27:12,926 INFO L175 Difference]: Start difference. First operand has 170 places, 165 transitions, 347 flow. Second operand 3 states and 470 transitions. [2025-01-09 21:27:12,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 169 transitions, 399 flow [2025-01-09 21:27:12,929 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 169 transitions, 389 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:12,932 INFO L231 Difference]: Finished difference. Result has 168 places, 165 transitions, 345 flow [2025-01-09 21:27:12,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=165, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=165, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=163, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=345, PETRI_PLACES=168, PETRI_TRANSITIONS=165} [2025-01-09 21:27:12,932 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2025-01-09 21:27:12,932 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 165 transitions, 345 flow [2025-01-09 21:27:12,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 150.33333333333334) internal successors, (451), 3 states have internal predecessors, (451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:12,933 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:12,933 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-01-09 21:27:12,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:27:12,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:12,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:12,934 INFO L85 PathProgramCache]: Analyzing trace with hash -123453927, now seen corresponding path program 1 times [2025-01-09 21:27:12,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:12,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802911110] [2025-01-09 21:27:12,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:12,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:12,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:12,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:12,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:12,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:12,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:12,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:12,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802911110] [2025-01-09 21:27:12,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802911110] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:12,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:12,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:12,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166577675] [2025-01-09 21:27:12,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:12,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:12,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:12,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:12,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:13,010 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 144 out of 178 [2025-01-09 21:27:13,010 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 165 transitions, 345 flow. Second operand has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:13,010 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:13,010 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 144 of 178 [2025-01-09 21:27:13,010 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:13,135 INFO L124 PetriNetUnfolderBase]: 110/871 cut-off events. [2025-01-09 21:27:13,135 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2025-01-09 21:27:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1125 conditions, 871 events. 110/871 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4484 event pairs, 41 based on Foata normal form. 1/799 useless extension candidates. Maximal degree in co-relation 1069. Up to 133 conditions per place. [2025-01-09 21:27:13,139 INFO L140 encePairwiseOnDemand]: 169/178 looper letters, 30 selfloop transitions, 6 changer transitions 0/178 dead transitions. [2025-01-09 21:27:13,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 178 transitions, 446 flow [2025-01-09 21:27:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:13,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:13,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 471 transitions. [2025-01-09 21:27:13,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8820224719101124 [2025-01-09 21:27:13,141 INFO L175 Difference]: Start difference. First operand has 168 places, 165 transitions, 345 flow. Second operand 3 states and 471 transitions. [2025-01-09 21:27:13,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 178 transitions, 446 flow [2025-01-09 21:27:13,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 178 transitions, 442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:13,143 INFO L231 Difference]: Finished difference. Result has 168 places, 167 transitions, 379 flow [2025-01-09 21:27:13,145 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=178, PETRI_DIFFERENCE_MINUEND_FLOW=337, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=157, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=379, PETRI_PLACES=168, PETRI_TRANSITIONS=167} [2025-01-09 21:27:13,145 INFO L279 CegarLoopForPetriNet]: 168 programPoint places, 0 predicate places. [2025-01-09 21:27:13,146 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 167 transitions, 379 flow [2025-01-09 21:27:13,146 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.66666666666666) internal successors, (437), 3 states have internal predecessors, (437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:13,146 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:13,146 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:13,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:27:13,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-01-09 21:27:13,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:13,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1537157407, now seen corresponding path program 1 times [2025-01-09 21:27:13,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:13,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210374526] [2025-01-09 21:27:13,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:13,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:13,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:27:13,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:27:13,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:13,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:13,173 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:27:13,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-01-09 21:27:13,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-01-09 21:27:13,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:13,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:13,209 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:13,210 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:13,210 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-01-09 21:27:13,213 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-01-09 21:27:13,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:27:13,216 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-01-09 21:27:13,217 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:13,217 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:27:13,241 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:27:13,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 210 transitions, 436 flow [2025-01-09 21:27:13,276 INFO L124 PetriNetUnfolderBase]: 35/451 cut-off events. [2025-01-09 21:27:13,276 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:27:13,277 INFO L83 FinitePrefix]: Finished finitePrefix Result has 463 conditions, 451 events. 35/451 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1826 event pairs, 0 based on Foata normal form. 0/391 useless extension candidates. Maximal degree in co-relation 287. Up to 9 conditions per place. [2025-01-09 21:27:13,278 INFO L82 GeneralOperation]: Start removeDead. Operand has 197 places, 210 transitions, 436 flow [2025-01-09 21:27:13,280 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 210 transitions, 436 flow [2025-01-09 21:27:13,282 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:13,282 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;@6b712a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:13,283 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-01-09 21:27:13,286 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:13,286 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-01-09 21:27:13,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:13,286 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:13,286 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:13,286 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:13,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:13,287 INFO L85 PathProgramCache]: Analyzing trace with hash -872676430, now seen corresponding path program 1 times [2025-01-09 21:27:13,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:13,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495943342] [2025-01-09 21:27:13,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:13,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:13,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:27:13,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:27:13,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:13,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:13,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:13,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:13,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495943342] [2025-01-09 21:27:13,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495943342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:13,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:13,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:13,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208429135] [2025-01-09 21:27:13,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:13,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:13,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:13,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:13,529 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:13,619 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 210 [2025-01-09 21:27:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 210 transitions, 436 flow. Second operand has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:13,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:13,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 210 [2025-01-09 21:27:13,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:14,072 INFO L124 PetriNetUnfolderBase]: 1001/4600 cut-off events. [2025-01-09 21:27:14,072 INFO L125 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-01-09 21:27:14,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6259 conditions, 4600 events. 1001/4600 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 43040 event pairs, 108 based on Foata normal form. 817/5084 useless extension candidates. Maximal degree in co-relation 1068. Up to 1202 conditions per place. [2025-01-09 21:27:14,088 INFO L140 encePairwiseOnDemand]: 190/210 looper letters, 62 selfloop transitions, 5 changer transitions 0/223 dead transitions. [2025-01-09 21:27:14,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 197 places, 223 transitions, 596 flow [2025-01-09 21:27:14,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:14,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:14,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1062 transitions. [2025-01-09 21:27:14,091 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8428571428571429 [2025-01-09 21:27:14,092 INFO L175 Difference]: Start difference. First operand has 197 places, 210 transitions, 436 flow. Second operand 6 states and 1062 transitions. [2025-01-09 21:27:14,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 197 places, 223 transitions, 596 flow [2025-01-09 21:27:14,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 223 transitions, 596 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:14,097 INFO L231 Difference]: Finished difference. Result has 197 places, 191 transitions, 408 flow [2025-01-09 21:27:14,098 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=186, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=197, PETRI_TRANSITIONS=191} [2025-01-09 21:27:14,099 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, 0 predicate places. [2025-01-09 21:27:14,099 INFO L471 AbstractCegarLoop]: Abstraction has has 197 places, 191 transitions, 408 flow [2025-01-09 21:27:14,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 159.5) internal successors, (957), 6 states have internal predecessors, (957), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:14,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:14,100 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-01-09 21:27:14,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:27:14,101 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:14,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:14,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1252011185, now seen corresponding path program 1 times [2025-01-09 21:27:14,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:14,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769742519] [2025-01-09 21:27:14,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:14,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:14,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:14,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:14,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:14,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:14,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:14,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:14,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769742519] [2025-01-09 21:27:14,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769742519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:14,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:14,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:14,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295733922] [2025-01-09 21:27:14,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:14,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:14,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:14,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:14,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:14,160 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 210 [2025-01-09 21:27:14,161 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 197 places, 191 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:14,161 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:14,161 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 210 [2025-01-09 21:27:14,161 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:14,383 INFO L124 PetriNetUnfolderBase]: 498/2952 cut-off events. [2025-01-09 21:27:14,384 INFO L125 PetriNetUnfolderBase]: For 87/87 co-relation queries the response was YES. [2025-01-09 21:27:14,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3882 conditions, 2952 events. 498/2952 cut-off events. For 87/87 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 25721 event pairs, 208 based on Foata normal form. 1/2686 useless extension candidates. Maximal degree in co-relation 769. Up to 817 conditions per place. [2025-01-09 21:27:14,394 INFO L140 encePairwiseOnDemand]: 207/210 looper letters, 27 selfloop transitions, 2 changer transitions 0/196 dead transitions. [2025-01-09 21:27:14,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 196 transitions, 478 flow [2025-01-09 21:27:14,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 540 transitions. [2025-01-09 21:27:14,398 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8571428571428571 [2025-01-09 21:27:14,398 INFO L175 Difference]: Start difference. First operand has 197 places, 191 transitions, 408 flow. Second operand 3 states and 540 transitions. [2025-01-09 21:27:14,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 196 transitions, 478 flow [2025-01-09 21:27:14,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 196 transitions, 466 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:14,401 INFO L231 Difference]: Finished difference. Result has 195 places, 192 transitions, 410 flow [2025-01-09 21:27:14,402 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=398, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=191, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=189, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=195, PETRI_TRANSITIONS=192} [2025-01-09 21:27:14,402 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -2 predicate places. [2025-01-09 21:27:14,403 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 192 transitions, 410 flow [2025-01-09 21:27:14,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 171.33333333333334) internal successors, (514), 3 states have internal predecessors, (514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:14,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:14,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:14,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:27:14,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:14,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:14,404 INFO L85 PathProgramCache]: Analyzing trace with hash -36351877, now seen corresponding path program 1 times [2025-01-09 21:27:14,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:14,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695926870] [2025-01-09 21:27:14,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:14,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:14,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:14,417 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:14,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:14,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:14,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:14,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:14,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695926870] [2025-01-09 21:27:14,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695926870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:14,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:14,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:14,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740745128] [2025-01-09 21:27:14,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:14,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:14,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:14,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:14,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:14,459 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 210 [2025-01-09 21:27:14,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 192 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:14,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:14,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 210 [2025-01-09 21:27:14,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:15,051 INFO L124 PetriNetUnfolderBase]: 2100/8566 cut-off events. [2025-01-09 21:27:15,052 INFO L125 PetriNetUnfolderBase]: For 280/415 co-relation queries the response was YES. [2025-01-09 21:27:15,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12071 conditions, 8566 events. 2100/8566 cut-off events. For 280/415 co-relation queries the response was YES. Maximal size of possible extension queue 210. Compared 85164 event pairs, 755 based on Foata normal form. 8/7776 useless extension candidates. Maximal degree in co-relation 12014. Up to 2123 conditions per place. [2025-01-09 21:27:15,141 INFO L140 encePairwiseOnDemand]: 198/210 looper letters, 45 selfloop transitions, 8 changer transitions 0/213 dead transitions. [2025-01-09 21:27:15,141 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 213 transitions, 569 flow [2025-01-09 21:27:15,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:15,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:15,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 543 transitions. [2025-01-09 21:27:15,143 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.861904761904762 [2025-01-09 21:27:15,143 INFO L175 Difference]: Start difference. First operand has 195 places, 192 transitions, 410 flow. Second operand 3 states and 543 transitions. [2025-01-09 21:27:15,143 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 213 transitions, 569 flow [2025-01-09 21:27:15,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 213 transitions, 567 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:15,146 INFO L231 Difference]: Finished difference. Result has 196 places, 196 transitions, 464 flow [2025-01-09 21:27:15,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=464, PETRI_PLACES=196, PETRI_TRANSITIONS=196} [2025-01-09 21:27:15,146 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, -1 predicate places. [2025-01-09 21:27:15,146 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 196 transitions, 464 flow [2025-01-09 21:27:15,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.66666666666666) internal successors, (491), 3 states have internal predecessors, (491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:15,147 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:15,147 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:15,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:27:15,147 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:15,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:15,147 INFO L85 PathProgramCache]: Analyzing trace with hash -900466041, now seen corresponding path program 1 times [2025-01-09 21:27:15,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:15,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245548514] [2025-01-09 21:27:15,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:15,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:15,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:27:15,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:27:15,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:15,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:15,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:27:15,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:15,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245548514] [2025-01-09 21:27:15,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245548514] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:15,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:15,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:15,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811647413] [2025-01-09 21:27:15,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:15,227 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:15,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:15,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:15,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:15,262 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 210 [2025-01-09 21:27:15,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 196 transitions, 464 flow. Second operand has 5 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:15,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:15,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 210 [2025-01-09 21:27:15,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:15,922 INFO L124 PetriNetUnfolderBase]: 1393/8581 cut-off events. [2025-01-09 21:27:15,922 INFO L125 PetriNetUnfolderBase]: For 381/393 co-relation queries the response was YES. [2025-01-09 21:27:15,940 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11401 conditions, 8581 events. 1393/8581 cut-off events. For 381/393 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 89576 event pairs, 415 based on Foata normal form. 5/7879 useless extension candidates. Maximal degree in co-relation 5199. Up to 1757 conditions per place. [2025-01-09 21:27:15,957 INFO L140 encePairwiseOnDemand]: 205/210 looper letters, 44 selfloop transitions, 5 changer transitions 0/218 dead transitions. [2025-01-09 21:27:15,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 218 transitions, 606 flow [2025-01-09 21:27:15,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:15,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1058 transitions. [2025-01-09 21:27:15,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8396825396825397 [2025-01-09 21:27:15,960 INFO L175 Difference]: Start difference. First operand has 196 places, 196 transitions, 464 flow. Second operand 6 states and 1058 transitions. [2025-01-09 21:27:15,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 218 transitions, 606 flow [2025-01-09 21:27:15,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 218 transitions, 590 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:15,967 INFO L231 Difference]: Finished difference. Result has 202 places, 198 transitions, 474 flow [2025-01-09 21:27:15,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=210, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=474, PETRI_PLACES=202, PETRI_TRANSITIONS=198} [2025-01-09 21:27:15,968 INFO L279 CegarLoopForPetriNet]: 197 programPoint places, 5 predicate places. [2025-01-09 21:27:15,968 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 198 transitions, 474 flow [2025-01-09 21:27:15,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 169.6) internal successors, (848), 5 states have internal predecessors, (848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:15,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:15,969 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 21:27:15,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:27:15,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-01-09 21:27:15,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:15,970 INFO L85 PathProgramCache]: Analyzing trace with hash -2004521958, now seen corresponding path program 1 times [2025-01-09 21:27:15,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:15,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179825030] [2025-01-09 21:27:15,970 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:15,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:15,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:27:15,992 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:27:15,992 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:15,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:15,992 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:27:15,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-01-09 21:27:16,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-01-09 21:27:16,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:16,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:16,014 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:16,014 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-01-09 21:27:16,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-01-09 21:27:16,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:27:16,015 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2025-01-09 21:27:16,016 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:16,016 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-01-09 21:27:16,036 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-01-09 21:27:16,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 226 places, 242 transitions, 511 flow [2025-01-09 21:27:16,068 INFO L124 PetriNetUnfolderBase]: 52/660 cut-off events. [2025-01-09 21:27:16,068 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-01-09 21:27:16,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 685 conditions, 660 events. 52/660 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2918 event pairs, 1 based on Foata normal form. 0/573 useless extension candidates. Maximal degree in co-relation 459. Up to 12 conditions per place. [2025-01-09 21:27:16,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 226 places, 242 transitions, 511 flow [2025-01-09 21:27:16,072 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 226 places, 242 transitions, 511 flow [2025-01-09 21:27:16,073 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:16,073 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;@6b712a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:16,073 INFO L334 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-01-09 21:27:16,075 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:16,075 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-01-09 21:27:16,075 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:16,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:16,075 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:16,075 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:16,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:16,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1234460402, now seen corresponding path program 1 times [2025-01-09 21:27:16,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:16,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141238801] [2025-01-09 21:27:16,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:16,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:16,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:27:16,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:27:16,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:16,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:16,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:16,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:16,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141238801] [2025-01-09 21:27:16,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141238801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:16,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:16,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:16,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989268660] [2025-01-09 21:27:16,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:16,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:16,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:16,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:16,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:16,350 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 179 out of 242 [2025-01-09 21:27:16,351 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 226 places, 242 transitions, 511 flow. Second operand has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:16,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:16,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 179 of 242 [2025-01-09 21:27:16,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:18,577 INFO L124 PetriNetUnfolderBase]: 8120/26912 cut-off events. [2025-01-09 21:27:18,578 INFO L125 PetriNetUnfolderBase]: For 557/557 co-relation queries the response was YES. [2025-01-09 21:27:18,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38647 conditions, 26912 events. 8120/26912 cut-off events. For 557/557 co-relation queries the response was YES. Maximal size of possible extension queue 735. Compared 323646 event pairs, 1746 based on Foata normal form. 6291/31465 useless extension candidates. Maximal degree in co-relation 6247. Up to 8631 conditions per place. [2025-01-09 21:27:18,721 INFO L140 encePairwiseOnDemand]: 218/242 looper letters, 84 selfloop transitions, 5 changer transitions 0/265 dead transitions. [2025-01-09 21:27:18,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 265 transitions, 735 flow [2025-01-09 21:27:18,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:18,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:18,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1230 transitions. [2025-01-09 21:27:18,724 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8471074380165289 [2025-01-09 21:27:18,724 INFO L175 Difference]: Start difference. First operand has 226 places, 242 transitions, 511 flow. Second operand 6 states and 1230 transitions. [2025-01-09 21:27:18,724 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 265 transitions, 735 flow [2025-01-09 21:27:18,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 265 transitions, 735 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:27:18,727 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 471 flow [2025-01-09 21:27:18,727 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=471, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-01-09 21:27:18,728 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -2 predicate places. [2025-01-09 21:27:18,728 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 471 flow [2025-01-09 21:27:18,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 180.5) internal successors, (1083), 6 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:18,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:18,728 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-01-09 21:27:18,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:27:18,729 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:18,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:18,729 INFO L85 PathProgramCache]: Analyzing trace with hash -201170703, now seen corresponding path program 1 times [2025-01-09 21:27:18,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:18,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485267691] [2025-01-09 21:27:18,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:18,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:18,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:18,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:18,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:18,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:18,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:18,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485267691] [2025-01-09 21:27:18,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485267691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:18,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:18,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:18,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642401378] [2025-01-09 21:27:18,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:18,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:18,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:18,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:18,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:18,783 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 242 [2025-01-09 21:27:18,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 471 flow. Second operand has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:18,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:18,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 242 [2025-01-09 21:27:18,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:20,167 INFO L124 PetriNetUnfolderBase]: 3959/15302 cut-off events. [2025-01-09 21:27:20,167 INFO L125 PetriNetUnfolderBase]: For 710/736 co-relation queries the response was YES. [2025-01-09 21:27:20,199 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21526 conditions, 15302 events. 3959/15302 cut-off events. For 710/736 co-relation queries the response was YES. Maximal size of possible extension queue 411. Compared 178894 event pairs, 3171 based on Foata normal form. 1/13921 useless extension candidates. Maximal degree in co-relation 10200. Up to 5783 conditions per place. [2025-01-09 21:27:20,238 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 33 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-01-09 21:27:20,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 553 flow [2025-01-09 21:27:20,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:20,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:20,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 609 transitions. [2025-01-09 21:27:20,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388429752066116 [2025-01-09 21:27:20,240 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 471 flow. Second operand 3 states and 609 transitions. [2025-01-09 21:27:20,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 553 flow [2025-01-09 21:27:20,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 222 transitions, 541 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:27:20,243 INFO L231 Difference]: Finished difference. Result has 222 places, 218 transitions, 473 flow [2025-01-09 21:27:20,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=215, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=473, PETRI_PLACES=222, PETRI_TRANSITIONS=218} [2025-01-09 21:27:20,244 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -4 predicate places. [2025-01-09 21:27:20,244 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 218 transitions, 473 flow [2025-01-09 21:27:20,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 192.33333333333334) internal successors, (577), 3 states have internal predecessors, (577), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:20,244 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:20,245 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-01-09 21:27:20,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:27:20,245 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:20,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:20,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1554177895, now seen corresponding path program 1 times [2025-01-09 21:27:20,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:20,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214126025] [2025-01-09 21:27:20,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:20,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:20,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-01-09 21:27:20,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-01-09 21:27:20,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:20,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:20,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:20,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:20,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214126025] [2025-01-09 21:27:20,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214126025] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:20,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:20,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:27:20,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836932857] [2025-01-09 21:27:20,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:20,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:20,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:20,285 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:20,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:20,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 242 [2025-01-09 21:27:20,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 218 transitions, 473 flow. Second operand has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:20,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:20,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 242 [2025-01-09 21:27:20,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:26,807 INFO L124 PetriNetUnfolderBase]: 27444/79542 cut-off events. [2025-01-09 21:27:26,807 INFO L125 PetriNetUnfolderBase]: For 2588/8245 co-relation queries the response was YES. [2025-01-09 21:27:27,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119469 conditions, 79542 events. 27444/79542 cut-off events. For 2588/8245 co-relation queries the response was YES. Maximal size of possible extension queue 1762. Compared 1032913 event pairs, 11693 based on Foata normal form. 47/71952 useless extension candidates. Maximal degree in co-relation 119411. Up to 25412 conditions per place. [2025-01-09 21:27:27,377 INFO L140 encePairwiseOnDemand]: 227/242 looper letters, 60 selfloop transitions, 10 changer transitions 0/247 dead transitions. [2025-01-09 21:27:27,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 247 transitions, 692 flow [2025-01-09 21:27:27,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 615 transitions. [2025-01-09 21:27:27,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8471074380165289 [2025-01-09 21:27:27,379 INFO L175 Difference]: Start difference. First operand has 222 places, 218 transitions, 473 flow. Second operand 3 states and 615 transitions. [2025-01-09 21:27:27,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 247 transitions, 692 flow [2025-01-09 21:27:27,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 247 transitions, 690 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:27:27,384 INFO L231 Difference]: Finished difference. Result has 223 places, 224 transitions, 545 flow [2025-01-09 21:27:27,384 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=216, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=545, PETRI_PLACES=223, PETRI_TRANSITIONS=224} [2025-01-09 21:27:27,384 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, -3 predicate places. [2025-01-09 21:27:27,384 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 224 transitions, 545 flow [2025-01-09 21:27:27,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.66666666666666) internal successors, (545), 3 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:27,385 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:27,385 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:27,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:27:27,385 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:27,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:27,386 INFO L85 PathProgramCache]: Analyzing trace with hash 592224553, now seen corresponding path program 1 times [2025-01-09 21:27:27,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:27,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084921089] [2025-01-09 21:27:27,386 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:27,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:27,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:27:27,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:27:27,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:27,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:27,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:27:27,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:27,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084921089] [2025-01-09 21:27:27,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084921089] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:27,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:27,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:27,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543376386] [2025-01-09 21:27:27,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:27,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:27:27,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:27,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:27:27,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:27:27,474 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 242 [2025-01-09 21:27:27,474 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 224 transitions, 545 flow. Second operand has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:27,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:27,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 242 [2025-01-09 21:27:27,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:33,931 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 85#L708-3true, 241#(= |#race~glob~0| 0), 77#L715-12true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:33,931 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:27:33,931 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:33,931 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:33,931 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:33,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 85#L708-3true, 241#(= |#race~glob~0| 0), 77#L715-12true, 128#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:33,932 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-01-09 21:27:33,932 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:27:33,932 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-01-09 21:27:33,932 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:27:33,932 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 85#L708-3true, 241#(= |#race~glob~0| 0), 77#L715-12true, 244#true, 91#L715-12true, 82#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:33,932 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-01-09 21:27:33,932 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-01-09 21:27:33,935 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:27:33,935 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:27:34,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,007 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 244#true, 128#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,007 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,007 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 244#true, 91#L715-12true, 82#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,008 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,008 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,008 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,008 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 85#L708-3true, 244#true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,269 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,269 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,269 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,269 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,269 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 85#L708-3true, 244#true, 128#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,270 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,270 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,270 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,270 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,270 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 85#L708-3true, 244#true, 91#L715-12true, 82#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,270 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,270 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,270 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,270 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,271 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 96#L709-3true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,272 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 96#L709-3true, 244#true, 128#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,272 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 96#L709-3true, 244#true, 91#L715-12true, 82#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,272 INFO L294 olderBase$Statistics]: this new event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 185 ancestors and is cut-off event [2025-01-09 21:27:34,272 INFO L297 olderBase$Statistics]: existing Event has 128 ancestors and is cut-off event [2025-01-09 21:27:34,308 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,308 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 128#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,309 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 91#L715-12true, 82#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,309 INFO L294 olderBase$Statistics]: this new event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 186 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,309 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2025-01-09 21:27:34,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 51#L715-6true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 157#L709-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,311 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2025-01-09 21:27:34,311 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-01-09 21:27:34,311 INFO L297 olderBase$Statistics]: existing Event has 124 ancestors and is cut-off event [2025-01-09 21:27:34,311 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 51#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 157#L709-5true, 128#L715-5true, 244#true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,312 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 157#L709-5true, 244#true, 82#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,312 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 123 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 77#L715-12true, 157#L709-5true, 128#L715-5true, 244#true, 82#L715-5true, 223#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,312 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 122 ancestors and is cut-off event [2025-01-09 21:27:34,312 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2025-01-09 21:27:34,375 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 96#L709-3true, 244#true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,376 INFO L294 olderBase$Statistics]: this new event has 189 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 189 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 96#L709-3true, 244#true, 128#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,376 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 96#L709-3true, 244#true, 91#L715-12true, 82#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,376 INFO L294 olderBase$Statistics]: this new event has 188 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 188 ancestors and is cut-off event [2025-01-09 21:27:34,376 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2025-01-09 21:27:34,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 51#L715-6true, 177#L715-6true, Black: 239#true, 227#true, 241#(= |#race~glob~0| 0), 157#L709-5true, 244#true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,405 INFO L294 olderBase$Statistics]: this new event has 184 ancestors and is cut-off event [2025-01-09 21:27:34,405 INFO L297 olderBase$Statistics]: existing Event has 184 ancestors and is cut-off event [2025-01-09 21:27:34,405 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 127 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 51#L715-6true, Black: 239#true, 227#true, 241#(= |#race~glob~0| 0), 157#L709-5true, 244#true, 128#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,406 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, 177#L715-6true, Black: 239#true, 227#true, 241#(= |#race~glob~0| 0), 157#L709-5true, 244#true, 82#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,406 INFO L294 olderBase$Statistics]: this new event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 183 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 126 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([805] L709-4-->L709-5: Formula: (= |v_#race~glob~0_1| 0) InVars {} OutVars{#race~glob~0=|v_#race~glob~0_1|} AuxVars[] AssignedVars[#race~glob~0][192], [225#true, Black: 239#true, 227#true, 241#(= |#race~glob~0| 0), 157#L709-5true, 244#true, 128#L715-5true, 82#L715-5true, 223#true, 126#L716-2true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,406 INFO L294 olderBase$Statistics]: this new event has 182 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 182 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:27:34,406 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 45#L722-9true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,432 INFO L294 olderBase$Statistics]: this new event has 191 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 191 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 128#L715-5true, 45#L722-9true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,432 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 91#L715-12true, 45#L722-9true, 82#L715-5true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0)]) [2025-01-09 21:27:34,432 INFO L294 olderBase$Statistics]: this new event has 190 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 190 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:27:34,432 INFO L297 olderBase$Statistics]: existing Event has 133 ancestors and is cut-off event [2025-01-09 21:27:34,660 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 177#L715-6true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,661 INFO L294 olderBase$Statistics]: this new event has 201 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 201 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([965] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= 0 |v_t_funThread3of3ForFork0_#t~ret18#1_1|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread3of3ForFork0_#t~ret18#1=|v_t_funThread3of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread3of3ForFork0_#t~ret18#1][189], [130#L715-12true, 225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 128#L715-5true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,661 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([935] L715-9-->L715-12: Formula: (and (= |v_#pthreadsMutex_89| (store |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35| (store (select |v_#pthreadsMutex_90| |v_~#__global_lock~0.base_35|) |v_~#__global_lock~0.offset_35| 0))) (= |v_t_funThread2of3ForFork0_#t~ret18#1_1| 0)) InVars {#pthreadsMutex=|v_#pthreadsMutex_90|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_89|, t_funThread2of3ForFork0_#t~ret18#1=|v_t_funThread2of3ForFork0_#t~ret18#1_1|, ~#__global_lock~0.base=|v_~#__global_lock~0.base_35|, ~#__global_lock~0.offset=|v_~#__global_lock~0.offset_35|} AuxVars[] AssignedVars[#pthreadsMutex, t_funThread2of3ForFork0_#t~ret18#1][128], [225#true, 227#true, Black: 239#true, 241#(= |#race~glob~0| 0), 244#true, 91#L715-12true, 82#L715-5true, 222#true, Black: 237#(= |ULTIMATE.start_main_~i~1#1| 0), 178#ULTIMATE.startFINALtrue]) [2025-01-09 21:27:34,661 INFO L294 olderBase$Statistics]: this new event has 200 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2025-01-09 21:27:34,661 INFO L297 olderBase$Statistics]: existing Event has 200 ancestors and is cut-off event [2025-01-09 21:27:34,744 INFO L124 PetriNetUnfolderBase]: 17529/83394 cut-off events. [2025-01-09 21:27:34,745 INFO L125 PetriNetUnfolderBase]: For 4426/4500 co-relation queries the response was YES. [2025-01-09 21:27:34,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114146 conditions, 83394 events. 17529/83394 cut-off events. For 4426/4500 co-relation queries the response was YES. Maximal size of possible extension queue 1338. Compared 1258364 event pairs, 6187 based on Foata normal form. 5/75894 useless extension candidates. Maximal degree in co-relation 24778. Up to 20381 conditions per place. [2025-01-09 21:27:35,218 INFO L140 encePairwiseOnDemand]: 237/242 looper letters, 52 selfloop transitions, 5 changer transitions 0/248 dead transitions. [2025-01-09 21:27:35,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 228 places, 248 transitions, 709 flow [2025-01-09 21:27:35,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:27:35,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:27:35,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1192 transitions. [2025-01-09 21:27:35,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8209366391184573 [2025-01-09 21:27:35,221 INFO L175 Difference]: Start difference. First operand has 223 places, 224 transitions, 545 flow. Second operand 6 states and 1192 transitions. [2025-01-09 21:27:35,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 228 places, 248 transitions, 709 flow [2025-01-09 21:27:35,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 226 places, 248 transitions, 689 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:35,236 INFO L231 Difference]: Finished difference. Result has 229 places, 227 transitions, 557 flow [2025-01-09 21:27:35,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=525, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=557, PETRI_PLACES=229, PETRI_TRANSITIONS=227} [2025-01-09 21:27:35,237 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, 3 predicate places. [2025-01-09 21:27:35,237 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 227 transitions, 557 flow [2025-01-09 21:27:35,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 190.6) internal successors, (953), 5 states have internal predecessors, (953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:35,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:35,237 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:35,237 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:27:35,238 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:35,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:35,238 INFO L85 PathProgramCache]: Analyzing trace with hash -768878080, now seen corresponding path program 1 times [2025-01-09 21:27:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:35,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5133306] [2025-01-09 21:27:35,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:35,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:35,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:27:35,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:27:35,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:35,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:35,272 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:27:35,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:35,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5133306] [2025-01-09 21:27:35,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5133306] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:35,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:35,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:27:35,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896087035] [2025-01-09 21:27:35,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:35,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:27:35,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:35,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:27:35,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:27:35,282 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 191 out of 242 [2025-01-09 21:27:35,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 227 transitions, 557 flow. Second operand has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:35,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:35,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 191 of 242 [2025-01-09 21:27:35,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:27:45,740 INFO L124 PetriNetUnfolderBase]: 28122/117304 cut-off events. [2025-01-09 21:27:45,741 INFO L125 PetriNetUnfolderBase]: For 1437/1437 co-relation queries the response was YES. [2025-01-09 21:27:46,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 162949 conditions, 117304 events. 28122/117304 cut-off events. For 1437/1437 co-relation queries the response was YES. Maximal size of possible extension queue 2393. Compared 1842498 event pairs, 16827 based on Foata normal form. 242/106699 useless extension candidates. Maximal degree in co-relation 162812. Up to 22645 conditions per place. [2025-01-09 21:27:46,798 INFO L140 encePairwiseOnDemand]: 239/242 looper letters, 47 selfloop transitions, 2 changer transitions 0/246 dead transitions. [2025-01-09 21:27:46,798 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 246 transitions, 693 flow [2025-01-09 21:27:46,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:27:46,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:27:46,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 623 transitions. [2025-01-09 21:27:46,800 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8581267217630854 [2025-01-09 21:27:46,800 INFO L175 Difference]: Start difference. First operand has 229 places, 227 transitions, 557 flow. Second operand 3 states and 623 transitions. [2025-01-09 21:27:46,800 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 246 transitions, 693 flow [2025-01-09 21:27:46,807 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 246 transitions, 687 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:27:46,809 INFO L231 Difference]: Finished difference. Result has 230 places, 228 transitions, 563 flow [2025-01-09 21:27:46,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=242, PETRI_DIFFERENCE_MINUEND_FLOW=551, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=563, PETRI_PLACES=230, PETRI_TRANSITIONS=228} [2025-01-09 21:27:46,809 INFO L279 CegarLoopForPetriNet]: 226 programPoint places, 4 predicate places. [2025-01-09 21:27:46,809 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 228 transitions, 563 flow [2025-01-09 21:27:46,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 193.33333333333334) internal successors, (580), 3 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:46,810 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:46,810 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:46,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:27:46,810 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 8 more)] === [2025-01-09 21:27:46,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:46,811 INFO L85 PathProgramCache]: Analyzing trace with hash 507604656, now seen corresponding path program 1 times [2025-01-09 21:27:46,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:46,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572125415] [2025-01-09 21:27:46,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:46,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:46,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:27:46,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:27:46,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:46,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:46,835 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:27:46,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-01-09 21:27:46,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-01-09 21:27:46,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:46,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:27:46,867 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:27:46,867 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:27:46,867 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 11 remaining) [2025-01-09 21:27:46,867 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (8 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (4 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (2 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 11 remaining) [2025-01-09 21:27:46,868 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 11 remaining) [2025-01-09 21:27:46,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:27:46,868 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-09 21:27:46,869 WARN L246 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:27:46,869 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-01-09 21:27:46,892 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-01-09 21:27:46,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 255 places, 274 transitions, 588 flow [2025-01-09 21:27:46,943 INFO L124 PetriNetUnfolderBase]: 77/957 cut-off events. [2025-01-09 21:27:46,943 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-01-09 21:27:46,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 957 events. 77/957 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 4628 event pairs, 6 based on Foata normal form. 0/835 useless extension candidates. Maximal degree in co-relation 680. Up to 32 conditions per place. [2025-01-09 21:27:46,946 INFO L82 GeneralOperation]: Start removeDead. Operand has 255 places, 274 transitions, 588 flow [2025-01-09 21:27:46,949 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 255 places, 274 transitions, 588 flow [2025-01-09 21:27:46,949 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:27:46,949 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;@6b712a4d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:27:46,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-01-09 21:27:46,952 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:27:46,953 INFO L124 PetriNetUnfolderBase]: 0/56 cut-off events. [2025-01-09 21:27:46,953 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:27:46,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:27:46,953 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:27:46,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-01-09 21:27:46,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:27:46,953 INFO L85 PathProgramCache]: Analyzing trace with hash -324046, now seen corresponding path program 1 times [2025-01-09 21:27:46,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:27:46,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997538780] [2025-01-09 21:27:46,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:27:46,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:27:46,958 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-01-09 21:27:46,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-01-09 21:27:46,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:27:46,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:27:47,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:27:47,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:27:47,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997538780] [2025-01-09 21:27:47,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997538780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:27:47,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:27:47,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:27:47,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795099545] [2025-01-09 21:27:47,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:27:47,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:27:47,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:27:47,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:27:47,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:27:47,154 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 274 [2025-01-09 21:27:47,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 255 places, 274 transitions, 588 flow. Second operand has 6 states, 6 states have (on average 201.5) internal successors, (1209), 6 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:27:47,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:27:47,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 274 [2025-01-09 21:27:47,156 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand