./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:48:27,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:48:27,556 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-13 09:48:27,561 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:48:27,563 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:48:27,584 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:48:27,584 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:48:27,584 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:48:27,585 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:48:27,586 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:48:27,586 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:48:27,586 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:48:27,587 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:48:27,587 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:48:27,587 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:48:27,587 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:48:27,588 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:48:27,588 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:48:27,588 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:48:27,591 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:48:27,591 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:48:27,591 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:48:27,592 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-13 09:48:27,592 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:48:27,592 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 09:48:27,592 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:48:27,592 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:48:27,592 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:48:27,593 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:48:27,593 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:48:27,593 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:48:27,593 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:48:27,593 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:48:27,593 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:48:27,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:48:27,594 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:48:27,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:48:27,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:48:27,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:48:27,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:48:27,595 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:48:27,595 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 [2024-10-13 09:48:27,779 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:48:27,797 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:48:27,799 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:48:27,800 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:48:27,801 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:48:27,801 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-10-13 09:48:29,016 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:48:29,218 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:48:29,219 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-10-13 09:48:29,232 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0249d7aa3/15bb229e72c54ee3a75c35cb59c8a5d3/FLAG562ab42b2 [2024-10-13 09:48:29,243 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0249d7aa3/15bb229e72c54ee3a75c35cb59c8a5d3 [2024-10-13 09:48:29,245 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:48:29,246 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:48:29,248 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:48:29,248 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:48:29,253 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:48:29,254 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,254 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ad7afb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29, skipping insertion in model container [2024-10-13 09:48:29,254 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:48:29,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:48:29,606 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:48:29,642 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:48:29,673 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:48:29,674 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29 WrapperNode [2024-10-13 09:48:29,674 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:48:29,675 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:48:29,675 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:48:29,675 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:48:29,680 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,691 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,711 INFO L138 Inliner]: procedures = 171, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 108 [2024-10-13 09:48:29,713 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:48:29,714 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:48:29,714 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:48:29,714 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:48:29,720 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,722 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,725 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,733 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,734 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,735 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,736 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:48:29,740 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:48:29,740 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:48:29,740 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:48:29,740 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (1/1) ... [2024-10-13 09:48:29,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:48:29,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:48:29,762 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:48:29,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:48:29,794 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-10-13 09:48:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-10-13 09:48:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-10-13 09:48:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-10-13 09:48:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-13 09:48:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:48:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-13 09:48:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-13 09:48:29,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:48:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:48:29,796 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-13 09:48:29,886 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:48:29,887 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:48:30,022 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-13 09:48:30,022 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:48:30,043 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:48:30,043 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 09:48:30,044 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:48:30 BoogieIcfgContainer [2024-10-13 09:48:30,044 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:48:30,046 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:48:30,046 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:48:30,048 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:48:30,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:48:29" (1/3) ... [2024-10-13 09:48:30,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ea23c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:48:30, skipping insertion in model container [2024-10-13 09:48:30,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:48:29" (2/3) ... [2024-10-13 09:48:30,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51ea23c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:48:30, skipping insertion in model container [2024-10-13 09:48:30,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:48:30" (3/3) ... [2024-10-13 09:48:30,050 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2024-10-13 09:48:30,062 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:48:30,062 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-10-13 09:48:30,063 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-13 09:48:30,114 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:48:30,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 138 transitions, 284 flow [2024-10-13 09:48:30,187 INFO L124 PetriNetUnfolderBase]: 8/152 cut-off events. [2024-10-13 09:48:30,187 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:48:30,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 152 events. 8/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 4 conditions per place. [2024-10-13 09:48:30,192 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 138 transitions, 284 flow [2024-10-13 09:48:30,196 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 281 flow [2024-10-13 09:48:30,203 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:48:30,207 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b7328b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:48:30,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-10-13 09:48:30,214 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:48:30,215 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-13 09:48:30,215 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:48:30,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:30,216 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:30,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:48:30,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:30,220 INFO L85 PathProgramCache]: Analyzing trace with hash 318874204, now seen corresponding path program 1 times [2024-10-13 09:48:30,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:30,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857845907] [2024-10-13 09:48:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:30,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:30,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:30,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:30,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857845907] [2024-10-13 09:48:30,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857845907] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:30,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:30,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:30,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704495639] [2024-10-13 09:48:30,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:30,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:30,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:30,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:30,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:30,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-10-13 09:48:30,487 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 137 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2024-10-13 09:48:30,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:30,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-10-13 09:48:30,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:30,623 INFO L124 PetriNetUnfolderBase]: 23/314 cut-off events. [2024-10-13 09:48:30,623 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:48:30,625 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 314 events. 23/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1248 event pairs, 19 based on Foata normal form. 38/300 useless extension candidates. Maximal degree in co-relation 304. Up to 47 conditions per place. [2024-10-13 09:48:30,629 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 11 selfloop transitions, 2 changer transitions 1/129 dead transitions. [2024-10-13 09:48:30,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 291 flow [2024-10-13 09:48:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-10-13 09:48:30,642 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-10-13 09:48:30,644 INFO L175 Difference]: Start difference. First operand has 136 places, 137 transitions, 281 flow. Second operand 3 states and 373 transitions. [2024-10-13 09:48:30,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 291 flow [2024-10-13 09:48:30,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:48:30,652 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 266 flow [2024-10-13 09:48:30,654 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2024-10-13 09:48:30,658 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-10-13 09:48:30,658 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 266 flow [2024-10-13 09:48:30,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 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) [2024-10-13 09:48:30,659 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:30,659 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:30,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:48:30,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:48:30,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:30,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1708883970, now seen corresponding path program 1 times [2024-10-13 09:48:30,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:30,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057278460] [2024-10-13 09:48:30,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:30,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:30,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:30,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:30,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057278460] [2024-10-13 09:48:30,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057278460] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:30,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:30,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:30,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376825493] [2024-10-13 09:48:30,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:30,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:30,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:30,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:30,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:30,787 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-10-13 09:48:30,788 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2024-10-13 09:48:30,788 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:30,788 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-10-13 09:48:30,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:30,843 INFO L124 PetriNetUnfolderBase]: 28/394 cut-off events. [2024-10-13 09:48:30,844 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:48:30,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1722 event pairs, 26 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 436. Up to 62 conditions per place. [2024-10-13 09:48:30,849 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 13 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-10-13 09:48:30,849 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 294 flow [2024-10-13 09:48:30,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:30,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-10-13 09:48:30,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2024-10-13 09:48:30,854 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 266 flow. Second operand 3 states and 364 transitions. [2024-10-13 09:48:30,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 294 flow [2024-10-13 09:48:30,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:30,857 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 264 flow [2024-10-13 09:48:30,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-10-13 09:48:30,858 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2024-10-13 09:48:30,858 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 264 flow [2024-10-13 09:48:30,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 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) [2024-10-13 09:48:30,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:30,859 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:30,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:48:30,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:48:30,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:30,860 INFO L85 PathProgramCache]: Analyzing trace with hash -197903269, now seen corresponding path program 1 times [2024-10-13 09:48:30,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:30,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807484454] [2024-10-13 09:48:30,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:30,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:30,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:30,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:30,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807484454] [2024-10-13 09:48:30,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807484454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:30,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:30,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:30,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579796693] [2024-10-13 09:48:30,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:30,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:30,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:30,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:30,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:30,936 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2024-10-13 09:48:30,936 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2024-10-13 09:48:30,936 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:30,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2024-10-13 09:48:30,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:30,984 INFO L124 PetriNetUnfolderBase]: 68/518 cut-off events. [2024-10-13 09:48:30,986 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-13 09:48:30,987 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 518 events. 68/518 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2788 event pairs, 58 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 609. Up to 116 conditions per place. [2024-10-13 09:48:30,989 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-10-13 09:48:30,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 284 flow [2024-10-13 09:48:30,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:30,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:30,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-10-13 09:48:30,990 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2024-10-13 09:48:30,991 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 264 flow. Second operand 3 states and 356 transitions. [2024-10-13 09:48:30,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 284 flow [2024-10-13 09:48:30,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:30,994 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2024-10-13 09:48:30,995 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2024-10-13 09:48:30,996 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-10-13 09:48:30,996 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2024-10-13 09:48:30,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 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) [2024-10-13 09:48:30,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:30,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:30,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:48:30,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:48:30,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:30,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1810485791, now seen corresponding path program 1 times [2024-10-13 09:48:30,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:30,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499522206] [2024-10-13 09:48:30,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:30,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:31,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:31,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499522206] [2024-10-13 09:48:31,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499522206] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:31,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:31,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:31,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394796714] [2024-10-13 09:48:31,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:31,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:31,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:31,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:31,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:31,087 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2024-10-13 09:48:31,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2024-10-13 09:48:31,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:31,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2024-10-13 09:48:31,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:31,121 INFO L124 PetriNetUnfolderBase]: 17/278 cut-off events. [2024-10-13 09:48:31,122 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-13 09:48:31,122 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 278 events. 17/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 883 event pairs, 6 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 296. Up to 32 conditions per place. [2024-10-13 09:48:31,123 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2024-10-13 09:48:31,123 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 299 flow [2024-10-13 09:48:31,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:31,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:31,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-10-13 09:48:31,125 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2024-10-13 09:48:31,125 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 379 transitions. [2024-10-13 09:48:31,125 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 299 flow [2024-10-13 09:48:31,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:48:31,128 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 279 flow [2024-10-13 09:48:31,128 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2024-10-13 09:48:31,129 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -7 predicate places. [2024-10-13 09:48:31,129 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 279 flow [2024-10-13 09:48:31,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2024-10-13 09:48:31,130 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:31,130 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:48:31,131 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:48:31,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:31,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1295306118, now seen corresponding path program 1 times [2024-10-13 09:48:31,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:31,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584802006] [2024-10-13 09:48:31,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:31,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:31,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:31,285 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-10-13 09:48:31,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:31,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584802006] [2024-10-13 09:48:31,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584802006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:31,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:48:31,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485223380] [2024-10-13 09:48:31,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:31,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:48:31,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:31,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:48:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:48:31,315 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2024-10-13 09:48:31,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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) [2024-10-13 09:48:31,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:31,317 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2024-10-13 09:48:31,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:31,383 INFO L124 PetriNetUnfolderBase]: 12/280 cut-off events. [2024-10-13 09:48:31,383 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-10-13 09:48:31,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 280 events. 12/280 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 916 event pairs, 8 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 325. Up to 34 conditions per place. [2024-10-13 09:48:31,384 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 16 selfloop transitions, 0 changer transitions 4/127 dead transitions. [2024-10-13 09:48:31,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 325 flow [2024-10-13 09:48:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:48:31,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 09:48:31,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2024-10-13 09:48:31,386 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2024-10-13 09:48:31,386 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 279 flow. Second operand 5 states and 591 transitions. [2024-10-13 09:48:31,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 325 flow [2024-10-13 09:48:31,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:31,391 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 275 flow [2024-10-13 09:48:31,391 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2024-10-13 09:48:31,392 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-10-13 09:48:31,392 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 275 flow [2024-10-13 09:48:31,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 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) [2024-10-13 09:48:31,394 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:31,394 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:31,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:48:31,394 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-13 09:48:31,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:31,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1292053806, now seen corresponding path program 1 times [2024-10-13 09:48:31,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:31,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873542392] [2024-10-13 09:48:31,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:31,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:48:31,417 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:48:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:48:31,460 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:48:31,460 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:48:31,461 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2024-10-13 09:48:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2024-10-13 09:48:31,462 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2024-10-13 09:48:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2024-10-13 09:48:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2024-10-13 09:48:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2024-10-13 09:48:31,463 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2024-10-13 09:48:31,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2024-10-13 09:48:31,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2024-10-13 09:48:31,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2024-10-13 09:48:31,464 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2024-10-13 09:48:31,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2024-10-13 09:48:31,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2024-10-13 09:48:31,465 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2024-10-13 09:48:31,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2024-10-13 09:48:31,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2024-10-13 09:48:31,467 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2024-10-13 09:48:31,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:48:31,468 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-13 09:48:31,472 WARN L239 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:48:31,472 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-10-13 09:48:31,504 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:48:31,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 408 flow [2024-10-13 09:48:31,525 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-10-13 09:48:31,525 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-13 09:48:31,527 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 365 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 213. Up to 6 conditions per place. [2024-10-13 09:48:31,527 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 194 transitions, 408 flow [2024-10-13 09:48:31,528 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 171 transitions, 355 flow [2024-10-13 09:48:31,529 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:48:31,530 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b7328b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:48:31,530 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-10-13 09:48:31,532 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:48:31,532 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-13 09:48:31,532 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:48:31,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:31,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:31,532 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:48:31,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:31,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1484849122, now seen corresponding path program 1 times [2024-10-13 09:48:31,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:31,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554928008] [2024-10-13 09:48:31,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:31,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:31,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554928008] [2024-10-13 09:48:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554928008] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:31,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:31,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222559974] [2024-10-13 09:48:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:31,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:31,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:31,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:31,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2024-10-13 09:48:31,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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) [2024-10-13 09:48:31,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:31,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2024-10-13 09:48:31,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:31,688 INFO L124 PetriNetUnfolderBase]: 216/1072 cut-off events. [2024-10-13 09:48:31,688 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-13 09:48:31,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1072 events. 216/1072 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7354 event pairs, 189 based on Foata normal form. 226/1128 useless extension candidates. Maximal degree in co-relation 1362. Up to 317 conditions per place. [2024-10-13 09:48:31,698 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 16 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2024-10-13 09:48:31,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 373 flow [2024-10-13 09:48:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:31,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:31,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-10-13 09:48:31,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2024-10-13 09:48:31,700 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 355 flow. Second operand 3 states and 514 transitions. [2024-10-13 09:48:31,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 373 flow [2024-10-13 09:48:31,701 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:48:31,720 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2024-10-13 09:48:31,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2024-10-13 09:48:31,721 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2024-10-13 09:48:31,722 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2024-10-13 09:48:31,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 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) [2024-10-13 09:48:31,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:31,723 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:31,723 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:48:31,723 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:48:31,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:31,724 INFO L85 PathProgramCache]: Analyzing trace with hash 754326784, now seen corresponding path program 1 times [2024-10-13 09:48:31,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:31,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466396199] [2024-10-13 09:48:31,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:31,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:31,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:31,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466396199] [2024-10-13 09:48:31,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466396199] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:31,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:31,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:31,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000104315] [2024-10-13 09:48:31,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:31,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:31,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:31,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:31,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:31,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-10-13 09:48:31,782 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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) [2024-10-13 09:48:31,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:31,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-10-13 09:48:31,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:31,885 INFO L124 PetriNetUnfolderBase]: 205/1268 cut-off events. [2024-10-13 09:48:31,885 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-10-13 09:48:31,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1632 conditions, 1268 events. 205/1268 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 9006 event pairs, 194 based on Foata normal form. 0/1118 useless extension candidates. Maximal degree in co-relation 1598. Up to 326 conditions per place. [2024-10-13 09:48:31,895 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 17 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-10-13 09:48:31,895 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 374 flow [2024-10-13 09:48:31,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:31,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:31,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-10-13 09:48:31,896 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8694158075601375 [2024-10-13 09:48:31,896 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 506 transitions. [2024-10-13 09:48:31,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 374 flow [2024-10-13 09:48:31,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:31,899 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2024-10-13 09:48:31,899 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2024-10-13 09:48:31,900 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2024-10-13 09:48:31,901 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2024-10-13 09:48:31,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 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) [2024-10-13 09:48:31,901 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:31,901 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:31,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:48:31,902 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:48:31,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:31,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1533454557, now seen corresponding path program 1 times [2024-10-13 09:48:31,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:31,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371781706] [2024-10-13 09:48:31,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:31,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:31,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:31,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:31,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371781706] [2024-10-13 09:48:31,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371781706] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:31,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:31,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:31,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487418566] [2024-10-13 09:48:31,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:31,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:31,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:31,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:31,957 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 194 [2024-10-13 09:48:31,958 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2024-10-13 09:48:31,959 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:31,959 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 194 [2024-10-13 09:48:31,959 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:32,128 INFO L124 PetriNetUnfolderBase]: 590/2395 cut-off events. [2024-10-13 09:48:32,130 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-10-13 09:48:32,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3247 conditions, 2395 events. 590/2395 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 19525 event pairs, 508 based on Foata normal form. 0/2106 useless extension candidates. Maximal degree in co-relation 3206. Up to 791 conditions per place. [2024-10-13 09:48:32,146 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 19 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2024-10-13 09:48:32,147 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 364 flow [2024-10-13 09:48:32,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2024-10-13 09:48:32,148 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2024-10-13 09:48:32,149 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 488 transitions. [2024-10-13 09:48:32,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 364 flow [2024-10-13 09:48:32,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:32,151 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2024-10-13 09:48:32,152 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2024-10-13 09:48:32,153 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -10 predicate places. [2024-10-13 09:48:32,154 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2024-10-13 09:48:32,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 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) [2024-10-13 09:48:32,154 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:32,154 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:32,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:48:32,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:48:32,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:32,155 INFO L85 PathProgramCache]: Analyzing trace with hash 874493411, now seen corresponding path program 1 times [2024-10-13 09:48:32,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:32,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613306666] [2024-10-13 09:48:32,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:32,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:32,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:32,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:32,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613306666] [2024-10-13 09:48:32,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613306666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:32,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:32,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:32,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948421891] [2024-10-13 09:48:32,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:32,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:32,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:32,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:32,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:32,214 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 194 [2024-10-13 09:48:32,215 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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) [2024-10-13 09:48:32,215 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:32,215 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 194 [2024-10-13 09:48:32,215 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:32,334 INFO L124 PetriNetUnfolderBase]: 347/1375 cut-off events. [2024-10-13 09:48:32,335 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-10-13 09:48:32,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1375 events. 347/1375 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9674 event pairs, 117 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 2016. Up to 382 conditions per place. [2024-10-13 09:48:32,343 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 25 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2024-10-13 09:48:32,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 424 flow [2024-10-13 09:48:32,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:32,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2024-10-13 09:48:32,344 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2024-10-13 09:48:32,345 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 519 transitions. [2024-10-13 09:48:32,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 424 flow [2024-10-13 09:48:32,345 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:48:32,347 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2024-10-13 09:48:32,347 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2024-10-13 09:48:32,348 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -7 predicate places. [2024-10-13 09:48:32,348 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2024-10-13 09:48:32,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 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) [2024-10-13 09:48:32,348 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:32,348 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:32,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:48:32,349 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:48:32,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:32,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1452864569, now seen corresponding path program 1 times [2024-10-13 09:48:32,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:32,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856885977] [2024-10-13 09:48:32,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:32,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:32,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:32,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:32,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856885977] [2024-10-13 09:48:32,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856885977] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:32,400 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:32,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:32,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629816410] [2024-10-13 09:48:32,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:32,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:32,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:32,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:32,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:32,432 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2024-10-13 09:48:32,433 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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) [2024-10-13 09:48:32,433 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:32,433 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2024-10-13 09:48:32,433 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:32,606 INFO L124 PetriNetUnfolderBase]: 447/1925 cut-off events. [2024-10-13 09:48:32,607 INFO L125 PetriNetUnfolderBase]: For 612/632 co-relation queries the response was YES. [2024-10-13 09:48:32,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1925 events. 447/1925 cut-off events. For 612/632 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15444 event pairs, 158 based on Foata normal form. 2/1715 useless extension candidates. Maximal degree in co-relation 3321. Up to 585 conditions per place. [2024-10-13 09:48:32,623 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 23 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2024-10-13 09:48:32,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 502 flow [2024-10-13 09:48:32,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:32,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:32,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2024-10-13 09:48:32,625 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8951890034364262 [2024-10-13 09:48:32,625 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 521 transitions. [2024-10-13 09:48:32,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 502 flow [2024-10-13 09:48:32,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 173 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:32,631 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2024-10-13 09:48:32,632 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2024-10-13 09:48:32,633 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -5 predicate places. [2024-10-13 09:48:32,633 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2024-10-13 09:48:32,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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) [2024-10-13 09:48:32,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:32,634 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:32,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:48:32,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:48:32,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash 930759383, now seen corresponding path program 1 times [2024-10-13 09:48:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:32,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821361446] [2024-10-13 09:48:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:32,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:32,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:32,712 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-10-13 09:48:32,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:32,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821361446] [2024-10-13 09:48:32,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821361446] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:32,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:32,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:48:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629559116] [2024-10-13 09:48:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:32,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:48:32,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:32,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:48:32,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:48:32,739 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-10-13 09:48:32,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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) [2024-10-13 09:48:32,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:32,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-10-13 09:48:32,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:32,882 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([535] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread2of2ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of2ForFork1_#t~ret6#1=|v_thr2Thread2of2ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of2ForFork1_#t~ret6#1][153], [Black: 205#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 190#true, 210#true, 21#L705-2true, 192#true, 168#L705-2true, 36#$Ultimate##0true, 43#L714-4true, 215#true, 204#(= |#race~n~0| 0), 188#true]) [2024-10-13 09:48:32,882 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-10-13 09:48:32,882 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-10-13 09:48:32,882 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-13 09:48:32,882 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-13 09:48:32,970 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([568] L702-4-->L705-2: Formula: (and (= |v_thr2Thread1of2ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of2ForFork1_#t~ret6#1=|v_thr2Thread1of2ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of2ForFork1_#t~ret6#1][125], [Black: 205#true, 60#L-1-4true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 190#true, 210#true, 21#L705-2true, 192#true, 168#L705-2true, 36#$Ultimate##0true, 215#true, 204#(= |#race~n~0| 0), 188#true]) [2024-10-13 09:48:32,971 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-13 09:48:32,971 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:32,971 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:32,971 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-13 09:48:32,993 INFO L124 PetriNetUnfolderBase]: 540/2956 cut-off events. [2024-10-13 09:48:32,993 INFO L125 PetriNetUnfolderBase]: For 548/791 co-relation queries the response was YES. [2024-10-13 09:48:33,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 2956 events. 540/2956 cut-off events. For 548/791 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 27757 event pairs, 215 based on Foata normal form. 1/2597 useless extension candidates. Maximal degree in co-relation 4700. Up to 443 conditions per place. [2024-10-13 09:48:33,008 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 19 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2024-10-13 09:48:33,008 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 513 flow [2024-10-13 09:48:33,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:48:33,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 09:48:33,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2024-10-13 09:48:33,010 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8597938144329897 [2024-10-13 09:48:33,010 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 834 transitions. [2024-10-13 09:48:33,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 513 flow [2024-10-13 09:48:33,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:33,015 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2024-10-13 09:48:33,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=170, PETRI_TRANSITIONS=169} [2024-10-13 09:48:33,015 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, 0 predicate places. [2024-10-13 09:48:33,015 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2024-10-13 09:48:33,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 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) [2024-10-13 09:48:33,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:33,016 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:33,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:48:33,016 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-10-13 09:48:33,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:33,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1137224819, now seen corresponding path program 1 times [2024-10-13 09:48:33,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:33,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83132016] [2024-10-13 09:48:33,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:33,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:48:33,028 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:48:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:48:33,046 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:48:33,046 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:48:33,049 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-10-13 09:48:33,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-10-13 09:48:33,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-10-13 09:48:33,049 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-10-13 09:48:33,050 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-10-13 09:48:33,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-10-13 09:48:33,051 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-10-13 09:48:33,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:48:33,051 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:33,051 WARN L239 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-10-13 09:48:33,051 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-10-13 09:48:33,084 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-10-13 09:48:33,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 250 transitions, 536 flow [2024-10-13 09:48:33,102 INFO L124 PetriNetUnfolderBase]: 14/260 cut-off events. [2024-10-13 09:48:33,102 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-10-13 09:48:33,103 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 260 events. 14/260 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 533 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 271. Up to 8 conditions per place. [2024-10-13 09:48:33,103 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 250 transitions, 536 flow [2024-10-13 09:48:33,105 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 205 transitions, 431 flow [2024-10-13 09:48:33,105 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:48:33,106 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5b7328b5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:48:33,106 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-10-13 09:48:33,107 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-13 09:48:33,107 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-10-13 09:48:33,107 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-13 09:48:33,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:33,107 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:33,107 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-13 09:48:33,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:33,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1636960792, now seen corresponding path program 1 times [2024-10-13 09:48:33,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:33,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623329341] [2024-10-13 09:48:33,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:33,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:33,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:33,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:33,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:33,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623329341] [2024-10-13 09:48:33,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1623329341] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:33,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:33,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:33,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135624419] [2024-10-13 09:48:33,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:33,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:33,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:33,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:33,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:33,162 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-10-13 09:48:33,163 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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) [2024-10-13 09:48:33,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:33,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-10-13 09:48:33,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:33,649 INFO L124 PetriNetUnfolderBase]: 1589/4910 cut-off events. [2024-10-13 09:48:33,649 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2024-10-13 09:48:33,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7220 conditions, 4910 events. 1589/4910 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 44703 event pairs, 1439 based on Foata normal form. 1274/5496 useless extension candidates. Maximal degree in co-relation 7150. Up to 2067 conditions per place. [2024-10-13 09:48:33,689 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 21 selfloop transitions, 2 changer transitions 1/195 dead transitions. [2024-10-13 09:48:33,690 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 195 transitions, 457 flow [2024-10-13 09:48:33,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:33,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:33,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-10-13 09:48:33,691 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2024-10-13 09:48:33,692 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 431 flow. Second operand 3 states and 655 transitions. [2024-10-13 09:48:33,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 195 transitions, 457 flow [2024-10-13 09:48:33,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 454 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-13 09:48:33,695 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2024-10-13 09:48:33,696 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2024-10-13 09:48:33,696 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -2 predicate places. [2024-10-13 09:48:33,696 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2024-10-13 09:48:33,697 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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) [2024-10-13 09:48:33,697 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:33,697 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:33,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:48:33,697 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-13 09:48:33,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:33,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1183330618, now seen corresponding path program 1 times [2024-10-13 09:48:33,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:33,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895814926] [2024-10-13 09:48:33,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:33,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:33,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:33,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:33,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895814926] [2024-10-13 09:48:33,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895814926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:33,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:33,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:33,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573522304] [2024-10-13 09:48:33,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:33,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:33,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:33,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:33,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:33,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-10-13 09:48:33,752 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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) [2024-10-13 09:48:33,752 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:33,752 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-10-13 09:48:33,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:34,460 INFO L124 PetriNetUnfolderBase]: 1197/5332 cut-off events. [2024-10-13 09:48:34,460 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2024-10-13 09:48:34,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 5332 events. 1197/5332 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 52785 event pairs, 1154 based on Foata normal form. 0/4734 useless extension candidates. Maximal degree in co-relation 7102. Up to 1670 conditions per place. [2024-10-13 09:48:34,495 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 21 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2024-10-13 09:48:34,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 193 transitions, 454 flow [2024-10-13 09:48:34,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:34,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:34,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-10-13 09:48:34,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.864 [2024-10-13 09:48:34,502 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 648 transitions. [2024-10-13 09:48:34,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 193 transitions, 454 flow [2024-10-13 09:48:34,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 193 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:34,506 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 408 flow [2024-10-13 09:48:34,506 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2024-10-13 09:48:34,506 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -4 predicate places. [2024-10-13 09:48:34,506 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 408 flow [2024-10-13 09:48:34,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 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) [2024-10-13 09:48:34,507 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:34,507 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:34,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:48:34,507 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-13 09:48:34,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:34,507 INFO L85 PathProgramCache]: Analyzing trace with hash 2037743255, now seen corresponding path program 1 times [2024-10-13 09:48:34,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:34,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851138083] [2024-10-13 09:48:34,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:34,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:34,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:34,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851138083] [2024-10-13 09:48:34,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851138083] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:34,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:34,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:34,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980816319] [2024-10-13 09:48:34,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:34,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:34,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:34,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:34,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:34,564 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2024-10-13 09:48:34,565 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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) [2024-10-13 09:48:34,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:34,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2024-10-13 09:48:34,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:35,719 INFO L124 PetriNetUnfolderBase]: 4181/12619 cut-off events. [2024-10-13 09:48:35,719 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2024-10-13 09:48:35,759 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17972 conditions, 12619 events. 4181/12619 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 133571 event pairs, 3658 based on Foata normal form. 0/10992 useless extension candidates. Maximal degree in co-relation 17930. Up to 5066 conditions per place. [2024-10-13 09:48:35,813 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 24 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2024-10-13 09:48:35,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 444 flow [2024-10-13 09:48:35,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:35,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-10-13 09:48:35,815 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2024-10-13 09:48:35,815 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 408 flow. Second operand 3 states and 620 transitions. [2024-10-13 09:48:35,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 444 flow [2024-10-13 09:48:35,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:35,819 INFO L231 Difference]: Finished difference. Result has 193 places, 186 transitions, 392 flow [2024-10-13 09:48:35,819 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=193, PETRI_TRANSITIONS=186} [2024-10-13 09:48:35,819 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -11 predicate places. [2024-10-13 09:48:35,819 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 392 flow [2024-10-13 09:48:35,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 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) [2024-10-13 09:48:35,820 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:35,820 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:35,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:48:35,820 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-13 09:48:35,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:35,821 INFO L85 PathProgramCache]: Analyzing trace with hash 127606184, now seen corresponding path program 1 times [2024-10-13 09:48:35,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:35,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916668018] [2024-10-13 09:48:35,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:35,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:35,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:35,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:35,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:35,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916668018] [2024-10-13 09:48:35,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916668018] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:35,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:35,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823399810] [2024-10-13 09:48:35,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:35,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:35,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:35,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:35,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:35,878 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 250 [2024-10-13 09:48:35,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 186 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2024-10-13 09:48:35,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:35,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 250 [2024-10-13 09:48:35,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:37,201 INFO L124 PetriNetUnfolderBase]: 4747/12923 cut-off events. [2024-10-13 09:48:37,201 INFO L125 PetriNetUnfolderBase]: For 840/840 co-relation queries the response was YES. [2024-10-13 09:48:37,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20480 conditions, 12923 events. 4747/12923 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 135251 event pairs, 1658 based on Foata normal form. 0/11283 useless extension candidates. Maximal degree in co-relation 20438. Up to 4100 conditions per place. [2024-10-13 09:48:37,286 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 35 selfloop transitions, 11 changer transitions 0/206 dead transitions. [2024-10-13 09:48:37,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 206 transitions, 537 flow [2024-10-13 09:48:37,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:37,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2024-10-13 09:48:37,288 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8746666666666667 [2024-10-13 09:48:37,288 INFO L175 Difference]: Start difference. First operand has 193 places, 186 transitions, 392 flow. Second operand 3 states and 656 transitions. [2024-10-13 09:48:37,288 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 206 transitions, 537 flow [2024-10-13 09:48:37,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 206 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-13 09:48:37,292 INFO L231 Difference]: Finished difference. Result has 196 places, 197 transitions, 487 flow [2024-10-13 09:48:37,293 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=196, PETRI_TRANSITIONS=197} [2024-10-13 09:48:37,293 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -8 predicate places. [2024-10-13 09:48:37,293 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 487 flow [2024-10-13 09:48:37,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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) [2024-10-13 09:48:37,294 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:37,294 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:37,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:48:37,294 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-13 09:48:37,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash 719291507, now seen corresponding path program 1 times [2024-10-13 09:48:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:37,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86994605] [2024-10-13 09:48:37,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:37,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:37,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:37,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:37,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86994605] [2024-10-13 09:48:37,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86994605] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:37,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:48:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128821122] [2024-10-13 09:48:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:37,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:48:37,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:37,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:48:37,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:48:37,357 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-10-13 09:48:37,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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) [2024-10-13 09:48:37,358 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:37,358 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-10-13 09:48:37,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:38,564 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][122], [113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 244#true, 242#true]) [2024-10-13 09:48:38,564 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-10-13 09:48:38,564 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-13 09:48:38,564 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:48:38,564 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-13 09:48:38,587 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 132#L700-3true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:38,587 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:48:38,587 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:38,587 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:48:38,587 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:48:38,910 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][212], [24#L694-1true, 132#L700-3true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 192#L703-4true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true]) [2024-10-13 09:48:38,910 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-13 09:48:38,910 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:48:38,910 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:48:38,910 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:48:39,172 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:39,172 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:48:39,172 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:39,172 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:39,172 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:39,245 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][202], [130#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 192#L703-4true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:39,246 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-13 09:48:39,246 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-13 09:48:39,246 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-13 09:48:39,246 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-13 09:48:39,403 INFO L124 PetriNetUnfolderBase]: 6575/18065 cut-off events. [2024-10-13 09:48:39,403 INFO L125 PetriNetUnfolderBase]: For 7625/8178 co-relation queries the response was YES. [2024-10-13 09:48:39,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35123 conditions, 18065 events. 6575/18065 cut-off events. For 7625/8178 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 202860 event pairs, 2466 based on Foata normal form. 44/15760 useless extension candidates. Maximal degree in co-relation 35080. Up to 7191 conditions per place. [2024-10-13 09:48:39,548 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 33 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2024-10-13 09:48:39,548 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 215 transitions, 657 flow [2024-10-13 09:48:39,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:48:39,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-13 09:48:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2024-10-13 09:48:39,549 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.888 [2024-10-13 09:48:39,549 INFO L175 Difference]: Start difference. First operand has 196 places, 197 transitions, 487 flow. Second operand 3 states and 666 transitions. [2024-10-13 09:48:39,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 215 transitions, 657 flow [2024-10-13 09:48:39,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:39,565 INFO L231 Difference]: Finished difference. Result has 198 places, 209 transitions, 591 flow [2024-10-13 09:48:39,566 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=198, PETRI_TRANSITIONS=209} [2024-10-13 09:48:39,567 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -6 predicate places. [2024-10-13 09:48:39,567 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 591 flow [2024-10-13 09:48:39,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 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) [2024-10-13 09:48:39,568 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:39,568 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:39,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:48:39,568 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-13 09:48:39,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:39,569 INFO L85 PathProgramCache]: Analyzing trace with hash 1139370770, now seen corresponding path program 1 times [2024-10-13 09:48:39,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:39,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236819328] [2024-10-13 09:48:39,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:39,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:39,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:48:39,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:48:39,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:48:39,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236819328] [2024-10-13 09:48:39,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236819328] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:48:39,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:48:39,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:48:39,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519668811] [2024-10-13 09:48:39,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:48:39,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:48:39,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:48:39,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:48:39,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:48:39,656 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-10-13 09:48:39,657 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 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) [2024-10-13 09:48:39,657 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-13 09:48:39,657 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-10-13 09:48:39,657 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-13 09:48:39,845 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 26#L714-4true, 240#true, 243#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 242#true]) [2024-10-13 09:48:39,845 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-10-13 09:48:39,845 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-10-13 09:48:39,845 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-13 09:48:39,845 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-10-13 09:48:40,103 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 67#$Ultimate##0true, 244#true, 242#true]) [2024-10-13 09:48:40,103 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,103 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,103 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,103 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-13 09:48:40,249 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, 243#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 242#true]) [2024-10-13 09:48:40,249 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,250 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-13 09:48:40,250 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,250 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,251 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 17#$Ultimate##0true, 271#true, 244#true, 242#true]) [2024-10-13 09:48:40,251 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,251 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,251 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-13 09:48:40,251 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-13 09:48:40,622 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 132#L700-3true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-10-13 09:48:40,622 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,622 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,622 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,622 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:48:40,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 17#$Ultimate##0true, 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-10-13 09:48:40,717 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,717 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,717 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:48:40,717 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,720 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 67#$Ultimate##0true, 244#true, 242#true]) [2024-10-13 09:48:40,720 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,720 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,720 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:48:40,720 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,722 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 198#L700-3true]) [2024-10-13 09:48:40,722 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,722 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-13 09:48:40,722 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,722 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:40,814 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 24#L694-1true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-10-13 09:48:40,815 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-10-13 09:48:40,815 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:48:40,815 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:48:40,815 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-10-13 09:48:41,054 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:41,055 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,055 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:48:41,055 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-10-13 09:48:41,055 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,210 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][199], [26#L714-4true, 240#true, 70#L705-2true, 192#L703-4true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true, 207#L701-1true]) [2024-10-13 09:48:41,210 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,210 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,210 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,210 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,259 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true, 207#L701-1true]) [2024-10-13 09:48:41,259 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-10-13 09:48:41,259 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:48:41,259 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:48:41,259 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:48:41,287 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 67#$Ultimate##0true, 244#true, 242#true]) [2024-10-13 09:48:41,288 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-10-13 09:48:41,288 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-10-13 09:48:41,288 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:41,288 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-13 09:48:41,345 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 208#L701-2true, 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true]) [2024-10-13 09:48:41,345 INFO L294 olderBase$Statistics]: this new event has 148 ancestors and is cut-off event [2024-10-13 09:48:41,345 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-13 09:48:41,345 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-13 09:48:41,345 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-10-13 09:48:41,374 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-10-13 09:48:41,375 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,375 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,375 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,375 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,416 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 24#L694-1true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-10-13 09:48:41,417 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-13 09:48:41,417 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:48:41,417 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:48:41,417 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-10-13 09:48:41,468 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 26#L714-4true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:41,468 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,468 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,468 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,468 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-10-13 09:48:41,516 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,516 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-10-13 09:48:41,516 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,517 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,565 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_thr2Thread3of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork1_#t~ret6#1=|v_thr2Thread3of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork1_#t~ret6#1][185], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true]) [2024-10-13 09:48:41,565 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,565 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,565 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,566 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,836 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true]) [2024-10-13 09:48:41,836 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,836 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,836 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,836 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true, 198#L700-3true]) [2024-10-13 09:48:41,888 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 132#L700-3true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-10-13 09:48:41,888 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-10-13 09:48:41,888 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:48:41,946 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 170#$Ultimate##0true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-10-13 09:48:41,946 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-10-13 09:48:41,946 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,946 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-10-13 09:48:41,946 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-10-13 09:48:41,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true, 207#L701-1true]) [2024-10-13 09:48:41,984 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2024-10-13 09:48:41,984 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-10-13 09:48:41,984 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:48:41,984 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:48:42,025 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 24#L694-1true, 26#L714-4true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-10-13 09:48:42,025 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,025 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-13 09:48:42,025 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-13 09:48:42,025 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,028 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 208#L701-2true, 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-10-13 09:48:42,028 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,028 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,028 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-10-13 09:48:42,028 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,052 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 26#L714-4true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:42,052 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-10-13 09:48:42,052 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:42,052 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-10-13 09:48:42,052 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:48:42,080 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][208], [130#L705-2true, 240#true, Black: 261#true, 192#L703-4true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 237#L701-1true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:42,080 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,080 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,080 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,080 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 113#L705-2true, 24#L694-1true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true, 198#L700-3true]) [2024-10-13 09:48:42,099 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-10-13 09:48:42,099 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:48:42,099 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:48:42,099 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:48:42,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 170#$Ultimate##0true, 132#L700-3true, 240#true, Black: 263#(= |#race~x~0| 0), 70#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-10-13 09:48:42,122 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-10-13 09:48:42,122 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:48:42,122 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:48:42,122 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-10-13 09:48:42,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 113#L705-2true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true, 198#L700-3true]) [2024-10-13 09:48:42,132 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,132 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,132 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,132 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,157 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][178], [130#L705-2true, 240#true, Black: 261#true, 266#true, 246#true, 52#L702-4true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 237#L701-1true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:42,158 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-10-13 09:48:42,158 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-10-13 09:48:42,158 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:48:42,158 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-10-13 09:48:42,178 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 24#L694-1true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-10-13 09:48:42,178 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-10-13 09:48:42,178 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-10-13 09:48:42,178 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:48:42,178 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-10-13 09:48:42,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [113#L705-2true, 132#L700-3true, 240#true, 70#L705-2true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 180#L694-2true, 244#true, 242#true]) [2024-10-13 09:48:42,203 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,203 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,203 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,203 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-10-13 09:48:42,352 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 170#$Ultimate##0true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 128#L703-3true, 244#true, 242#true]) [2024-10-13 09:48:42,352 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-10-13 09:48:42,352 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-10-13 09:48:42,352 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:48:42,352 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:48:42,353 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork1_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, thr2Thread1of3ForFork1_#t~ret6#1=|v_thr2Thread1of3ForFork1_#t~ret6#1_1|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork1_#t~ret6#1][125], [130#L705-2true, 113#L705-2true, 170#$Ultimate##0true, 240#true, Black: 261#true, 100#L703-3true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 244#true, 242#true]) [2024-10-13 09:48:42,353 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-10-13 09:48:42,354 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:48:42,354 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-10-13 09:48:42,354 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-10-13 09:48:42,387 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 24#L694-1true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 128#L703-3true]) [2024-10-13 09:48:42,387 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-10-13 09:48:42,387 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-10-13 09:48:42,387 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-10-13 09:48:42,387 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2024-10-13 09:48:42,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 180#L694-2true, 244#true, 242#true, 128#L703-3true]) [2024-10-13 09:48:42,399 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-10-13 09:48:42,399 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,399 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-13 09:48:42,399 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,404 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork1_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork1_#t~ret6#1=|v_thr2Thread2of3ForFork1_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork1_#t~ret6#1][162], [130#L705-2true, 240#true, 70#L705-2true, Black: 261#true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 40#L-1-4true, 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 141#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true, 128#L703-3true]) [2024-10-13 09:48:42,404 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-10-13 09:48:42,404 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,404 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-10-13 09:48:42,404 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-10-13 09:48:42,449 INFO L124 PetriNetUnfolderBase]: 7489/26528 cut-off events. [2024-10-13 09:48:42,449 INFO L125 PetriNetUnfolderBase]: For 6257/10949 co-relation queries the response was YES. [2024-10-13 09:48:42,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45827 conditions, 26528 events. 7489/26528 cut-off events. For 6257/10949 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 346271 event pairs, 2957 based on Foata normal form. 10/22488 useless extension candidates. Maximal degree in co-relation 45783. Up to 4917 conditions per place. [2024-10-13 09:48:42,652 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 0 changer transitions 4/212 dead transitions. [2024-10-13 09:48:42,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 212 transitions, 649 flow [2024-10-13 09:48:42,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:48:42,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-13 09:48:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1077 transitions. [2024-10-13 09:48:42,654 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8616 [2024-10-13 09:48:42,654 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 591 flow. Second operand 5 states and 1077 transitions. [2024-10-13 09:48:42,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 212 transitions, 649 flow [2024-10-13 09:48:42,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 212 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-13 09:48:42,686 INFO L231 Difference]: Finished difference. Result has 203 places, 208 transitions, 567 flow [2024-10-13 09:48:42,687 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=203, PETRI_TRANSITIONS=208} [2024-10-13 09:48:42,687 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -1 predicate places. [2024-10-13 09:48:42,687 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 208 transitions, 567 flow [2024-10-13 09:48:42,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 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) [2024-10-13 09:48:42,688 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-13 09:48:42,688 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:42,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:48:42,688 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-10-13 09:48:42,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:48:42,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1285094176, now seen corresponding path program 1 times [2024-10-13 09:48:42,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:48:42,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736269282] [2024-10-13 09:48:42,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:48:42,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:48:42,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:48:42,707 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 09:48:42,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 09:48:42,723 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 09:48:42,724 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2024-10-13 09:48:42,725 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2024-10-13 09:48:42,726 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2024-10-13 09:48:42,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:48:42,726 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:48:42,809 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2024-10-13 09:48:42,809 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 09:48:42,813 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:48:42 BasicIcfg [2024-10-13 09:48:42,815 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 09:48:42,816 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 09:48:42,816 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 09:48:42,816 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 09:48:42,816 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:48:30" (3/4) ... [2024-10-13 09:48:42,818 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 09:48:42,818 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 09:48:42,819 INFO L158 Benchmark]: Toolchain (without parser) took 13573.14ms. Allocated memory was 134.2MB in the beginning and 7.3GB in the end (delta: 7.2GB). Free memory was 60.3MB in the beginning and 6.3GB in the end (delta: -6.3GB). Peak memory consumption was 921.8MB. Max. memory is 16.1GB. [2024-10-13 09:48:42,819 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:48:42,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 426.50ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 60.2MB in the beginning and 147.3MB in the end (delta: -87.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. [2024-10-13 09:48:42,819 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.51ms. Allocated memory is still 195.0MB. Free memory was 147.3MB in the beginning and 145.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 09:48:42,819 INFO L158 Benchmark]: Boogie Preprocessor took 22.70ms. Allocated memory is still 195.0MB. Free memory was 145.2MB in the beginning and 144.4MB in the end (delta: 873.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:48:42,820 INFO L158 Benchmark]: RCFGBuilder took 304.49ms. Allocated memory is still 195.0MB. Free memory was 144.4MB in the beginning and 127.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 09:48:42,820 INFO L158 Benchmark]: TraceAbstraction took 12769.51ms. Allocated memory was 195.0MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 126.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 925.2MB. Max. memory is 16.1GB. [2024-10-13 09:48:42,820 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 7.3GB. Free memory is still 6.3GB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 09:48:42,821 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 134.2MB. Free memory is still 95.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 426.50ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 60.2MB in the beginning and 147.3MB in the end (delta: -87.2MB). Peak memory consumption was 13.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.51ms. Allocated memory is still 195.0MB. Free memory was 147.3MB in the beginning and 145.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.70ms. Allocated memory is still 195.0MB. Free memory was 145.2MB in the beginning and 144.4MB in the end (delta: 873.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 304.49ms. Allocated memory is still 195.0MB. Free memory was 144.4MB in the beginning and 127.2MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 12769.51ms. Allocated memory was 195.0MB in the beginning and 7.3GB in the end (delta: 7.1GB). Free memory was 126.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 925.2MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 7.3GB. Free memory is still 6.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L709] 0 x = 0 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=5, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=5, t1=-1, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, x=0] [L713] 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=5, t1=-1, t2=0, x=0] [L697] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=5, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=5, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=5, x=0] [L701] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L702] 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L702] COND TRUE 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=0] [L703] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, k=5, mut={3:0}, n=5, t=0, x=1] [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=5, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x < n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 185 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.3s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 45 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 7/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 237 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 36 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 26/26 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 289 locations, 27 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 9.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 392 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 22 mSDtfsCounter, 392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-10-13 09:48:42,855 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE