./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../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.fs.icfgbuilder-eval-023d838-m [2024-11-10 14:27:51,688 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 14:27:51,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-10 14:27:51,766 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 14:27:51,767 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 14:27:51,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 14:27:51,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 14:27:51,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 14:27:51,791 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 14:27:51,791 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 14:27:51,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 14:27:51,792 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 14:27:51,792 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 14:27:51,793 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 14:27:51,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 14:27:51,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 14:27:51,796 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 14:27:51,796 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 14:27:51,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 14:27:51,797 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 14:27:51,797 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 14:27:51,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 14:27:51,799 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-10 14:27:51,800 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 14:27:51,800 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 14:27:51,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 14:27:51,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 14:27:51,801 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 14:27:51,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 14:27:51,802 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 14:27:51,802 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 14:27:51,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:27:51,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 14:27:51,803 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 14:27:51,803 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 14:27:51,803 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 14:27:51,804 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 14:27:51,804 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 14:27:51,804 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 14:27:51,804 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 14:27:51,805 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 14:27:51,805 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-11-10 14:27:52,040 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 14:27:52,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 14:27:52,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 14:27:52,063 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 14:27:52,063 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 14:27:52,065 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-11-10 14:27:53,532 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 14:27:53,818 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 14:27:53,818 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-11-10 14:27:53,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4547ac0a/09a223899fc142dc95aef758aa21ffd8/FLAGba9c8c49d [2024-11-10 14:27:53,859 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4547ac0a/09a223899fc142dc95aef758aa21ffd8 [2024-11-10 14:27:53,861 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 14:27:53,863 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 14:27:53,865 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 14:27:53,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 14:27:53,871 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 14:27:53,872 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:53" (1/1) ... [2024-11-10 14:27:53,873 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1443318 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:53, skipping insertion in model container [2024-11-10 14:27:53,874 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:27:53" (1/1) ... [2024-11-10 14:27:53,919 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 14:27:54,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:27:54,356 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 14:27:54,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 14:27:54,448 INFO L204 MainTranslator]: Completed translation [2024-11-10 14:27:54,449 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54 WrapperNode [2024-11-10 14:27:54,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 14:27:54,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 14:27:54,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 14:27:54,451 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 14:27:54,457 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,473 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,504 INFO L138 Inliner]: procedures = 171, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2024-11-10 14:27:54,505 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 14:27:54,505 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 14:27:54,506 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 14:27:54,506 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 14:27:54,514 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,514 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,517 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,517 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,528 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,533 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 14:27:54,534 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 14:27:54,534 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 14:27:54,534 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 14:27:54,535 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (1/1) ... [2024-11-10 14:27:54,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 14:27:54,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 14:27:54,577 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-11-10 14:27:54,582 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-11-10 14:27:54,630 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-10 14:27:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-10 14:27:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-10 14:27:54,631 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-10 14:27:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-10 14:27:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 14:27:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-10 14:27:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-10 14:27:54,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 14:27:54,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 14:27:54,633 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-10 14:27:54,784 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 14:27:54,787 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 14:27:55,012 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-10 14:27:55,012 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 14:27:55,045 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 14:27:55,046 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 14:27:55,046 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:55 BoogieIcfgContainer [2024-11-10 14:27:55,046 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 14:27:55,050 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 14:27:55,050 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 14:27:55,053 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 14:27:55,053 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:27:53" (1/3) ... [2024-11-10 14:27:55,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645464e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:27:55, skipping insertion in model container [2024-11-10 14:27:55,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:27:54" (2/3) ... [2024-11-10 14:27:55,054 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645464e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:27:55, skipping insertion in model container [2024-11-10 14:27:55,054 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:55" (3/3) ... [2024-11-10 14:27:55,055 INFO L112 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2024-11-10 14:27:55,071 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 14:27:55,072 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 10 error locations. [2024-11-10 14:27:55,073 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-10 14:27:55,143 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:27:55,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 138 transitions, 284 flow [2024-11-10 14:27:55,246 INFO L124 PetriNetUnfolderBase]: 8/152 cut-off events. [2024-11-10 14:27:55,246 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:55,253 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 205 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-11-10 14:27:55,253 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 138 transitions, 284 flow [2024-11-10 14:27:55,258 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 281 flow [2024-11-10 14:27:55,269 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:27:55,277 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;@2b8a59aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:27:55,277 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-10 14:27:55,289 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:27:55,292 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-10 14:27:55,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:55,293 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:55,293 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-11-10 14:27:55,294 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:27:55,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:55,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1915669612, now seen corresponding path program 1 times [2024-11-10 14:27:55,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:55,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464857000] [2024-11-10 14:27:55,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:55,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:55,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:55,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:55,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:55,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464857000] [2024-11-10 14:27:55,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464857000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:55,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:55,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:55,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096156900] [2024-11-10 14:27:55,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:55,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:55,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:55,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:55,639 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-10 14:27:55,642 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-11-10 14:27:55,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:55,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-10 14:27:55,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:55,762 INFO L124 PetriNetUnfolderBase]: 23/314 cut-off events. [2024-11-10 14:27:55,764 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:27:55,766 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 1249 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-11-10 14:27:55,770 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 11 selfloop transitions, 2 changer transitions 1/129 dead transitions. [2024-11-10 14:27:55,772 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 291 flow [2024-11-10 14:27:55,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-10 14:27:55,788 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-11-10 14:27:55,791 INFO L175 Difference]: Start difference. First operand has 136 places, 137 transitions, 281 flow. Second operand 3 states and 373 transitions. [2024-11-10 14:27:55,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 291 flow [2024-11-10 14:27:55,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:27:55,802 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 266 flow [2024-11-10 14:27:55,826 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-11-10 14:27:55,832 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-10 14:27:55,832 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 266 flow [2024-11-10 14:27:55,833 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-11-10 14:27:55,833 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:55,833 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-11-10 14:27:55,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 14:27:55,834 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:27:55,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:55,835 INFO L85 PathProgramCache]: Analyzing trace with hash 971734227, now seen corresponding path program 1 times [2024-11-10 14:27:55,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:55,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212768275] [2024-11-10 14:27:55,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:55,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:55,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212768275] [2024-11-10 14:27:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212768275] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652685087] [2024-11-10 14:27:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:55,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:55,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:55,974 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-11-10 14:27:55,975 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-11-10 14:27:55,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:55,976 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-11-10 14:27:55,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:56,042 INFO L124 PetriNetUnfolderBase]: 28/394 cut-off events. [2024-11-10 14:27:56,042 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:27:56,044 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 1732 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-11-10 14:27:56,046 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 13 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-10 14:27:56,046 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 294 flow [2024-11-10 14:27:56,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:56,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:56,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-11-10 14:27:56,049 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2024-11-10 14:27:56,049 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 266 flow. Second operand 3 states and 364 transitions. [2024-11-10 14:27:56,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 294 flow [2024-11-10 14:27:56,050 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:56,052 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 264 flow [2024-11-10 14:27:56,052 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-11-10 14:27:56,053 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2024-11-10 14:27:56,054 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 264 flow [2024-11-10 14:27:56,054 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-11-10 14:27:56,054 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:56,054 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-11-10 14:27:56,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 14:27:56,055 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:27:56,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:56,055 INFO L85 PathProgramCache]: Analyzing trace with hash 734060857, now seen corresponding path program 1 times [2024-11-10 14:27:56,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:56,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743269571] [2024-11-10 14:27:56,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:56,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:56,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:56,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:56,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743269571] [2024-11-10 14:27:56,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743269571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:56,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:56,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892606032] [2024-11-10 14:27:56,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:56,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:56,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:56,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:56,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:56,154 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2024-11-10 14:27:56,154 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-11-10 14:27:56,154 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:56,154 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2024-11-10 14:27:56,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:56,255 INFO L124 PetriNetUnfolderBase]: 68/518 cut-off events. [2024-11-10 14:27:56,257 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-10 14:27:56,260 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 2755 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-11-10 14:27:56,263 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-11-10 14:27:56,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 284 flow [2024-11-10 14:27:56,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:56,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:56,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-11-10 14:27:56,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2024-11-10 14:27:56,267 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 264 flow. Second operand 3 states and 356 transitions. [2024-11-10 14:27:56,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 284 flow [2024-11-10 14:27:56,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:56,273 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2024-11-10 14:27:56,273 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-11-10 14:27:56,275 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-11-10 14:27:56,275 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2024-11-10 14:27:56,276 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-11-10 14:27:56,276 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:56,276 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-11-10 14:27:56,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 14:27:56,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:27:56,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1965283677, now seen corresponding path program 1 times [2024-11-10 14:27:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:56,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735369267] [2024-11-10 14:27:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:56,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:56,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:56,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735369267] [2024-11-10 14:27:56,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735369267] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:56,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:56,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:56,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883117542] [2024-11-10 14:27:56,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:56,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:56,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:56,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:56,393 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2024-11-10 14:27:56,394 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-11-10 14:27:56,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:56,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2024-11-10 14:27:56,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:56,445 INFO L124 PetriNetUnfolderBase]: 17/278 cut-off events. [2024-11-10 14:27:56,446 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-10 14:27:56,447 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 879 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-11-10 14:27:56,448 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2024-11-10 14:27:56,448 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 299 flow [2024-11-10 14:27:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-11-10 14:27:56,450 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2024-11-10 14:27:56,450 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 379 transitions. [2024-11-10 14:27:56,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 299 flow [2024-11-10 14:27:56,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:27:56,476 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 279 flow [2024-11-10 14:27:56,476 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-11-10 14:27:56,478 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -7 predicate places. [2024-11-10 14:27:56,478 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 279 flow [2024-11-10 14:27:56,479 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-11-10 14:27:56,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:56,480 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-11-10 14:27:56,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 14:27:56,480 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:27:56,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:56,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1162470107, now seen corresponding path program 1 times [2024-11-10 14:27:56,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:56,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200138081] [2024-11-10 14:27:56,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:56,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:56,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:56,682 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-10 14:27:56,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:56,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200138081] [2024-11-10 14:27:56,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200138081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:56,683 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:56,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:27:56,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446229942] [2024-11-10 14:27:56,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:56,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:27:56,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:56,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:27:56,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:27:56,725 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2024-11-10 14:27:56,726 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-11-10 14:27:56,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:56,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2024-11-10 14:27:56,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:56,804 INFO L124 PetriNetUnfolderBase]: 12/280 cut-off events. [2024-11-10 14:27:56,804 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-10 14:27:56,805 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-11-10 14:27:56,806 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 16 selfloop transitions, 0 changer transitions 4/127 dead transitions. [2024-11-10 14:27:56,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 325 flow [2024-11-10 14:27:56,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:27:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:27:56,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2024-11-10 14:27:56,809 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2024-11-10 14:27:56,809 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 279 flow. Second operand 5 states and 591 transitions. [2024-11-10 14:27:56,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 325 flow [2024-11-10 14:27:56,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:56,813 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 275 flow [2024-11-10 14:27:56,814 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-11-10 14:27:56,815 INFO L277 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-10 14:27:56,815 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 275 flow [2024-11-10 14:27:56,815 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-11-10 14:27:56,816 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:56,816 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-11-10 14:27:56,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 14:27:56,816 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-10 14:27:56,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:56,817 INFO L85 PathProgramCache]: Analyzing trace with hash -188308526, now seen corresponding path program 1 times [2024-11-10 14:27:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772067977] [2024-11-10 14:27:56,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:56,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:27:56,849 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:27:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:27:56,907 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:27:56,908 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:27:56,909 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2024-11-10 14:27:56,911 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2024-11-10 14:27:56,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2024-11-10 14:27:56,912 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2024-11-10 14:27:56,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2024-11-10 14:27:56,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2024-11-10 14:27:56,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2024-11-10 14:27:56,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2024-11-10 14:27:56,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2024-11-10 14:27:56,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2024-11-10 14:27:56,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2024-11-10 14:27:56,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2024-11-10 14:27:56,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2024-11-10 14:27:56,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2024-11-10 14:27:56,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2024-11-10 14:27:56,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2024-11-10 14:27:56,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2024-11-10 14:27:56,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 14:27:56,918 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 14:27:56,921 WARN L244 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:27:56,921 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-10 14:27:56,964 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:27:56,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 408 flow [2024-11-10 14:27:56,993 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-11-10 14:27:56,993 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-10 14:27:56,995 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 7. Compared 373 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-11-10 14:27:56,995 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 194 transitions, 408 flow [2024-11-10 14:27:56,997 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 171 transitions, 355 flow [2024-11-10 14:27:56,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:27:57,000 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;@2b8a59aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:27:57,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-10 14:27:57,003 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:27:57,003 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-10 14:27:57,003 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:57,003 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:57,003 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-11-10 14:27:57,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-10 14:27:57,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 575574358, now seen corresponding path program 1 times [2024-11-10 14:27:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:57,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286777900] [2024-11-10 14:27:57,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:57,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:57,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286777900] [2024-11-10 14:27:57,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286777900] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:57,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:57,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:57,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901335252] [2024-11-10 14:27:57,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:57,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:57,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:57,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:57,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:57,062 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2024-11-10 14:27:57,063 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-11-10 14:27:57,063 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:57,063 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2024-11-10 14:27:57,063 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:57,215 INFO L124 PetriNetUnfolderBase]: 216/1072 cut-off events. [2024-11-10 14:27:57,216 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-10 14:27:57,219 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 7362 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-11-10 14:27:57,224 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 16 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2024-11-10 14:27:57,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 373 flow [2024-11-10 14:27:57,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:57,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:57,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-11-10 14:27:57,226 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2024-11-10 14:27:57,227 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 355 flow. Second operand 3 states and 514 transitions. [2024-11-10 14:27:57,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 373 flow [2024-11-10 14:27:57,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:27:57,229 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2024-11-10 14:27:57,230 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-11-10 14:27:57,230 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2024-11-10 14:27:57,231 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2024-11-10 14:27:57,231 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-11-10 14:27:57,231 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:57,231 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-11-10 14:27:57,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 14:27:57,232 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-10 14:27:57,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:57,232 INFO L85 PathProgramCache]: Analyzing trace with hash -860022315, now seen corresponding path program 1 times [2024-11-10 14:27:57,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:57,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069168368] [2024-11-10 14:27:57,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:57,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:57,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:57,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:57,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069168368] [2024-11-10 14:27:57,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069168368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:57,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:57,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:57,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598962712] [2024-11-10 14:27:57,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:57,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:57,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:57,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:57,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:57,306 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-10 14:27:57,307 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-11-10 14:27:57,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:57,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-10 14:27:57,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:57,458 INFO L124 PetriNetUnfolderBase]: 205/1268 cut-off events. [2024-11-10 14:27:57,459 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-10 14:27:57,464 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 46. Compared 8979 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-11-10 14:27:57,471 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 17 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-11-10 14:27:57,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 374 flow [2024-11-10 14:27:57,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:57,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:57,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-10 14:27:57,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8694158075601375 [2024-11-10 14:27:57,473 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 506 transitions. [2024-11-10 14:27:57,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 374 flow [2024-11-10 14:27:57,475 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:57,477 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2024-11-10 14:27:57,478 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-11-10 14:27:57,478 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2024-11-10 14:27:57,478 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2024-11-10 14:27:57,479 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-11-10 14:27:57,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:57,480 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-11-10 14:27:57,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 14:27:57,481 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-10 14:27:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash -1829548613, now seen corresponding path program 1 times [2024-11-10 14:27:57,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035970453] [2024-11-10 14:27:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:57,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:57,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:57,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:57,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:57,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035970453] [2024-11-10 14:27:57,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035970453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:57,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:57,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:57,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384493606] [2024-11-10 14:27:57,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:57,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:57,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:57,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:57,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:57,558 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 194 [2024-11-10 14:27:57,559 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-11-10 14:27:57,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:57,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 194 [2024-11-10 14:27:57,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:57,830 INFO L124 PetriNetUnfolderBase]: 590/2395 cut-off events. [2024-11-10 14:27:57,831 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-10 14:27:57,841 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 19492 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-11-10 14:27:57,855 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 19 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2024-11-10 14:27:57,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 364 flow [2024-11-10 14:27:57,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:57,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:57,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2024-11-10 14:27:57,857 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2024-11-10 14:27:57,858 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 488 transitions. [2024-11-10 14:27:57,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 364 flow [2024-11-10 14:27:57,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:57,862 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2024-11-10 14:27:57,862 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-11-10 14:27:57,865 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -10 predicate places. [2024-11-10 14:27:57,865 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2024-11-10 14:27:57,866 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-11-10 14:27:57,866 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:57,866 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-11-10 14:27:57,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-10 14:27:57,866 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-10 14:27:57,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:57,867 INFO L85 PathProgramCache]: Analyzing trace with hash 719695525, now seen corresponding path program 1 times [2024-11-10 14:27:57,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:57,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457186897] [2024-11-10 14:27:57,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:57,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:57,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-11-10 14:27:57,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:57,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457186897] [2024-11-10 14:27:57,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457186897] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:57,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:57,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:57,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569679306] [2024-11-10 14:27:57,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:57,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:57,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:57,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:57,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:57,954 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 194 [2024-11-10 14:27:57,955 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-11-10 14:27:57,955 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:57,955 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 194 [2024-11-10 14:27:57,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:58,136 INFO L124 PetriNetUnfolderBase]: 347/1375 cut-off events. [2024-11-10 14:27:58,136 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-10 14:27:58,143 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 9694 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-11-10 14:27:58,150 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 25 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2024-11-10 14:27:58,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 424 flow [2024-11-10 14:27:58,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:58,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:58,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2024-11-10 14:27:58,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2024-11-10 14:27:58,153 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 519 transitions. [2024-11-10 14:27:58,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 424 flow [2024-11-10 14:27:58,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:27:58,156 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2024-11-10 14:27:58,156 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-11-10 14:27:58,157 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -7 predicate places. [2024-11-10 14:27:58,157 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2024-11-10 14:27:58,158 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-11-10 14:27:58,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:58,158 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-11-10 14:27:58,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 14:27:58,158 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-10 14:27:58,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:58,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2052615951, now seen corresponding path program 1 times [2024-11-10 14:27:58,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:58,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712935957] [2024-11-10 14:27:58,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:58,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:58,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:58,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:58,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712935957] [2024-11-10 14:27:58,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712935957] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:58,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:58,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:58,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53983773] [2024-11-10 14:27:58,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:58,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:58,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:58,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:58,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:58,262 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2024-11-10 14:27:58,263 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-11-10 14:27:58,263 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:58,263 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2024-11-10 14:27:58,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:58,567 INFO L124 PetriNetUnfolderBase]: 447/1925 cut-off events. [2024-11-10 14:27:58,567 INFO L125 PetriNetUnfolderBase]: For 612/632 co-relation queries the response was YES. [2024-11-10 14:27:58,576 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 113. Compared 15435 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-11-10 14:27:58,590 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 23 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2024-11-10 14:27:58,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 502 flow [2024-11-10 14:27:58,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:27:58,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:27:58,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2024-11-10 14:27:58,593 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8951890034364262 [2024-11-10 14:27:58,593 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 521 transitions. [2024-11-10 14:27:58,593 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 502 flow [2024-11-10 14:27:58,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 173 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:58,601 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2024-11-10 14:27:58,603 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-11-10 14:27:58,604 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, -5 predicate places. [2024-11-10 14:27:58,604 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2024-11-10 14:27:58,605 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-11-10 14:27:58,605 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:58,605 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-11-10 14:27:58,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 14:27:58,606 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-10 14:27:58,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:58,607 INFO L85 PathProgramCache]: Analyzing trace with hash 863572675, now seen corresponding path program 1 times [2024-11-10 14:27:58,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:58,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068328709] [2024-11-10 14:27:58,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:58,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-10 14:27:58,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:58,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068328709] [2024-11-10 14:27:58,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068328709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:58,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:58,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:27:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641545032] [2024-11-10 14:27:58,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:58,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:27:58,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:58,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:27:58,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:27:58,741 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-10 14:27:58,743 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-11-10 14:27:58,743 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:58,743 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-10 14:27:58,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:27:58,990 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([500] L705-3-->L705: 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][154], [120#L705true, Black: 205#true, 113#thr1ENTRYtrue, 194#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 39#L705true, 28#L714-1true, 210#true, 192#true, 215#true, 204#(= |#race~n~0| 0), 188#true]) [2024-11-10 14:27:58,990 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-10 14:27:58,991 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-10 14:27:58,991 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-10 14:27:58,991 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-10 14:27:59,098 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([533] L705-3-->L705: 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], [120#L705true, Black: 205#true, 113#thr1ENTRYtrue, 194#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 39#L705true, 210#true, 192#true, 215#true, 54#L-1true, 204#(= |#race~n~0| 0), 188#true]) [2024-11-10 14:27:59,098 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-10 14:27:59,098 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:27:59,098 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:27:59,099 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-10 14:27:59,127 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([533] L705-3-->L705: 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], [120#L705true, 113#thr1ENTRYtrue, Black: 207#(= |#race~x~0| 0), 194#true, Black: 212#(= |#race~x~0| |thr2Thread1of2ForFork1_#t~nondet5#1|), 39#L705true, 210#true, 192#true, 215#true, 54#L-1true, 204#(= |#race~n~0| 0), 188#true]) [2024-11-10 14:27:59,127 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-11-10 14:27:59,127 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:27:59,127 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-10 14:27:59,128 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-10 14:27:59,135 INFO L124 PetriNetUnfolderBase]: 539/2952 cut-off events. [2024-11-10 14:27:59,135 INFO L125 PetriNetUnfolderBase]: For 551/794 co-relation queries the response was YES. [2024-11-10 14:27:59,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4738 conditions, 2952 events. 539/2952 cut-off events. For 551/794 co-relation queries the response was YES. Maximal size of possible extension queue 155. Compared 27744 event pairs, 215 based on Foata normal form. 1/2595 useless extension candidates. Maximal degree in co-relation 4695. Up to 443 conditions per place. [2024-11-10 14:27:59,163 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 19 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2024-11-10 14:27:59,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 513 flow [2024-11-10 14:27:59,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:27:59,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:27:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2024-11-10 14:27:59,168 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8597938144329897 [2024-11-10 14:27:59,168 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 834 transitions. [2024-11-10 14:27:59,168 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 513 flow [2024-11-10 14:27:59,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:27:59,178 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2024-11-10 14:27:59,178 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-11-10 14:27:59,179 INFO L277 CegarLoopForPetriNet]: 170 programPoint places, 0 predicate places. [2024-11-10 14:27:59,181 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2024-11-10 14:27:59,181 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-11-10 14:27:59,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:59,182 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-11-10 14:27:59,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 14:27:59,182 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-10 14:27:59,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:59,183 INFO L85 PathProgramCache]: Analyzing trace with hash -892560068, now seen corresponding path program 1 times [2024-11-10 14:27:59,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:59,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363300647] [2024-11-10 14:27:59,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:59,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:27:59,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:27:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:27:59,224 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:27:59,225 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:27:59,225 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-11-10 14:27:59,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-11-10 14:27:59,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-11-10 14:27:59,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-11-10 14:27:59,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-11-10 14:27:59,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-11-10 14:27:59,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-11-10 14:27:59,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-11-10 14:27:59,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-11-10 14:27:59,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-11-10 14:27:59,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-11-10 14:27:59,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2024-11-10 14:27:59,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-11-10 14:27:59,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-11-10 14:27:59,228 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-11-10 14:27:59,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-11-10 14:27:59,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-11-10 14:27:59,229 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-11-10 14:27:59,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-11-10 14:27:59,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-11-10 14:27:59,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-11-10 14:27:59,230 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-11-10 14:27:59,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-10 14:27:59,230 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:27:59,231 WARN L244 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-10 14:27:59,231 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-10 14:27:59,269 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-10 14:27:59,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 250 transitions, 536 flow [2024-11-10 14:27:59,301 INFO L124 PetriNetUnfolderBase]: 14/260 cut-off events. [2024-11-10 14:27:59,302 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-10 14:27:59,303 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 7. Compared 552 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-11-10 14:27:59,304 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 250 transitions, 536 flow [2024-11-10 14:27:59,306 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 205 transitions, 431 flow [2024-11-10 14:27:59,307 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 14:27:59,307 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;@2b8a59aa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 14:27:59,307 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-10 14:27:59,309 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-10 14:27:59,309 INFO L124 PetriNetUnfolderBase]: 0/25 cut-off events. [2024-11-10 14:27:59,309 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-10 14:27:59,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:27:59,310 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-11-10 14:27:59,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:27:59,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:27:59,310 INFO L85 PathProgramCache]: Analyzing trace with hash -597583024, now seen corresponding path program 1 times [2024-11-10 14:27:59,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:27:59,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726603995] [2024-11-10 14:27:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:27:59,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:27:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:27:59,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:27:59,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:27:59,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726603995] [2024-11-10 14:27:59,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726603995] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:27:59,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:27:59,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:27:59,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434367239] [2024-11-10 14:27:59,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:27:59,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:27:59,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:27:59,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:27:59,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:27:59,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-11-10 14:27:59,381 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-11-10 14:27:59,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:27:59,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-11-10 14:27:59,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:00,236 INFO L124 PetriNetUnfolderBase]: 1589/4910 cut-off events. [2024-11-10 14:28:00,236 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2024-11-10 14:28:00,263 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 44624 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-11-10 14:28:00,299 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 21 selfloop transitions, 2 changer transitions 1/195 dead transitions. [2024-11-10 14:28:00,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 195 transitions, 457 flow [2024-11-10 14:28:00,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:28:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:28:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-11-10 14:28:00,302 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2024-11-10 14:28:00,302 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 431 flow. Second operand 3 states and 655 transitions. [2024-11-10 14:28:00,302 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 195 transitions, 457 flow [2024-11-10 14:28:00,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 454 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-10 14:28:00,307 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2024-11-10 14:28:00,307 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-11-10 14:28:00,308 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -2 predicate places. [2024-11-10 14:28:00,308 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2024-11-10 14:28:00,309 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-11-10 14:28:00,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:00,309 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-11-10 14:28:00,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 14:28:00,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:28:00,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash -431018481, now seen corresponding path program 1 times [2024-11-10 14:28:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:00,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101379735] [2024-11-10 14:28:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:00,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:00,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:28:00,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:00,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101379735] [2024-11-10 14:28:00,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101379735] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:00,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:00,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:28:00,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405540179] [2024-11-10 14:28:00,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:00,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:28:00,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:00,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:28:00,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:28:00,399 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-11-10 14:28:00,400 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-11-10 14:28:00,400 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:00,400 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-11-10 14:28:00,400 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:01,305 INFO L124 PetriNetUnfolderBase]: 1176/6582 cut-off events. [2024-11-10 14:28:01,306 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2024-11-10 14:28:01,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8387 conditions, 6582 events. 1176/6582 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 70758 event pairs, 1154 based on Foata normal form. 0/5582 useless extension candidates. Maximal degree in co-relation 8352. Up to 1670 conditions per place. [2024-11-10 14:28:01,360 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 21 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2024-11-10 14:28:01,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 193 transitions, 454 flow [2024-11-10 14:28:01,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:28:01,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:28:01,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-11-10 14:28:01,363 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.864 [2024-11-10 14:28:01,363 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 648 transitions. [2024-11-10 14:28:01,363 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 193 transitions, 454 flow [2024-11-10 14:28:01,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 193 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:28:01,367 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 408 flow [2024-11-10 14:28:01,367 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-11-10 14:28:01,368 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -4 predicate places. [2024-11-10 14:28:01,368 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 408 flow [2024-11-10 14:28:01,368 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-11-10 14:28:01,369 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:01,369 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-11-10 14:28:01,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 14:28:01,369 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:28:01,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:01,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1325259915, now seen corresponding path program 1 times [2024-11-10 14:28:01,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:01,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307056792] [2024-11-10 14:28:01,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:01,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:01,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:28:01,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307056792] [2024-11-10 14:28:01,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1307056792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:01,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:01,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:28:01,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320744370] [2024-11-10 14:28:01,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:01,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:28:01,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:01,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:28:01,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:28:01,425 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2024-11-10 14:28:01,426 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-11-10 14:28:01,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:01,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2024-11-10 14:28:01,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:02,987 INFO L124 PetriNetUnfolderBase]: 4181/13046 cut-off events. [2024-11-10 14:28:02,988 INFO L125 PetriNetUnfolderBase]: For 436/436 co-relation queries the response was YES. [2024-11-10 14:28:03,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18399 conditions, 13046 events. 4181/13046 cut-off events. For 436/436 co-relation queries the response was YES. Maximal size of possible extension queue 454. Compared 140969 event pairs, 3658 based on Foata normal form. 0/11319 useless extension candidates. Maximal degree in co-relation 18357. Up to 5066 conditions per place. [2024-11-10 14:28:03,099 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 24 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2024-11-10 14:28:03,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 444 flow [2024-11-10 14:28:03,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:28:03,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:28:03,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-11-10 14:28:03,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2024-11-10 14:28:03,102 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 408 flow. Second operand 3 states and 620 transitions. [2024-11-10 14:28:03,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 444 flow [2024-11-10 14:28:03,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:28:03,106 INFO L231 Difference]: Finished difference. Result has 193 places, 186 transitions, 392 flow [2024-11-10 14:28:03,106 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-11-10 14:28:03,107 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -11 predicate places. [2024-11-10 14:28:03,107 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 392 flow [2024-11-10 14:28:03,107 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-11-10 14:28:03,107 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:03,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, 1, 1, 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-11-10 14:28:03,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-10 14:28:03,108 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:28:03,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:03,108 INFO L85 PathProgramCache]: Analyzing trace with hash -27191702, now seen corresponding path program 1 times [2024-11-10 14:28:03,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:03,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685526740] [2024-11-10 14:28:03,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:03,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:03,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:28:03,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:03,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685526740] [2024-11-10 14:28:03,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685526740] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:03,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:03,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:28:03,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887936869] [2024-11-10 14:28:03,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:03,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:28:03,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:03,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:28:03,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:28:03,169 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 250 [2024-11-10 14:28:03,170 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-11-10 14:28:03,170 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:03,170 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 250 [2024-11-10 14:28:03,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:04,771 INFO L124 PetriNetUnfolderBase]: 4747/12923 cut-off events. [2024-11-10 14:28:04,771 INFO L125 PetriNetUnfolderBase]: For 840/840 co-relation queries the response was YES. [2024-11-10 14:28:04,814 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 135206 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-11-10 14:28:04,890 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 35 selfloop transitions, 11 changer transitions 0/206 dead transitions. [2024-11-10 14:28:04,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 206 transitions, 537 flow [2024-11-10 14:28:04,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:28:04,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:28:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2024-11-10 14:28:04,892 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8746666666666667 [2024-11-10 14:28:04,892 INFO L175 Difference]: Start difference. First operand has 193 places, 186 transitions, 392 flow. Second operand 3 states and 656 transitions. [2024-11-10 14:28:04,892 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 206 transitions, 537 flow [2024-11-10 14:28:04,894 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 206 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-10 14:28:04,897 INFO L231 Difference]: Finished difference. Result has 196 places, 197 transitions, 487 flow [2024-11-10 14:28:04,897 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-11-10 14:28:04,897 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -8 predicate places. [2024-11-10 14:28:04,898 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 487 flow [2024-11-10 14:28:04,898 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-11-10 14:28:04,898 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:04,898 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-11-10 14:28:04,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 14:28:04,898 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:28:04,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:04,899 INFO L85 PathProgramCache]: Analyzing trace with hash -70195269, now seen corresponding path program 1 times [2024-11-10 14:28:04,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:04,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114199245] [2024-11-10 14:28:04,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:04,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:04,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:28:04,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:04,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114199245] [2024-11-10 14:28:04,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114199245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:04,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:04,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 14:28:04,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773272201] [2024-11-10 14:28:04,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:04,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 14:28:04,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:04,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 14:28:04,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 14:28:04,979 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-11-10 14:28:04,980 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-11-10 14:28:04,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:04,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-11-10 14:28:04,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:06,550 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [139#L714-1true, 240#true, 29#L700true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:06,550 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-11-10 14:28:06,550 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:28:06,550 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:06,550 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-10 14:28:06,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, 33#L694-4true, 29#L700true, Black: 261#true, 266#true, 246#true, 263#(= |#race~x~0| 0), 95#L705true, 260#(= |#race~n~0| 0), 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:06,568 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-10 14:28:06,568 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:28:06,568 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:28:06,568 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:28:06,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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][213], [120#L694-5true, 139#L714-1true, 240#true, 29#L700true, Black: 261#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 106#L703true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:06,709 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-10 14:28:06,709 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:06,709 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:06,709 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:07,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, 33#L694-4true, Black: 261#true, 266#true, 215#L705true, 246#true, 95#L705true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:07,122 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:28:07,122 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:07,122 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:07,122 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:28:07,198 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [139#L714-1true, 240#true, 33#L694-4true, Black: 261#true, 215#L705true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 106#L703true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:07,198 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-10 14:28:07,198 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-10 14:28:07,198 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-10 14:28:07,198 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-10 14:28:07,245 INFO L124 PetriNetUnfolderBase]: 6575/18065 cut-off events. [2024-11-10 14:28:07,245 INFO L125 PetriNetUnfolderBase]: For 7505/8058 co-relation queries the response was YES. [2024-11-10 14:28:07,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35123 conditions, 18065 events. 6575/18065 cut-off events. For 7505/8058 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 203008 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-11-10 14:28:07,566 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 33 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2024-11-10 14:28:07,567 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 215 transitions, 657 flow [2024-11-10 14:28:07,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 14:28:07,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-10 14:28:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2024-11-10 14:28:07,569 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.888 [2024-11-10 14:28:07,569 INFO L175 Difference]: Start difference. First operand has 196 places, 197 transitions, 487 flow. Second operand 3 states and 666 transitions. [2024-11-10 14:28:07,569 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 215 transitions, 657 flow [2024-11-10 14:28:07,586 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:28:07,588 INFO L231 Difference]: Finished difference. Result has 198 places, 209 transitions, 591 flow [2024-11-10 14:28:07,589 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-11-10 14:28:07,590 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -6 predicate places. [2024-11-10 14:28:07,590 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 591 flow [2024-11-10 14:28:07,591 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-11-10 14:28:07,591 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:07,591 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-11-10 14:28:07,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-10 14:28:07,592 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:28:07,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:07,592 INFO L85 PathProgramCache]: Analyzing trace with hash 728866670, now seen corresponding path program 1 times [2024-11-10 14:28:07,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:07,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174541776] [2024-11-10 14:28:07,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:07,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:07,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 14:28:07,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 14:28:07,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 14:28:07,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174541776] [2024-11-10 14:28:07,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174541776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 14:28:07,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 14:28:07,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 14:28:07,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668790113] [2024-11-10 14:28:07,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 14:28:07,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 14:28:07,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 14:28:07,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 14:28:07,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-10 14:28:07,713 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-11-10 14:28:07,714 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-11-10 14:28:07,714 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-10 14:28:07,714 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-11-10 14:28:07,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-10 14:28:09,053 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [139#L714-1true, 240#true, 29#L700true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,054 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-10 14:28:09,054 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:28:09,054 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-10 14:28:09,054 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:28:09,389 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L701-1true, 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,389 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,389 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:09,389 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,389 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:09,425 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [120#L694-5true, 139#L714-1true, 240#true, 29#L700true, Black: 261#true, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,425 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,425 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:09,425 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-10 14:28:09,425 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,445 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 42#L701true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,445 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,445 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:28:09,445 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:28:09,445 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,464 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [139#L714-1true, 33#L694-4true, 240#true, 29#L700true, Black: 261#true, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,464 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,464 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:28:09,464 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-10 14:28:09,464 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,579 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([773] L701-2-->L701-1: Formula: (= |v_#race~x~0_6| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][199], [139#L714-1true, 33#L694-4true, 240#true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 211#L701-1true, 260#(= |#race~n~0| 0), 106#L703true, 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,579 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:28:09,579 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,579 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:28:09,579 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,634 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [139#L714-1true, 240#true, 29#L700true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,634 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-11-10 14:28:09,634 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:28:09,634 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:28:09,634 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-10 14:28:09,694 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [139#L714-1true, 235#L701-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-10 14:28:09,694 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-10 14:28:09,694 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,694 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,694 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L701-1true, 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,695 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-10 14:28:09,695 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,695 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,695 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,700 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,701 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:28:09,701 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,701 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,701 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:28:09,736 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [120#L694-5true, 139#L714-1true, 240#true, 29#L700true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,736 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-10 14:28:09,736 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,736 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,736 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-10 14:28:09,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 42#L701true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,754 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:28:09,754 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,754 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,754 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,771 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [139#L714-1true, 33#L694-4true, 240#true, 29#L700true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,771 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-10 14:28:09,771 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,771 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,771 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-10 14:28:09,802 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [120#L694-5true, 139#L714-1true, 240#true, Black: 261#true, 266#true, 215#L705true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:09,802 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-10 14:28:09,802 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:28:09,803 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:28:09,803 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:28:10,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 33#L694-4true, 240#true, Black: 261#true, 266#true, 215#L705true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,021 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,021 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-10 14:28:10,021 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,021 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 215#L705true, 246#true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,061 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is not cut-off event [2024-11-10 14:28:10,061 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2024-11-10 14:28:10,061 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is not cut-off event [2024-11-10 14:28:10,061 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is not cut-off event [2024-11-10 14:28:10,061 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, Black: 261#true, 50#thr1ENTRYtrue, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 198#L703-1true, 13#L705true]) [2024-11-10 14:28:10,061 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-10 14:28:10,061 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:28:10,061 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:28:10,062 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-10 14:28:10,173 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,173 INFO L294 olderBase$Statistics]: this new event has 155 ancestors and is cut-off event [2024-11-10 14:28:10,173 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:28:10,173 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:28:10,173 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-10 14:28:10,173 INFO L297 olderBase$Statistics]: existing Event has 155 ancestors and is cut-off event [2024-11-10 14:28:10,203 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 240#true, Black: 261#true, 266#true, 215#L705true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 13#L705true]) [2024-11-10 14:28:10,203 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-10 14:28:10,203 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,203 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,203 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,252 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [120#L694-5true, 139#L714-1true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 215#L705true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,252 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-11-10 14:28:10,252 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:28:10,253 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-10 14:28:10,253 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-10 14:28:10,280 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [139#L714-1true, 33#L694-4true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 215#L705true, 246#true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,280 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-10 14:28:10,280 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,280 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:28:10,280 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-10 14:28:10,399 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([806] L701-2-->L701-1: Formula: (= |v_#race~x~0_6| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][208], [235#L701-1true, 240#true, 33#L694-4true, Black: 261#true, 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 106#L703true, 244#true, 242#true]) [2024-11-10 14:28:10,399 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,399 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,399 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-10 14:28:10,399 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-10 14:28:10,417 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [120#L694-5true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 115#L700true, 271#true, 244#true, 242#true]) [2024-11-10 14:28:10,417 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-11-10 14:28:10,417 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-10 14:28:10,417 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-10 14:28:10,417 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-10 14:28:10,448 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [33#L694-4true, 240#true, Black: 263#(= |#race~x~0| 0), 266#true, 246#true, 215#L705true, 153#L-1true, 95#L705true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 115#L700true, 271#true, 244#true, 242#true]) [2024-11-10 14:28:10,448 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,448 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-10 14:28:10,448 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-10 14:28:10,448 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-10 14:28:10,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([806] L701-2-->L701-1: Formula: (= |v_#race~x~0_6| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_6|} AuxVars[] AssignedVars[#race~x~0][177], [235#L701-1true, 33#L694-4true, 240#true, Black: 261#true, 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 74#L705-3true, 244#true, 242#true]) [2024-11-10 14:28:10,475 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-10 14:28:10,475 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:28:10,475 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-10 14:28:10,476 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-10 14:28:10,544 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [120#L694-5true, 240#true, Black: 261#true, 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,544 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-10 14:28:10,544 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:28:10,544 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-10 14:28:10,544 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:28:10,552 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [240#true, Black: 261#true, 84#L703-1true, 50#thr1ENTRYtrue, 266#true, 215#L705true, 246#true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true]) [2024-11-10 14:28:10,552 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-10 14:28:10,552 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-10 14:28:10,552 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-10 14:28:10,552 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-10 14:28:10,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [240#true, 33#L694-4true, Black: 261#true, 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,559 INFO L294 olderBase$Statistics]: this new event has 165 ancestors and is cut-off event [2024-11-10 14:28:10,559 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:28:10,560 INFO L297 olderBase$Statistics]: existing Event has 160 ancestors and is cut-off event [2024-11-10 14:28:10,560 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:28:10,574 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [120#L694-5true, 240#true, Black: 261#true, 215#L705true, 246#true, 153#L-1true, Black: 266#true, 260#(= |#race~n~0| 0), 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true, 232#L703-1true]) [2024-11-10 14:28:10,574 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-11-10 14:28:10,574 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-10 14:28:10,574 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-10 14:28:10,574 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2024-11-10 14:28:10,754 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [33#L694-4true, 240#true, Black: 261#true, 246#true, 215#L705true, 153#L-1true, Black: 266#true, 260#(= |#race~n~0| 0), 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 244#true, 242#true, 13#L705true, 232#L703-1true]) [2024-11-10 14:28:10,754 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,754 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,754 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,754 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([783] L705-3-->L705: 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], [240#true, Black: 261#true, 215#L705true, 246#true, 153#L-1true, Black: 266#true, 260#(= |#race~n~0| 0), 271#true, 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 244#true, 242#true, 13#L705true, 232#L703-1true]) [2024-11-10 14:28:10,764 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,764 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,764 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,764 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,782 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [240#true, Black: 261#true, 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 13#L705true]) [2024-11-10 14:28:10,782 INFO L294 olderBase$Statistics]: this new event has 170 ancestors and is cut-off event [2024-11-10 14:28:10,782 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:28:10,782 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:28:10,782 INFO L297 olderBase$Statistics]: existing Event has 165 ancestors and is cut-off event [2024-11-10 14:28:10,789 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([816] L705-3-->L705: 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], [240#true, Black: 263#(= |#race~x~0| 0), 50#thr1ENTRYtrue, 266#true, 246#true, 215#L705true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 13#L705true]) [2024-11-10 14:28:10,790 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,790 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,790 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,790 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,798 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([750] L705-3-->L705: 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], [240#true, Black: 261#true, 266#true, 246#true, 153#L-1true, Black: 268#(= |thr2Thread1of3ForFork1_#t~nondet5#1| |#race~x~0|), 95#L705true, 260#(= |#race~n~0| 0), 271#true, 244#true, 242#true, 7#thr1Err1ASSERT_VIOLATIONDATA_RACEtrue, 198#L703-1true, 13#L705true]) [2024-11-10 14:28:10,798 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,798 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,798 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-10 14:28:10,798 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-10 14:28:10,822 INFO L124 PetriNetUnfolderBase]: 7409/26152 cut-off events. [2024-11-10 14:28:10,823 INFO L125 PetriNetUnfolderBase]: For 6163/10675 co-relation queries the response was YES. [2024-11-10 14:28:10,922 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45261 conditions, 26152 events. 7409/26152 cut-off events. For 6163/10675 co-relation queries the response was YES. Maximal size of possible extension queue 1112. Compared 340602 event pairs, 2908 based on Foata normal form. 7/22177 useless extension candidates. Maximal degree in co-relation 45217. Up to 4818 conditions per place. [2024-11-10 14:28:11,024 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 0 changer transitions 4/212 dead transitions. [2024-11-10 14:28:11,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 212 transitions, 649 flow [2024-11-10 14:28:11,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 14:28:11,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-10 14:28:11,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1077 transitions. [2024-11-10 14:28:11,027 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8616 [2024-11-10 14:28:11,027 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 591 flow. Second operand 5 states and 1077 transitions. [2024-11-10 14:28:11,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 212 transitions, 649 flow [2024-11-10 14:28:11,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 212 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-10 14:28:11,087 INFO L231 Difference]: Finished difference. Result has 203 places, 208 transitions, 567 flow [2024-11-10 14:28:11,087 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-11-10 14:28:11,087 INFO L277 CegarLoopForPetriNet]: 204 programPoint places, -1 predicate places. [2024-11-10 14:28:11,088 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 208 transitions, 567 flow [2024-11-10 14:28:11,088 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-11-10 14:28:11,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-10 14:28:11,088 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-11-10 14:28:11,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 14:28:11,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err1ASSERT_VIOLATIONDATA_RACE === [thr2Err2ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err0ASSERT_VIOLATIONDATA_RACE, thr1Err1ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-10 14:28:11,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 14:28:11,089 INFO L85 PathProgramCache]: Analyzing trace with hash -346720125, now seen corresponding path program 1 times [2024-11-10 14:28:11,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 14:28:11,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042532448] [2024-11-10 14:28:11,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 14:28:11,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 14:28:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:28:11,107 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 14:28:11,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 14:28:11,137 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 14:28:11,137 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 14:28:11,137 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err1ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2024-11-10 14:28:11,137 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2024-11-10 14:28:11,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2024-11-10 14:28:11,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2024-11-10 14:28:11,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2024-11-10 14:28:11,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2024-11-10 14:28:11,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2024-11-10 14:28:11,138 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2024-11-10 14:28:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2024-11-10 14:28:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2024-11-10 14:28:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2024-11-10 14:28:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2024-11-10 14:28:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2024-11-10 14:28:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2024-11-10 14:28:11,139 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2024-11-10 14:28:11,140 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2024-11-10 14:28:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2024-11-10 14:28:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2024-11-10 14:28:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2024-11-10 14:28:11,141 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2024-11-10 14:28:11,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-10 14:28:11,141 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-10 14:28:11,261 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2024-11-10 14:28:11,262 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 14:28:11,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:28:11 BasicIcfg [2024-11-10 14:28:11,270 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 14:28:11,270 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 14:28:11,270 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 14:28:11,270 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 14:28:11,271 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:27:55" (3/4) ... [2024-11-10 14:28:11,272 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-10 14:28:11,348 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 14:28:11,349 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 14:28:11,352 INFO L158 Benchmark]: Toolchain (without parser) took 17486.04ms. Allocated memory was 174.1MB in the beginning and 8.6GB in the end (delta: 8.4GB). Free memory was 103.0MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 948.3MB. Max. memory is 16.1GB. [2024-11-10 14:28:11,353 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 174.1MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:28:11,353 INFO L158 Benchmark]: CACSL2BoogieTranslator took 584.48ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 129.9MB in the end (delta: -27.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2024-11-10 14:28:11,353 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.79ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 14:28:11,353 INFO L158 Benchmark]: Boogie Preprocessor took 28.00ms. Allocated memory is still 174.1MB. Free memory was 127.9MB in the beginning and 126.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 14:28:11,354 INFO L158 Benchmark]: IcfgBuilder took 512.46ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 109.0MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-10 14:28:11,354 INFO L158 Benchmark]: TraceAbstraction took 16219.97ms. Allocated memory was 174.1MB in the beginning and 8.6GB in the end (delta: 8.4GB). Free memory was 108.2MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 921.4MB. Max. memory is 16.1GB. [2024-11-10 14:28:11,354 INFO L158 Benchmark]: Witness Printer took 78.53ms. Allocated memory is still 8.6GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-10 14:28:11,355 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.25ms. Allocated memory is still 174.1MB. Free memory is still 129.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 584.48ms. Allocated memory is still 174.1MB. Free memory was 102.8MB in the beginning and 129.9MB in the end (delta: -27.1MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.79ms. Allocated memory is still 174.1MB. Free memory was 129.9MB in the beginning and 127.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.00ms. Allocated memory is still 174.1MB. Free memory was 127.9MB in the beginning and 126.5MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 512.46ms. Allocated memory is still 174.1MB. Free memory was 126.5MB in the beginning and 109.0MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16219.97ms. Allocated memory was 174.1MB in the beginning and 8.6GB in the end (delta: 8.4GB). Free memory was 108.2MB in the beginning and 7.6GB in the end (delta: -7.5GB). Peak memory consumption was 921.4MB. Max. memory is 16.1GB. * Witness Printer took 78.53ms. Allocated memory is still 8.6GB. Free memory was 7.6GB in the beginning and 7.6GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. 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=10, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] EXPR 0 n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, 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=10, 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=10, t1=-1, x=0] [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=10, t1=-1, x=0] [L713] 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=10, 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=10, 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=10, t1=-1, t2=0, x=0] [L697] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, 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=10, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L701] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] COND TRUE 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L703] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=1] [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=10, 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.7s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.2s 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.4s 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: 2.3s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.3s 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: 11.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.3s 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.2s 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-11-10 14:28:11,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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