/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --cacsl2boogietranslator.check.unreachability.of.reach_error.function false --cacsl2boogietranslator.check.absence.of.data.races.in.concurrent.programs true -i ../../../trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-ac9dbd0-m [2023-08-25 04:05:36,657 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-08-25 04:05:36,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-VariableLbe.epf [2023-08-25 04:05:36,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-08-25 04:05:36,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.Checked method. Library mode if empty. [2023-08-25 04:05:36,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-25 04:05:36,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-25 04:05:36,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-25 04:05:36,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-25 04:05:36,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-08-25 04:05:36,773 INFO L153 SettingsManager]: * Use SBE=true [2023-08-25 04:05:36,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-25 04:05:36,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-08-25 04:05:36,774 INFO L153 SettingsManager]: * sizeof long=4 [2023-08-25 04:05:36,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-25 04:05:36,774 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-08-25 04:05:36,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-08-25 04:05:36,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-08-25 04:05:36,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-25 04:05:36,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-08-25 04:05:36,776 INFO L153 SettingsManager]: * sizeof long double=12 [2023-08-25 04:05:36,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-08-25 04:05:36,776 INFO L153 SettingsManager]: * Use constant arrays=true [2023-08-25 04:05:36,777 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-25 04:05:36,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-25 04:05:36,777 INFO L153 SettingsManager]: * To the following directory=./dump/ [2023-08-25 04:05:36,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-25 04:05:36,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:05:36,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-25 04:05:36,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-25 04:05:36,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-08-25 04:05:36,779 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-25 04:05:36,779 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-25 04:05:36,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-25 04:05:36,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-25 04:05:36,779 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check unreachability of reach_error function -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Check absence of data races in concurrent programs -> true [2023-08-25 04:05:37,081 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-25 04:05:37,102 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-25 04:05:37,104 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-25 04:05:37,106 INFO L270 PluginConnector]: Initializing CDTParser... [2023-08-25 04:05:37,107 INFO L274 PluginConnector]: CDTParser initialized [2023-08-25 04:05:37,108 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2023-08-25 04:05:38,313 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-08-25 04:05:38,639 INFO L384 CDTParser]: Found 1 translation units. [2023-08-25 04:05:38,639 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/28-race_reach_28-funptr_racefree.i [2023-08-25 04:05:38,654 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541db363f/c8a70875f9f2434795489db5b54f2f87/FLAG7ff55de3f [2023-08-25 04:05:38,667 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/541db363f/c8a70875f9f2434795489db5b54f2f87 [2023-08-25 04:05:38,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-25 04:05:38,674 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-08-25 04:05:38,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-25 04:05:38,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-25 04:05:38,679 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-25 04:05:38,681 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:05:38" (1/1) ... [2023-08-25 04:05:38,682 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d5b8d1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:38, skipping insertion in model container [2023-08-25 04:05:38,682 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 04:05:38" (1/1) ... [2023-08-25 04:05:38,741 INFO L176 MainTranslator]: Built tables and reachable declarations [2023-08-25 04:05:39,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:05:39,212 INFO L201 MainTranslator]: Completed pre-run [2023-08-25 04:05:39,237 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-25 04:05:39,239 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: short [244] [2023-08-25 04:05:39,254 WARN L75 lationResultReporter]: Unsoundness Warning: unspecified type, defaulting to int C: unsigned short [736] [2023-08-25 04:05:39,271 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-25 04:05:39,319 WARN L669 CHandler]: The function g is called, but not defined or handled by StandardFunctionHandler. [2023-08-25 04:05:39,326 INFO L206 MainTranslator]: Completed translation [2023-08-25 04:05:39,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39 WrapperNode [2023-08-25 04:05:39,326 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-25 04:05:39,327 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-25 04:05:39,327 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-25 04:05:39,328 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-25 04:05:39,333 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,365 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,399 INFO L138 Inliner]: procedures = 273, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 152 [2023-08-25 04:05:39,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-25 04:05:39,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-25 04:05:39,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-25 04:05:39,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-08-25 04:05:39,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,441 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,445 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,447 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,448 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,451 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-25 04:05:39,451 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-25 04:05:39,452 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-08-25 04:05:39,452 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-08-25 04:05:39,452 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (1/1) ... [2023-08-25 04:05:39,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-25 04:05:39,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:05:39,506 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-25 04:05:39,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-25 04:05:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-25 04:05:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-25 04:05:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-25 04:05:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-25 04:05:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-08-25 04:05:39,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-25 04:05:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-08-25 04:05:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-08-25 04:05:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-25 04:05:39,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-25 04:05:39,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-25 04:05:39,547 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-25 04:05:39,671 INFO L236 CfgBuilder]: Building ICFG [2023-08-25 04:05:39,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-25 04:05:39,977 INFO L277 CfgBuilder]: Performing block encoding [2023-08-25 04:05:39,985 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-25 04:05:39,985 INFO L302 CfgBuilder]: Removed 10 assume(true) statements. [2023-08-25 04:05:39,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:05:39 BoogieIcfgContainer [2023-08-25 04:05:39,987 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-25 04:05:39,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-25 04:05:39,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-08-25 04:05:39,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-08-25 04:05:39,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 04:05:38" (1/3) ... [2023-08-25 04:05:39,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcf7500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:05:39, skipping insertion in model container [2023-08-25 04:05:39,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 04:05:39" (2/3) ... [2023-08-25 04:05:39,993 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4dcf7500 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 04:05:39, skipping insertion in model container [2023-08-25 04:05:39,993 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 04:05:39" (3/3) ... [2023-08-25 04:05:39,994 INFO L112 eAbstractionObserver]: Analyzing ICFG 28-race_reach_28-funptr_racefree.i [2023-08-25 04:05:40,009 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-25 04:05:40,009 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-08-25 04:05:40,009 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-25 04:05:40,083 INFO L144 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2023-08-25 04:05:40,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 158 transitions, 324 flow [2023-08-25 04:05:40,209 INFO L124 PetriNetUnfolderBase]: 19/215 cut-off events. [2023-08-25 04:05:40,209 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-25 04:05:40,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 19/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 621 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 117. Up to 4 conditions per place. [2023-08-25 04:05:40,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 148 places, 158 transitions, 324 flow [2023-08-25 04:05:40,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 148 places, 158 transitions, 324 flow [2023-08-25 04:05:40,226 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 04:05:40,233 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 158 transitions, 324 flow [2023-08-25 04:05:40,235 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 148 places, 158 transitions, 324 flow [2023-08-25 04:05:40,236 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 148 places, 158 transitions, 324 flow [2023-08-25 04:05:40,269 INFO L124 PetriNetUnfolderBase]: 19/215 cut-off events. [2023-08-25 04:05:40,270 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-25 04:05:40,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 215 events. 19/215 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 621 event pairs, 0 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 117. Up to 4 conditions per place. [2023-08-25 04:05:40,276 INFO L119 LiptonReduction]: Number of co-enabled transitions 6930 [2023-08-25 04:05:43,661 INFO L134 LiptonReduction]: Checked pairs total: 20163 [2023-08-25 04:05:43,661 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-25 04:05:43,675 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 04:05:43,681 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3f0c1880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 04:05:43,682 INFO L358 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2023-08-25 04:05:43,685 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 04:05:43,685 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-25 04:05:43,686 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:05:43,686 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:05:43,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 04:05:43,687 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-25 04:05:43,691 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:05:43,692 INFO L85 PathProgramCache]: Analyzing trace with hash 548990612, now seen corresponding path program 1 times [2023-08-25 04:05:43,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:05:43,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679173802] [2023-08-25 04:05:43,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:43,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:05:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:05:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:05:43,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:05:43,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679173802] [2023-08-25 04:05:43,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679173802] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:05:43,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:05:43,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:05:43,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222188796] [2023-08-25 04:05:43,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:05:43,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:05:43,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:05:43,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:05:43,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:05:43,954 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 273 [2023-08-25 04:05:43,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 62 transitions, 132 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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) [2023-08-25 04:05:43,958 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:05:43,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 273 [2023-08-25 04:05:43,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:05:44,122 INFO L124 PetriNetUnfolderBase]: 196/561 cut-off events. [2023-08-25 04:05:44,122 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-08-25 04:05:44,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 997 conditions, 561 events. 196/561 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2865 event pairs, 169 based on Foata normal form. 45/519 useless extension candidates. Maximal degree in co-relation 971. Up to 411 conditions per place. [2023-08-25 04:05:44,128 INFO L140 encePairwiseOnDemand]: 260/273 looper letters, 43 selfloop transitions, 2 changer transitions 2/67 dead transitions. [2023-08-25 04:05:44,129 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 67 transitions, 236 flow [2023-08-25 04:05:44,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:05:44,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:05:44,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 469 transitions. [2023-08-25 04:05:44,143 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5726495726495726 [2023-08-25 04:05:44,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 469 transitions. [2023-08-25 04:05:44,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 469 transitions. [2023-08-25 04:05:44,146 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:05:44,148 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 469 transitions. [2023-08-25 04:05:44,153 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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) [2023-08-25 04:05:44,158 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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) [2023-08-25 04:05:44,159 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 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) [2023-08-25 04:05:44,160 INFO L175 Difference]: Start difference. First operand has 55 places, 62 transitions, 132 flow. Second operand 3 states and 469 transitions. [2023-08-25 04:05:44,161 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 67 transitions, 236 flow [2023-08-25 04:05:44,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 236 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:05:44,166 INFO L231 Difference]: Finished difference. Result has 57 places, 50 transitions, 113 flow [2023-08-25 04:05:44,167 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=113, PETRI_PLACES=57, PETRI_TRANSITIONS=50} [2023-08-25 04:05:44,170 INFO L281 CegarLoopForPetriNet]: 55 programPoint places, 2 predicate places. [2023-08-25 04:05:44,171 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 50 transitions, 113 flow [2023-08-25 04:05:44,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 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) [2023-08-25 04:05:44,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:05:44,171 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2023-08-25 04:05:44,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-25 04:05:44,172 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2023-08-25 04:05:44,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:05:44,173 INFO L85 PathProgramCache]: Analyzing trace with hash -163585037, now seen corresponding path program 1 times [2023-08-25 04:05:44,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:05:44,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743336231] [2023-08-25 04:05:44,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:44,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:05:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:05:44,202 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 04:05:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:05:44,271 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 04:05:44,271 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 04:05:44,273 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2023-08-25 04:05:44,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2023-08-25 04:05:44,275 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2023-08-25 04:05:44,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2023-08-25 04:05:44,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (10 of 15 remaining) [2023-08-25 04:05:44,276 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2023-08-25 04:05:44,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2023-08-25 04:05:44,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2023-08-25 04:05:44,277 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2023-08-25 04:05:44,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2023-08-25 04:05:44,278 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2023-08-25 04:05:44,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2023-08-25 04:05:44,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2023-08-25 04:05:44,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2023-08-25 04:05:44,279 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2023-08-25 04:05:44,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-25 04:05:44,280 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1] [2023-08-25 04:05:44,282 WARN L233 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-25 04:05:44,282 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2023-08-25 04:05:44,318 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-25 04:05:44,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 215 transitions, 448 flow [2023-08-25 04:05:44,376 INFO L124 PetriNetUnfolderBase]: 34/360 cut-off events. [2023-08-25 04:05:44,376 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-25 04:05:44,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 360 events. 34/360 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1337 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 217. Up to 8 conditions per place. [2023-08-25 04:05:44,382 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 215 transitions, 448 flow [2023-08-25 04:05:44,386 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 200 places, 215 transitions, 448 flow [2023-08-25 04:05:44,386 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 04:05:44,386 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 200 places, 215 transitions, 448 flow [2023-08-25 04:05:44,387 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 200 places, 215 transitions, 448 flow [2023-08-25 04:05:44,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 215 transitions, 448 flow [2023-08-25 04:05:44,434 INFO L124 PetriNetUnfolderBase]: 34/360 cut-off events. [2023-08-25 04:05:44,434 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-08-25 04:05:44,436 INFO L83 FinitePrefix]: Finished finitePrefix Result has 374 conditions, 360 events. 34/360 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1337 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 217. Up to 8 conditions per place. [2023-08-25 04:05:44,450 INFO L119 LiptonReduction]: Number of co-enabled transitions 21120 [2023-08-25 04:05:47,524 INFO L134 LiptonReduction]: Checked pairs total: 79374 [2023-08-25 04:05:47,524 INFO L136 LiptonReduction]: Total number of compositions: 137 [2023-08-25 04:05:47,526 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 04:05:47,527 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3f0c1880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 04:05:47,527 INFO L358 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2023-08-25 04:05:47,529 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 04:05:47,529 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-25 04:05:47,530 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:05:47,530 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:05:47,530 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 04:05:47,530 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-25 04:05:47,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:05:47,530 INFO L85 PathProgramCache]: Analyzing trace with hash 939154679, now seen corresponding path program 1 times [2023-08-25 04:05:47,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:05:47,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231362320] [2023-08-25 04:05:47,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:47,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:05:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:05:47,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:05:47,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:05:47,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231362320] [2023-08-25 04:05:47,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231362320] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:05:47,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:05:47,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:05:47,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025302070] [2023-08-25 04:05:47,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:05:47,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:05:47,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:05:47,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:05:47,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:05:47,576 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 352 [2023-08-25 04:05:47,577 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 105 transitions, 228 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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) [2023-08-25 04:05:47,577 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:05:47,577 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 352 [2023-08-25 04:05:47,577 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:05:48,665 INFO L124 PetriNetUnfolderBase]: 5132/10921 cut-off events. [2023-08-25 04:05:48,665 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-08-25 04:05:48,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19153 conditions, 10921 events. 5132/10921 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 290. Compared 93880 event pairs, 2418 based on Foata normal form. 1240/10773 useless extension candidates. Maximal degree in co-relation 1418. Up to 8118 conditions per place. [2023-08-25 04:05:48,732 INFO L140 encePairwiseOnDemand]: 332/352 looper letters, 57 selfloop transitions, 2 changer transitions 0/101 dead transitions. [2023-08-25 04:05:48,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 101 transitions, 338 flow [2023-08-25 04:05:48,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:05:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:05:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 635 transitions. [2023-08-25 04:05:48,736 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6013257575757576 [2023-08-25 04:05:48,736 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 635 transitions. [2023-08-25 04:05:48,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 635 transitions. [2023-08-25 04:05:48,737 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:05:48,737 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 635 transitions. [2023-08-25 04:05:48,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 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) [2023-08-25 04:05:48,742 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 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) [2023-08-25 04:05:48,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 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) [2023-08-25 04:05:48,743 INFO L175 Difference]: Start difference. First operand has 92 places, 105 transitions, 228 flow. Second operand 3 states and 635 transitions. [2023-08-25 04:05:48,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 101 transitions, 338 flow [2023-08-25 04:05:48,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 101 transitions, 338 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:05:48,746 INFO L231 Difference]: Finished difference. Result has 93 places, 88 transitions, 204 flow [2023-08-25 04:05:48,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=93, PETRI_TRANSITIONS=88} [2023-08-25 04:05:48,747 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 1 predicate places. [2023-08-25 04:05:48,748 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 88 transitions, 204 flow [2023-08-25 04:05:48,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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) [2023-08-25 04:05:48,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:05:48,748 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 04:05:48,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-25 04:05:48,749 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-25 04:05:48,749 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:05:48,749 INFO L85 PathProgramCache]: Analyzing trace with hash -960676020, now seen corresponding path program 1 times [2023-08-25 04:05:48,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:05:48,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457593759] [2023-08-25 04:05:48,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:48,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:05:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:05:48,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:05:48,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:05:48,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457593759] [2023-08-25 04:05:48,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457593759] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:05:48,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:05:48,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:05:48,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833236640] [2023-08-25 04:05:48,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:05:48,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:05:48,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:05:48,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:05:48,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:05:48,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 352 [2023-08-25 04:05:48,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 88 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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) [2023-08-25 04:05:48,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:05:48,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 352 [2023-08-25 04:05:48,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:05:50,905 INFO L124 PetriNetUnfolderBase]: 13152/26308 cut-off events. [2023-08-25 04:05:50,905 INFO L125 PetriNetUnfolderBase]: For 596/596 co-relation queries the response was YES. [2023-08-25 04:05:50,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 47844 conditions, 26308 events. 13152/26308 cut-off events. For 596/596 co-relation queries the response was YES. Maximal size of possible extension queue 675. Compared 246624 event pairs, 3508 based on Foata normal form. 0/22576 useless extension candidates. Maximal degree in co-relation 47726. Up to 12315 conditions per place. [2023-08-25 04:05:51,063 INFO L140 encePairwiseOnDemand]: 345/352 looper letters, 97 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2023-08-25 04:05:51,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 137 transitions, 524 flow [2023-08-25 04:05:51,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:05:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:05:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2023-08-25 04:05:51,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6164772727272727 [2023-08-25 04:05:51,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2023-08-25 04:05:51,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2023-08-25 04:05:51,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:05:51,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2023-08-25 04:05:51,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 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) [2023-08-25 04:05:51,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 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) [2023-08-25 04:05:51,071 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 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) [2023-08-25 04:05:51,071 INFO L175 Difference]: Start difference. First operand has 93 places, 88 transitions, 204 flow. Second operand 3 states and 651 transitions. [2023-08-25 04:05:51,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 137 transitions, 524 flow [2023-08-25 04:05:51,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 137 transitions, 521 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 04:05:51,077 INFO L231 Difference]: Finished difference. Result has 96 places, 93 transitions, 246 flow [2023-08-25 04:05:51,077 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=246, PETRI_PLACES=96, PETRI_TRANSITIONS=93} [2023-08-25 04:05:51,078 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 4 predicate places. [2023-08-25 04:05:51,078 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 93 transitions, 246 flow [2023-08-25 04:05:51,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) internal successors, (555), 3 states have internal predecessors, (555), 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) [2023-08-25 04:05:51,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:05:51,079 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:05:51,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-25 04:05:51,079 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-25 04:05:51,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:05:51,079 INFO L85 PathProgramCache]: Analyzing trace with hash -68753901, now seen corresponding path program 1 times [2023-08-25 04:05:51,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:05:51,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086594820] [2023-08-25 04:05:51,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:51,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:05:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:05:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:05:51,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:05:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086594820] [2023-08-25 04:05:51,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086594820] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:05:51,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996117898] [2023-08-25 04:05:51,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:51,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:05:51,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:05:51,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:05:51,182 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-25 04:05:51,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:05:51,273 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:05:51,275 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:05:51,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 04:05:51,303 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 04:05:51,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996117898] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:05:51,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 04:05:51,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-25 04:05:51,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726338138] [2023-08-25 04:05:51,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:05:51,304 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:05:51,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:05:51,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:05:51,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 04:05:51,306 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 352 [2023-08-25 04:05:51,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 93 transitions, 246 flow. Second operand has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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) [2023-08-25 04:05:51,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:05:51,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 352 [2023-08-25 04:05:51,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:05:53,078 INFO L124 PetriNetUnfolderBase]: 13092/27225 cut-off events. [2023-08-25 04:05:53,078 INFO L125 PetriNetUnfolderBase]: For 4566/4566 co-relation queries the response was YES. [2023-08-25 04:05:53,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52091 conditions, 27225 events. 13092/27225 cut-off events. For 4566/4566 co-relation queries the response was YES. Maximal size of possible extension queue 731. Compared 261297 event pairs, 10738 based on Foata normal form. 0/23974 useless extension candidates. Maximal degree in co-relation 22125. Up to 19723 conditions per place. [2023-08-25 04:05:53,217 INFO L140 encePairwiseOnDemand]: 347/352 looper letters, 86 selfloop transitions, 7 changer transitions 0/128 dead transitions. [2023-08-25 04:05:53,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 98 places, 128 transitions, 530 flow [2023-08-25 04:05:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:05:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:05:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 624 transitions. [2023-08-25 04:05:53,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5909090909090909 [2023-08-25 04:05:53,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 624 transitions. [2023-08-25 04:05:53,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 624 transitions. [2023-08-25 04:05:53,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:05:53,220 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 624 transitions. [2023-08-25 04:05:53,221 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 208.0) internal successors, (624), 3 states have internal predecessors, (624), 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) [2023-08-25 04:05:53,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 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) [2023-08-25 04:05:53,224 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 352.0) internal successors, (1408), 4 states have internal predecessors, (1408), 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) [2023-08-25 04:05:53,224 INFO L175 Difference]: Start difference. First operand has 96 places, 93 transitions, 246 flow. Second operand 3 states and 624 transitions. [2023-08-25 04:05:53,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 98 places, 128 transitions, 530 flow [2023-08-25 04:05:53,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 128 transitions, 512 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 04:05:53,234 INFO L231 Difference]: Finished difference. Result has 97 places, 98 transitions, 287 flow [2023-08-25 04:05:53,234 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=352, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=287, PETRI_PLACES=97, PETRI_TRANSITIONS=98} [2023-08-25 04:05:53,235 INFO L281 CegarLoopForPetriNet]: 92 programPoint places, 5 predicate places. [2023-08-25 04:05:53,235 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 98 transitions, 287 flow [2023-08-25 04:05:53,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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) [2023-08-25 04:05:53,235 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:05:53,235 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2023-08-25 04:05:53,244 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-08-25 04:05:53,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:05:53,440 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2023-08-25 04:05:53,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:05:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1954557496, now seen corresponding path program 1 times [2023-08-25 04:05:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:05:53,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212657713] [2023-08-25 04:05:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:05:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:05:53,474 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 04:05:53,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:05:53,495 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 04:05:53,495 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 04:05:53,495 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 20 remaining) [2023-08-25 04:05:53,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 20 remaining) [2023-08-25 04:05:53,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 20 remaining) [2023-08-25 04:05:53,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (16 of 20 remaining) [2023-08-25 04:05:53,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (15 of 20 remaining) [2023-08-25 04:05:53,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 20 remaining) [2023-08-25 04:05:53,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 20 remaining) [2023-08-25 04:05:53,496 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 20 remaining) [2023-08-25 04:05:53,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 20 remaining) [2023-08-25 04:05:53,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 20 remaining) [2023-08-25 04:05:53,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 20 remaining) [2023-08-25 04:05:53,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 20 remaining) [2023-08-25 04:05:53,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 20 remaining) [2023-08-25 04:05:53,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 20 remaining) [2023-08-25 04:05:53,497 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 20 remaining) [2023-08-25 04:05:53,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 20 remaining) [2023-08-25 04:05:53,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 20 remaining) [2023-08-25 04:05:53,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 20 remaining) [2023-08-25 04:05:53,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 20 remaining) [2023-08-25 04:05:53,498 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 20 remaining) [2023-08-25 04:05:53,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-25 04:05:53,498 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2023-08-25 04:05:53,499 WARN L233 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-25 04:05:53,499 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2023-08-25 04:05:53,537 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-08-25 04:05:53,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 272 transitions, 574 flow [2023-08-25 04:05:53,605 INFO L124 PetriNetUnfolderBase]: 54/550 cut-off events. [2023-08-25 04:05:53,606 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-25 04:05:53,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 550 events. 54/550 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2353 event pairs, 1 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 368. Up to 16 conditions per place. [2023-08-25 04:05:53,611 INFO L82 GeneralOperation]: Start removeDead. Operand has 252 places, 272 transitions, 574 flow [2023-08-25 04:05:53,615 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 252 places, 272 transitions, 574 flow [2023-08-25 04:05:53,615 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 04:05:53,616 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 252 places, 272 transitions, 574 flow [2023-08-25 04:05:53,616 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 252 places, 272 transitions, 574 flow [2023-08-25 04:05:53,616 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 252 places, 272 transitions, 574 flow [2023-08-25 04:05:53,800 INFO L124 PetriNetUnfolderBase]: 54/550 cut-off events. [2023-08-25 04:05:53,801 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2023-08-25 04:05:53,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 578 conditions, 550 events. 54/550 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2353 event pairs, 1 based on Foata normal form. 0/457 useless extension candidates. Maximal degree in co-relation 368. Up to 16 conditions per place. [2023-08-25 04:05:53,827 INFO L119 LiptonReduction]: Number of co-enabled transitions 41250 [2023-08-25 04:05:56,964 INFO L134 LiptonReduction]: Checked pairs total: 166184 [2023-08-25 04:05:56,964 INFO L136 LiptonReduction]: Total number of compositions: 167 [2023-08-25 04:05:56,966 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 04:05:56,967 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3f0c1880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 04:05:56,967 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2023-08-25 04:05:56,968 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 04:05:56,968 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-25 04:05:56,968 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:05:56,968 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:05:56,969 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 04:05:56,969 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-25 04:05:56,969 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:05:56,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1412274794, now seen corresponding path program 1 times [2023-08-25 04:05:56,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:05:56,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808958688] [2023-08-25 04:05:56,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:05:56,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:05:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:05:57,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:05:57,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:05:57,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808958688] [2023-08-25 04:05:57,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [808958688] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:05:57,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:05:57,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:05:57,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351922998] [2023-08-25 04:05:57,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:05:57,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:05:57,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:05:57,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:05:57,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:05:57,019 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 439 [2023-08-25 04:05:57,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 142 transitions, 314 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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) [2023-08-25 04:05:57,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:05:57,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 439 [2023-08-25 04:05:57,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:06:08,449 INFO L124 PetriNetUnfolderBase]: 97725/165950 cut-off events. [2023-08-25 04:06:08,450 INFO L125 PetriNetUnfolderBase]: For 1994/1994 co-relation queries the response was YES. [2023-08-25 04:06:08,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 302682 conditions, 165950 events. 97725/165950 cut-off events. For 1994/1994 co-relation queries the response was YES. Maximal size of possible extension queue 3356. Compared 1644212 event pairs, 92235 based on Foata normal form. 21548/171244 useless extension candidates. Maximal degree in co-relation 185812. Up to 135288 conditions per place. [2023-08-25 04:06:09,611 INFO L140 encePairwiseOnDemand]: 413/439 looper letters, 71 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2023-08-25 04:06:09,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 132 transitions, 440 flow [2023-08-25 04:06:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:06:09,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:06:09,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 802 transitions. [2023-08-25 04:06:09,613 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6089597570235383 [2023-08-25 04:06:09,614 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 802 transitions. [2023-08-25 04:06:09,614 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 802 transitions. [2023-08-25 04:06:09,614 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:06:09,614 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 802 transitions. [2023-08-25 04:06:09,616 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 267.3333333333333) internal successors, (802), 3 states have internal predecessors, (802), 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) [2023-08-25 04:06:09,619 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:06:09,620 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:06:09,620 INFO L175 Difference]: Start difference. First operand has 124 places, 142 transitions, 314 flow. Second operand 3 states and 802 transitions. [2023-08-25 04:06:09,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 132 transitions, 440 flow [2023-08-25 04:06:09,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 132 transitions, 440 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-25 04:06:09,625 INFO L231 Difference]: Finished difference. Result has 124 places, 118 transitions, 276 flow [2023-08-25 04:06:09,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=276, PETRI_PLACES=124, PETRI_TRANSITIONS=118} [2023-08-25 04:06:09,626 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 0 predicate places. [2023-08-25 04:06:09,626 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 118 transitions, 276 flow [2023-08-25 04:06:09,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 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) [2023-08-25 04:06:09,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:06:09,627 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-25 04:06:09,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-25 04:06:09,627 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-25 04:06:09,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:06:09,628 INFO L85 PathProgramCache]: Analyzing trace with hash 825936420, now seen corresponding path program 1 times [2023-08-25 04:06:09,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:06:09,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416738141] [2023-08-25 04:06:09,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:06:09,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:06:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:06:09,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:06:09,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:06:09,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416738141] [2023-08-25 04:06:09,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416738141] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:06:09,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:06:09,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:06:09,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464325704] [2023-08-25 04:06:09,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:06:09,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:06:09,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:06:09,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:06:09,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:06:09,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 439 [2023-08-25 04:06:09,652 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 118 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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) [2023-08-25 04:06:09,652 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:06:09,652 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 439 [2023-08-25 04:06:09,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:06:42,220 INFO L124 PetriNetUnfolderBase]: 305022/498747 cut-off events. [2023-08-25 04:06:42,220 INFO L125 PetriNetUnfolderBase]: For 10696/10696 co-relation queries the response was YES. [2023-08-25 04:06:43,246 INFO L83 FinitePrefix]: Finished finitePrefix Result has 932399 conditions, 498747 events. 305022/498747 cut-off events. For 10696/10696 co-relation queries the response was YES. Maximal size of possible extension queue 9141. Compared 5287090 event pairs, 111946 based on Foata normal form. 0/442766 useless extension candidates. Maximal degree in co-relation 932280. Up to 255083 conditions per place. [2023-08-25 04:06:45,316 INFO L140 encePairwiseOnDemand]: 429/439 looper letters, 126 selfloop transitions, 7 changer transitions 0/182 dead transitions. [2023-08-25 04:06:45,317 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 182 transitions, 698 flow [2023-08-25 04:06:45,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:06:45,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:06:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 821 transitions. [2023-08-25 04:06:45,320 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6233864844343204 [2023-08-25 04:06:45,320 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 821 transitions. [2023-08-25 04:06:45,320 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 821 transitions. [2023-08-25 04:06:45,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:06:45,321 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 821 transitions. [2023-08-25 04:06:45,323 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 273.6666666666667) internal successors, (821), 3 states have internal predecessors, (821), 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) [2023-08-25 04:06:45,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:06:45,328 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:06:45,328 INFO L175 Difference]: Start difference. First operand has 124 places, 118 transitions, 276 flow. Second operand 3 states and 821 transitions. [2023-08-25 04:06:45,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 182 transitions, 698 flow [2023-08-25 04:06:45,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 182 transitions, 695 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-25 04:06:45,364 INFO L231 Difference]: Finished difference. Result has 127 places, 125 transitions, 336 flow [2023-08-25 04:06:45,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=127, PETRI_TRANSITIONS=125} [2023-08-25 04:06:45,366 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 3 predicate places. [2023-08-25 04:06:45,366 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 125 transitions, 336 flow [2023-08-25 04:06:45,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.0) internal successors, (693), 3 states have internal predecessors, (693), 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) [2023-08-25 04:06:45,366 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:06:45,367 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:06:45,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-25 04:06:45,367 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-25 04:06:45,367 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:06:45,367 INFO L85 PathProgramCache]: Analyzing trace with hash -728307197, now seen corresponding path program 1 times [2023-08-25 04:06:45,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:06:45,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865487538] [2023-08-25 04:06:45,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:06:45,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:06:45,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:06:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:06:45,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:06:45,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865487538] [2023-08-25 04:06:45,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865487538] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:06:45,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275159849] [2023-08-25 04:06:45,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:06:45,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:06:45,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:06:45,405 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:06:45,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-25 04:06:45,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:06:45,523 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:06:45,525 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:06:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-08-25 04:06:45,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-25 04:06:45,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [275159849] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:06:45,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-25 04:06:45,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2023-08-25 04:06:45,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947336523] [2023-08-25 04:06:45,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:06:45,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:06:45,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:06:45,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:06:45,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-25 04:06:45,536 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 439 [2023-08-25 04:06:45,537 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 125 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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) [2023-08-25 04:06:45,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:06:45,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 439 [2023-08-25 04:06:45,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:07:25,628 INFO L124 PetriNetUnfolderBase]: 304050/515337 cut-off events. [2023-08-25 04:07:25,628 INFO L125 PetriNetUnfolderBase]: For 97937/97937 co-relation queries the response was YES. [2023-08-25 04:07:27,261 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1023220 conditions, 515337 events. 304050/515337 cut-off events. For 97937/97937 co-relation queries the response was YES. Maximal size of possible extension queue 9676. Compared 5678523 event pairs, 250102 based on Foata normal form. 0/470222 useless extension candidates. Maximal degree in co-relation 307265. Up to 397523 conditions per place. [2023-08-25 04:07:29,265 INFO L140 encePairwiseOnDemand]: 433/439 looper letters, 119 selfloop transitions, 9 changer transitions 0/177 dead transitions. [2023-08-25 04:07:29,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 177 transitions, 738 flow [2023-08-25 04:07:29,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:07:29,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:07:29,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 793 transitions. [2023-08-25 04:07:29,268 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6021260440394837 [2023-08-25 04:07:29,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 793 transitions. [2023-08-25 04:07:29,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 793 transitions. [2023-08-25 04:07:29,269 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:07:29,269 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 793 transitions. [2023-08-25 04:07:29,270 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 264.3333333333333) internal successors, (793), 3 states have internal predecessors, (793), 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) [2023-08-25 04:07:29,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:07:29,273 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:07:29,273 INFO L175 Difference]: Start difference. First operand has 127 places, 125 transitions, 336 flow. Second operand 3 states and 793 transitions. [2023-08-25 04:07:29,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 177 transitions, 738 flow [2023-08-25 04:07:29,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 177 transitions, 712 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-25 04:07:29,706 INFO L231 Difference]: Finished difference. Result has 128 places, 132 transitions, 391 flow [2023-08-25 04:07:29,706 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=128, PETRI_TRANSITIONS=132} [2023-08-25 04:07:29,707 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, 4 predicate places. [2023-08-25 04:07:29,707 INFO L495 AbstractCegarLoop]: Abstraction has has 128 places, 132 transitions, 391 flow [2023-08-25 04:07:29,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.66666666666666) internal successors, (686), 3 states have internal predecessors, (686), 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) [2023-08-25 04:07:29,707 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:07:29,707 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:07:29,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-25 04:07:29,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-08-25 04:07:29,908 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-25 04:07:29,909 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:07:29,909 INFO L85 PathProgramCache]: Analyzing trace with hash -49372502, now seen corresponding path program 1 times [2023-08-25 04:07:29,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:07:29,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326836210] [2023-08-25 04:07:29,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:07:29,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:07:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:07:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:07:29,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:07:29,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326836210] [2023-08-25 04:07:29,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326836210] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-25 04:07:29,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274735921] [2023-08-25 04:07:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:07:29,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:07:29,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-25 04:07:29,969 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-25 04:07:29,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-25 04:07:30,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:07:30,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-25 04:07:30,055 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-08-25 04:07:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:07:30,083 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-08-25 04:07:30,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:07:30,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274735921] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-25 04:07:30,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-25 04:07:30,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-08-25 04:07:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324882879] [2023-08-25 04:07:30,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-25 04:07:30,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-25 04:07:30,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:07:30,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-25 04:07:30,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-08-25 04:07:30,104 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 439 [2023-08-25 04:07:30,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 132 transitions, 391 flow. Second operand has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 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) [2023-08-25 04:07:30,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:07:30,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 439 [2023-08-25 04:07:30,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:07:30,364 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 105#L-1true, t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:30,364 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,364 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,364 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,364 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,365 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, 105#L-1true, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,365 INFO L294 olderBase$Statistics]: this new event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,365 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,365 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,365 INFO L297 olderBase$Statistics]: existing Event has 26 ancestors and is cut-off event [2023-08-25 04:07:30,395 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 260#true, 70#L942-29true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 266#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:30,395 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,395 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,395 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,395 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, 70#L942-29true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,396 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,396 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,396 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,396 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 105#L-1true, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,397 INFO L294 olderBase$Statistics]: this new event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,397 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,397 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,397 INFO L297 olderBase$Statistics]: existing Event has 27 ancestors and is cut-off event [2023-08-25 04:07:30,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, 70#L942-29true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,425 INFO L294 olderBase$Statistics]: this new event has 28 ancestors and is cut-off event [2023-08-25 04:07:30,425 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-25 04:07:30,425 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-25 04:07:30,425 INFO L297 olderBase$Statistics]: existing Event has 28 ancestors and is cut-off event [2023-08-25 04:07:30,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 11#L942-3true, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:30,475 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,475 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,475 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,475 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,501 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 11#L942-3true, t_funThread2of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,501 INFO L294 olderBase$Statistics]: this new event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,501 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,501 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,501 INFO L297 olderBase$Statistics]: existing Event has 30 ancestors and is cut-off event [2023-08-25 04:07:30,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 11#L942-3true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 266#true, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,546 INFO L294 olderBase$Statistics]: this new event has 31 ancestors and is cut-off event [2023-08-25 04:07:30,546 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 04:07:30,546 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 04:07:30,546 INFO L297 olderBase$Statistics]: existing Event has 31 ancestors and is cut-off event [2023-08-25 04:07:30,653 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 148#L942-8true, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:30,653 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,653 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,653 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,653 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,654 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 148#L942-8true, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,654 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,654 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-08-25 04:07:30,716 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 148#L942-8true, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,716 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,716 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,716 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,716 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [146#L942-11true, 30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:30,755 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,755 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,755 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,755 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,761 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [146#L942-11true, 30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,761 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,762 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,762 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,762 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-08-25 04:07:30,820 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 266#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 202#L942-27true]) [2023-08-25 04:07:30,820 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,820 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,820 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,820 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,824 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [146#L942-11true, 30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,824 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,824 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,824 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,824 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,827 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 202#L942-27true, 163#L941true]) [2023-08-25 04:07:30,827 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,827 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,827 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,827 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-08-25 04:07:30,889 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 202#L942-27true, 163#L941true]) [2023-08-25 04:07:30,890 INFO L294 olderBase$Statistics]: this new event has 37 ancestors and is cut-off event [2023-08-25 04:07:30,890 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 04:07:30,890 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 04:07:30,890 INFO L297 olderBase$Statistics]: existing Event has 37 ancestors and is cut-off event [2023-08-25 04:07:30,911 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 66#L942-17true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 266#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:30,912 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-25 04:07:30,912 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 04:07:30,912 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 04:07:30,912 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 04:07:30,913 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 66#L942-17true, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:30,913 INFO L294 olderBase$Statistics]: this new event has 38 ancestors and is cut-off event [2023-08-25 04:07:30,913 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 04:07:30,913 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 04:07:30,913 INFO L297 olderBase$Statistics]: existing Event has 38 ancestors and is cut-off event [2023-08-25 04:07:31,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 66#L942-17true, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,141 INFO L294 olderBase$Statistics]: this new event has 39 ancestors and is cut-off event [2023-08-25 04:07:31,141 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 04:07:31,141 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 04:07:31,141 INFO L297 olderBase$Statistics]: existing Event has 39 ancestors and is cut-off event [2023-08-25 04:07:31,237 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 47#L942-21true, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:31,237 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,237 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,237 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,237 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,238 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 47#L942-21true, t_funThread1of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,238 INFO L294 olderBase$Statistics]: this new event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,238 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,239 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,239 INFO L297 olderBase$Statistics]: existing Event has 41 ancestors and is cut-off event [2023-08-25 04:07:31,291 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, 47#L942-21true, t_funThread1of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,291 INFO L294 olderBase$Statistics]: this new event has 42 ancestors and is cut-off event [2023-08-25 04:07:31,291 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 04:07:31,291 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 04:07:31,291 INFO L297 olderBase$Statistics]: existing Event has 42 ancestors and is cut-off event [2023-08-25 04:07:31,344 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, 241#L942-25true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:31,345 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,345 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,345 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,345 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, 241#L942-25true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,345 INFO L294 olderBase$Statistics]: this new event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,345 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,346 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,346 INFO L297 olderBase$Statistics]: existing Event has 43 ancestors and is cut-off event [2023-08-25 04:07:31,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 241#L942-25true, 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,402 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,402 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,402 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,402 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,437 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 90#L942-28true, 224#L950-1true, Black: 260#true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:31,437 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,437 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,437 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,437 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 90#L942-28true, 110#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,448 INFO L294 olderBase$Statistics]: this new event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,448 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,448 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,448 INFO L297 olderBase$Statistics]: existing Event has 44 ancestors and is cut-off event [2023-08-25 04:07:31,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1346] L951-->L-1: Formula: (and (= (store |v_#pthreadsMutex_366| |v_~#fm~0.base_93| (store (select |v_#pthreadsMutex_366| |v_~#fm~0.base_93|) |v_~#fm~0.offset_93| 0)) |v_#pthreadsMutex_365|) (= |v_t_funThread2of3ForFork0_~g~0#1.base_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|) (= |v_t_funThread2of3ForFork0_~g~0#1.offset_11| |v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|)) InVars {t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_366|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} OutVars{t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_5|, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_5|, t_funThread2of3ForFork0_~g~0#1.base=|v_t_funThread2of3ForFork0_~g~0#1.base_11|, #pthreadsMutex=|v_#pthreadsMutex_365|, t_funThread2of3ForFork0_~g~0#1.offset=|v_t_funThread2of3ForFork0_~g~0#1.offset_11|, ~#fm~0.base=|v_~#fm~0.base_93|, ~#fm~0.offset=|v_~#fm~0.offset_93|} AuxVars[] AssignedVars[t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread2of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, #pthreadsMutex][52], [30#L956-7true, 8#L-1true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 224#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), 28#t_funEXITtrue, Black: 260#true, t_funThread1of3ForFork0InUse, 266#true, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse]) [2023-08-25 04:07:31,495 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,496 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,496 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,496 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,503 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 90#L942-28true, 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, t_funThread1of3ForFork0InUse, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 266#true, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,504 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,504 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,504 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,504 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,507 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 110#L950-1true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, 28#t_funEXITtrue, t_funThread1of3ForFork0InUse, 266#true, t_funThread2of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,508 INFO L294 olderBase$Statistics]: this new event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,508 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,508 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,508 INFO L297 olderBase$Statistics]: existing Event has 45 ancestors and is cut-off event [2023-08-25 04:07:31,560 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1404] L951-->L941: Formula: (and (= |v_#pthreadsMutex_477| (store |v_#pthreadsMutex_478| |v_~#fm~0.base_99| (store (select |v_#pthreadsMutex_478| |v_~#fm~0.base_99|) |v_~#fm~0.offset_99| 0))) (= |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7| |v_t_funThread3of3ForFork0_~g~0#1.offset_13|) (= |v_t_funThread3of3ForFork0_~g~0#1.base_13| |v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|)) InVars {#pthreadsMutex=|v_#pthreadsMutex_478|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, ~#fm~0.base=|v_~#fm~0.base_99|, ~#fm~0.offset=|v_~#fm~0.offset_99|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_477|, t_funThread3of3ForFork0_~g~0#1.base=|v_t_funThread3of3ForFork0_~g~0#1.base_13|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset_7|, t_funThread3of3ForFork0_good_#t~nondet38#1=|v_t_funThread3of3ForFork0_good_#t~nondet38#1_15|, t_funThread3of3ForFork0_good_#t~post39#1=|v_t_funThread3of3ForFork0_good_#t~post39#1_19|, ~#fm~0.base=|v_~#fm~0.base_99|, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base=|v_t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base_7|, t_funThread3of3ForFork0_good_#t~nondet40#1=|v_t_funThread3of3ForFork0_good_#t~nondet40#1_25|, t_funThread3of3ForFork0_~g~0#1.offset=|v_t_funThread3of3ForFork0_~g~0#1.offset_13|, t_funThread3of3ForFork0_good_#t~nondet37#1=|v_t_funThread3of3ForFork0_good_#t~nondet37#1_15|, t_funThread3of3ForFork0_good_#t~nondet41#1=|v_t_funThread3of3ForFork0_good_#t~nondet41#1_15|, t_funThread3of3ForFork0_good_#t~post42#1=|v_t_funThread3of3ForFork0_good_#t~post42#1_15|, ~#fm~0.offset=|v_~#fm~0.offset_99|, t_funThread3of3ForFork0_good_#t~nondet43#1=|v_t_funThread3of3ForFork0_good_#t~nondet43#1_25|} AuxVars[] AssignedVars[t_funThread3of3ForFork0_good_#t~nondet40#1, #pthreadsMutex, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.offset, t_funThread3of3ForFork0_good_#t~nondet38#1, t_funThread3of3ForFork0_good_#t~nondet37#1, t_funThread3of3ForFork0_good_#t~post39#1, t_funThread3of3ForFork0_##fun~~TO~VOID_#in~#fp#1.base, t_funThread3of3ForFork0_good_#t~nondet41#1, t_funThread3of3ForFork0_good_#t~post42#1, t_funThread3of3ForFork0_good_#t~nondet43#1][63], [30#L956-7true, Black: 257#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L950-2true, Black: 294#(= |#race~f~0| |ULTIMATE.start_main_#t~nondet49#1|), Black: 260#true, 28#t_funEXITtrue, t_funThread1of3ForFork0InUse, 344#(< |ULTIMATE.start_main_~i~0#1| 10000), 266#true, t_funThread2of3ForFork0InUse, t_funThread3of3ForFork0InUse, 163#L941true]) [2023-08-25 04:07:31,560 INFO L294 olderBase$Statistics]: this new event has 46 ancestors and is cut-off event [2023-08-25 04:07:31,560 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-25 04:07:31,560 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-25 04:07:31,560 INFO L297 olderBase$Statistics]: existing Event has 46 ancestors and is cut-off event [2023-08-25 04:07:32,951 INFO L124 PetriNetUnfolderBase]: 23462/41726 cut-off events. [2023-08-25 04:07:32,951 INFO L125 PetriNetUnfolderBase]: For 16807/16900 co-relation queries the response was YES. [2023-08-25 04:07:33,046 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91401 conditions, 41726 events. 23462/41726 cut-off events. For 16807/16900 co-relation queries the response was YES. Maximal size of possible extension queue 892. Compared 368624 event pairs, 2700 based on Foata normal form. 3533/43649 useless extension candidates. Maximal degree in co-relation 91392. Up to 23649 conditions per place. [2023-08-25 04:07:33,188 INFO L140 encePairwiseOnDemand]: 436/439 looper letters, 122 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2023-08-25 04:07:33,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 177 transitions, 685 flow [2023-08-25 04:07:33,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-25 04:07:33,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-25 04:07:33,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1524 transitions. [2023-08-25 04:07:33,192 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5785876993166287 [2023-08-25 04:07:33,192 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1524 transitions. [2023-08-25 04:07:33,192 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1524 transitions. [2023-08-25 04:07:33,193 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:07:33,193 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1524 transitions. [2023-08-25 04:07:33,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 254.0) internal successors, (1524), 6 states have internal predecessors, (1524), 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) [2023-08-25 04:07:33,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 439.0) internal successors, (3073), 7 states have internal predecessors, (3073), 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) [2023-08-25 04:07:33,200 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 439.0) internal successors, (3073), 7 states have internal predecessors, (3073), 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) [2023-08-25 04:07:33,200 INFO L175 Difference]: Start difference. First operand has 128 places, 132 transitions, 391 flow. Second operand 6 states and 1524 transitions. [2023-08-25 04:07:33,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 177 transitions, 685 flow [2023-08-25 04:07:33,222 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 177 transitions, 657 flow, removed 14 selfloop flow, removed 1 redundant places. [2023-08-25 04:07:33,224 INFO L231 Difference]: Finished difference. Result has 109 places, 97 transitions, 243 flow [2023-08-25 04:07:33,224 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=104, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=243, PETRI_PLACES=109, PETRI_TRANSITIONS=97} [2023-08-25 04:07:33,225 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, -15 predicate places. [2023-08-25 04:07:33,225 INFO L495 AbstractCegarLoop]: Abstraction has has 109 places, 97 transitions, 243 flow [2023-08-25 04:07:33,226 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 235.71428571428572) internal successors, (1650), 7 states have internal predecessors, (1650), 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) [2023-08-25 04:07:33,226 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:07:33,226 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-25 04:07:33,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-25 04:07:33,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-25 04:07:33,431 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-25 04:07:33,432 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:07:33,432 INFO L85 PathProgramCache]: Analyzing trace with hash 272308485, now seen corresponding path program 1 times [2023-08-25 04:07:33,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:07:33,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429341157] [2023-08-25 04:07:33,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:07:33,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:07:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:07:33,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:07:33,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:07:33,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429341157] [2023-08-25 04:07:33,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429341157] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:07:33,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:07:33,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:07:33,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816623636] [2023-08-25 04:07:33,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:07:33,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:07:33,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:07:33,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:07:33,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:07:33,491 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 439 [2023-08-25 04:07:33,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 97 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 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) [2023-08-25 04:07:33,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:07:33,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 439 [2023-08-25 04:07:33,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-25 04:07:43,791 INFO L124 PetriNetUnfolderBase]: 108903/168793 cut-off events. [2023-08-25 04:07:43,791 INFO L125 PetriNetUnfolderBase]: For 50156/50156 co-relation queries the response was YES. [2023-08-25 04:07:44,180 INFO L83 FinitePrefix]: Finished finitePrefix Result has 359350 conditions, 168793 events. 108903/168793 cut-off events. For 50156/50156 co-relation queries the response was YES. Maximal size of possible extension queue 3131. Compared 1432048 event pairs, 55186 based on Foata normal form. 0/148532 useless extension candidates. Maximal degree in co-relation 359341. Up to 91734 conditions per place. [2023-08-25 04:07:44,765 INFO L140 encePairwiseOnDemand]: 415/439 looper letters, 111 selfloop transitions, 18 changer transitions 0/157 dead transitions. [2023-08-25 04:07:44,765 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 157 transitions, 645 flow [2023-08-25 04:07:44,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-25 04:07:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-25 04:07:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 736 transitions. [2023-08-25 04:07:44,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5588458618071375 [2023-08-25 04:07:44,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 736 transitions. [2023-08-25 04:07:44,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 736 transitions. [2023-08-25 04:07:44,768 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-25 04:07:44,768 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 736 transitions. [2023-08-25 04:07:44,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 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) [2023-08-25 04:07:44,771 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:07:44,772 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 439.0) internal successors, (1756), 4 states have internal predecessors, (1756), 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) [2023-08-25 04:07:44,772 INFO L175 Difference]: Start difference. First operand has 109 places, 97 transitions, 243 flow. Second operand 3 states and 736 transitions. [2023-08-25 04:07:44,772 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 157 transitions, 645 flow [2023-08-25 04:07:44,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 157 transitions, 630 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-08-25 04:07:44,827 INFO L231 Difference]: Finished difference. Result has 110 places, 115 transitions, 390 flow [2023-08-25 04:07:44,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=439, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=390, PETRI_PLACES=110, PETRI_TRANSITIONS=115} [2023-08-25 04:07:44,827 INFO L281 CegarLoopForPetriNet]: 124 programPoint places, -14 predicate places. [2023-08-25 04:07:44,827 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 115 transitions, 390 flow [2023-08-25 04:07:44,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.0) internal successors, (615), 3 states have internal predecessors, (615), 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) [2023-08-25 04:07:44,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:07:44,828 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2023-08-25 04:07:44,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-25 04:07:44,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2023-08-25 04:07:44,828 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:07:44,828 INFO L85 PathProgramCache]: Analyzing trace with hash 215003598, now seen corresponding path program 1 times [2023-08-25 04:07:44,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:07:44,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848527280] [2023-08-25 04:07:44,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:07:44,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:07:44,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:07:44,844 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-25 04:07:44,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-25 04:07:44,860 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-25 04:07:44,860 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-25 04:07:44,860 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 25 remaining) [2023-08-25 04:07:44,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (23 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (22 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (21 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONASSERT (20 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (19 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (18 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (17 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (16 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (15 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (14 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (13 of 25 remaining) [2023-08-25 04:07:44,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (11 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (10 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (9 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (8 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (6 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (5 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (2 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 25 remaining) [2023-08-25 04:07:44,862 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (0 of 25 remaining) [2023-08-25 04:07:44,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-25 04:07:44,863 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-08-25 04:07:44,863 WARN L233 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2023-08-25 04:07:44,863 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2023-08-25 04:07:44,893 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-25 04:07:44,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 329 transitions, 702 flow [2023-08-25 04:07:45,214 INFO L124 PetriNetUnfolderBase]: 86/832 cut-off events. [2023-08-25 04:07:45,215 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-25 04:07:45,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 832 events. 86/832 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3900 event pairs, 6 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 570. Up to 32 conditions per place. [2023-08-25 04:07:45,219 INFO L82 GeneralOperation]: Start removeDead. Operand has 304 places, 329 transitions, 702 flow [2023-08-25 04:07:45,223 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 304 places, 329 transitions, 702 flow [2023-08-25 04:07:45,223 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-25 04:07:45,223 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 304 places, 329 transitions, 702 flow [2023-08-25 04:07:45,224 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 304 places, 329 transitions, 702 flow [2023-08-25 04:07:45,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 304 places, 329 transitions, 702 flow [2023-08-25 04:07:45,318 INFO L124 PetriNetUnfolderBase]: 86/832 cut-off events. [2023-08-25 04:07:45,318 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2023-08-25 04:07:45,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 887 conditions, 832 events. 86/832 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3900 event pairs, 6 based on Foata normal form. 0/695 useless extension candidates. Maximal degree in co-relation 570. Up to 32 conditions per place. [2023-08-25 04:07:45,368 INFO L119 LiptonReduction]: Number of co-enabled transitions 67760 [2023-08-25 04:07:48,718 INFO L134 LiptonReduction]: Checked pairs total: 286515 [2023-08-25 04:07:48,718 INFO L136 LiptonReduction]: Total number of compositions: 188 [2023-08-25 04:07:48,720 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-25 04:07:48,720 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@3f0c1880, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-25 04:07:48,720 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2023-08-25 04:07:48,721 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-08-25 04:07:48,721 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2023-08-25 04:07:48,722 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-08-25 04:07:48,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-25 04:07:48,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-25 04:07:48,722 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2023-08-25 04:07:48,722 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-25 04:07:48,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1960066432, now seen corresponding path program 1 times [2023-08-25 04:07:48,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-25 04:07:48,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153780934] [2023-08-25 04:07:48,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-25 04:07:48,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-25 04:07:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-25 04:07:48,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-25 04:07:48,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-25 04:07:48,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153780934] [2023-08-25 04:07:48,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153780934] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-25 04:07:48,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-25 04:07:48,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-25 04:07:48,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879984706] [2023-08-25 04:07:48,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-25 04:07:48,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-25 04:07:48,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-25 04:07:48,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-25 04:07:48,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-25 04:07:48,750 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 282 out of 517 [2023-08-25 04:07:48,751 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 179 transitions, 402 flow. Second operand has 3 states, 3 states have (on average 283.0) internal successors, (849), 3 states have internal predecessors, (849), 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) [2023-08-25 04:07:48,751 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-25 04:07:48,751 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 282 of 517 [2023-08-25 04:07:48,751 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand