./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c -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 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:11:58,162 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:11:58,219 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:11:58,222 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:11:58,223 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:11:58,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:11:58,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:11:58,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:11:58,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:11:58,239 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:11:58,239 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:11:58,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:11:58,240 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:11:58,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:11:58,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:11:58,241 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:11:58,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:11:58,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:11:58,242 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:11:58,242 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:11:58,242 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:11:58,242 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:11:58,243 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:11:58,243 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:11:58,243 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:11:58,243 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:11:58,243 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:11:58,244 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:11:58,244 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:11:58,244 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:11:58,244 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:11:58,244 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:11:58,245 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:11:58,245 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:11:58,245 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:11:58,245 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:11:58,246 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:11:58,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:11:58,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:11:58,247 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:11:58,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:11:58,247 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 -> 77faa562cc80dab159af187984ab1ce484b13225711253aedc5512d7a84dfd3f [2024-10-14 17:11:58,451 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:11:58,470 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:11:58,473 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:11:58,475 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:11:58,475 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:11:58,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-10-14 17:11:59,735 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:11:59,896 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:11:59,896 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-match-symm.wvr.c [2024-10-14 17:11:59,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c675ed4ac/b9ba6b55e47e49f9bded78fc4b7c09c2/FLAG63c94c51f [2024-10-14 17:11:59,917 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c675ed4ac/b9ba6b55e47e49f9bded78fc4b7c09c2 [2024-10-14 17:11:59,919 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:11:59,921 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:11:59,922 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:11:59,922 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:11:59,927 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:11:59,927 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:59" (1/1) ... [2024-10-14 17:11:59,928 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10c0e3f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:11:59, skipping insertion in model container [2024-10-14 17:11:59,928 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:11:59" (1/1) ... [2024-10-14 17:11:59,945 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:12:00,106 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:00,118 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:12:00,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:00,159 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:12:00,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00 WrapperNode [2024-10-14 17:12:00,160 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:00,161 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:00,161 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:12:00,162 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:12:00,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,178 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,203 INFO L138 Inliner]: procedures = 21, calls = 18, calls flagged for inlining = 12, calls inlined = 18, statements flattened = 241 [2024-10-14 17:12:00,204 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:00,204 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:12:00,204 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:12:00,204 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:12:00,217 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,217 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,225 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,227 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,229 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,230 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,232 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:12:00,233 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:12:00,233 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:12:00,234 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:12:00,234 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (1/1) ... [2024-10-14 17:12:00,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:00,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:12:00,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 17:12:00,282 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 17:12:00,330 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:12:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:12:00,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:12:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:12:00,331 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:12:00,331 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:12:00,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:12:00,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:12:00,333 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:12:00,433 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:12:00,435 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:12:00,863 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:12:00,863 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:12:00,883 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:12:00,885 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-14 17:12:00,885 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:00 BoogieIcfgContainer [2024-10-14 17:12:00,885 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:12:00,887 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:12:00,888 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:12:00,891 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:12:00,892 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:11:59" (1/3) ... [2024-10-14 17:12:00,892 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b605533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:00, skipping insertion in model container [2024-10-14 17:12:00,893 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:00" (2/3) ... [2024-10-14 17:12:00,893 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b605533 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:00, skipping insertion in model container [2024-10-14 17:12:00,894 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:00" (3/3) ... [2024-10-14 17:12:00,895 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-match-symm.wvr.c [2024-10-14 17:12:00,910 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:12:00,910 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-10-14 17:12:00,910 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:12:00,996 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:12:01,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 332 places, 341 transitions, 696 flow [2024-10-14 17:12:01,122 INFO L124 PetriNetUnfolderBase]: 16/339 cut-off events. [2024-10-14 17:12:01,122 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:12:01,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 339 events. 16/339 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 345 event pairs, 0 based on Foata normal form. 0/293 useless extension candidates. Maximal degree in co-relation 198. Up to 2 conditions per place. [2024-10-14 17:12:01,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 332 places, 341 transitions, 696 flow [2024-10-14 17:12:01,141 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 312 places, 319 transitions, 650 flow [2024-10-14 17:12:01,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:12:01,155 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;@4e6d862c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:12:01,155 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-10-14 17:12:01,160 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:12:01,160 INFO L124 PetriNetUnfolderBase]: 0/23 cut-off events. [2024-10-14 17:12:01,160 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:12:01,160 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:01,163 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] [2024-10-14 17:12:01,163 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:01,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:01,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1891127115, now seen corresponding path program 1 times [2024-10-14 17:12:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:01,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187489167] [2024-10-14 17:12:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:01,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:01,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187489167] [2024-10-14 17:12:01,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187489167] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:01,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:01,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:01,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574500825] [2024-10-14 17:12:01,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:01,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:01,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:01,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:01,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:01,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-10-14 17:12:01,373 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 319 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:01,373 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:01,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-10-14 17:12:01,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:01,506 INFO L124 PetriNetUnfolderBase]: 14/504 cut-off events. [2024-10-14 17:12:01,507 INFO L125 PetriNetUnfolderBase]: For 15/16 co-relation queries the response was YES. [2024-10-14 17:12:01,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 549 conditions, 504 events. 14/504 cut-off events. For 15/16 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1208 event pairs, 8 based on Foata normal form. 27/459 useless extension candidates. Maximal degree in co-relation 403. Up to 28 conditions per place. [2024-10-14 17:12:01,515 INFO L140 encePairwiseOnDemand]: 328/341 looper letters, 11 selfloop transitions, 2 changer transitions 2/308 dead transitions. [2024-10-14 17:12:01,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 308 transitions, 654 flow [2024-10-14 17:12:01,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:01,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:01,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2024-10-14 17:12:01,536 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9442815249266863 [2024-10-14 17:12:01,539 INFO L175 Difference]: Start difference. First operand has 312 places, 319 transitions, 650 flow. Second operand 3 states and 966 transitions. [2024-10-14 17:12:01,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 308 transitions, 654 flow [2024-10-14 17:12:01,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 309 places, 308 transitions, 646 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 17:12:01,551 INFO L231 Difference]: Finished difference. Result has 309 places, 306 transitions, 620 flow [2024-10-14 17:12:01,554 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=307, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=620, PETRI_PLACES=309, PETRI_TRANSITIONS=306} [2024-10-14 17:12:01,557 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -3 predicate places. [2024-10-14 17:12:01,558 INFO L471 AbstractCegarLoop]: Abstraction has has 309 places, 306 transitions, 620 flow [2024-10-14 17:12:01,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:01,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:01,559 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] [2024-10-14 17:12:01,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:12:01,559 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:01,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:01,561 INFO L85 PathProgramCache]: Analyzing trace with hash 79721871, now seen corresponding path program 1 times [2024-10-14 17:12:01,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:01,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809055557] [2024-10-14 17:12:01,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:01,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:01,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:01,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:01,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809055557] [2024-10-14 17:12:01,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809055557] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:01,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:01,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876251650] [2024-10-14 17:12:01,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:01,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:01,707 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-14 17:12:01,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 309 places, 306 transitions, 620 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:01,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:01,709 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-14 17:12:01,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:01,785 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-10-14 17:12:01,785 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:12:01,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1133 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 480. Up to 16 conditions per place. [2024-10-14 17:12:01,790 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2024-10-14 17:12:01,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 305 transitions, 640 flow [2024-10-14 17:12:01,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:01,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:01,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-14 17:12:01,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-14 17:12:01,795 INFO L175 Difference]: Start difference. First operand has 309 places, 306 transitions, 620 flow. Second operand 3 states and 960 transitions. [2024-10-14 17:12:01,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 305 transitions, 640 flow [2024-10-14 17:12:01,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 305 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:01,804 INFO L231 Difference]: Finished difference. Result has 306 places, 305 transitions, 618 flow [2024-10-14 17:12:01,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=618, PETRI_PLACES=306, PETRI_TRANSITIONS=305} [2024-10-14 17:12:01,806 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -6 predicate places. [2024-10-14 17:12:01,806 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 305 transitions, 618 flow [2024-10-14 17:12:01,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:01,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:01,807 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] [2024-10-14 17:12:01,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:12:01,808 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:01,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:01,808 INFO L85 PathProgramCache]: Analyzing trace with hash 812410856, now seen corresponding path program 1 times [2024-10-14 17:12:01,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:01,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704803602] [2024-10-14 17:12:01,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:01,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:01,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:01,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:01,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:01,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704803602] [2024-10-14 17:12:01,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704803602] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:01,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:01,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506356716] [2024-10-14 17:12:01,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:01,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:01,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:01,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:01,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:01,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-14 17:12:01,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 305 transitions, 618 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:01,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:01,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-14 17:12:01,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:01,981 INFO L124 PetriNetUnfolderBase]: 9/480 cut-off events. [2024-10-14 17:12:01,981 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:12:01,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 505 conditions, 480 events. 9/480 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 1094 event pairs, 3 based on Foata normal form. 0/414 useless extension candidates. Maximal degree in co-relation 465. Up to 16 conditions per place. [2024-10-14 17:12:01,987 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2024-10-14 17:12:01,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 304 transitions, 638 flow [2024-10-14 17:12:01,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:01,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-14 17:12:01,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-14 17:12:01,991 INFO L175 Difference]: Start difference. First operand has 306 places, 305 transitions, 618 flow. Second operand 3 states and 960 transitions. [2024-10-14 17:12:01,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 304 transitions, 638 flow [2024-10-14 17:12:01,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 304 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:01,997 INFO L231 Difference]: Finished difference. Result has 305 places, 304 transitions, 616 flow [2024-10-14 17:12:01,998 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=305, PETRI_TRANSITIONS=304} [2024-10-14 17:12:01,998 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -7 predicate places. [2024-10-14 17:12:01,999 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 304 transitions, 616 flow [2024-10-14 17:12:02,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,001 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,001 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] [2024-10-14 17:12:02,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:12:02,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:02,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,003 INFO L85 PathProgramCache]: Analyzing trace with hash -2039657065, now seen corresponding path program 1 times [2024-10-14 17:12:02,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641881548] [2024-10-14 17:12:02,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641881548] [2024-10-14 17:12:02,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [641881548] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100975687] [2024-10-14 17:12:02,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,096 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 341 [2024-10-14 17:12:02,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 304 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 341 [2024-10-14 17:12:02,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,168 INFO L124 PetriNetUnfolderBase]: 14/499 cut-off events. [2024-10-14 17:12:02,168 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-14 17:12:02,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537 conditions, 499 events. 14/499 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1212 event pairs, 8 based on Foata normal form. 0/432 useless extension candidates. Maximal degree in co-relation 489. Up to 28 conditions per place. [2024-10-14 17:12:02,172 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 11 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2024-10-14 17:12:02,172 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 303 transitions, 640 flow [2024-10-14 17:12:02,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-14 17:12:02,174 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-14 17:12:02,174 INFO L175 Difference]: Start difference. First operand has 305 places, 304 transitions, 616 flow. Second operand 3 states and 956 transitions. [2024-10-14 17:12:02,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 303 transitions, 640 flow [2024-10-14 17:12:02,176 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 303 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:02,179 INFO L231 Difference]: Finished difference. Result has 304 places, 303 transitions, 614 flow [2024-10-14 17:12:02,179 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=610, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=614, PETRI_PLACES=304, PETRI_TRANSITIONS=303} [2024-10-14 17:12:02,181 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-10-14 17:12:02,181 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 303 transitions, 614 flow [2024-10-14 17:12:02,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,182 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,182 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] [2024-10-14 17:12:02,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:12:02,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:02,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1460679319, now seen corresponding path program 1 times [2024-10-14 17:12:02,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179495690] [2024-10-14 17:12:02,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179495690] [2024-10-14 17:12:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179495690] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635916281] [2024-10-14 17:12:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,257 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-14 17:12:02,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 303 transitions, 614 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-14 17:12:02,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,309 INFO L124 PetriNetUnfolderBase]: 9/487 cut-off events. [2024-10-14 17:12:02,310 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-14 17:12:02,311 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512 conditions, 487 events. 9/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 790 event pairs, 3 based on Foata normal form. 0/420 useless extension candidates. Maximal degree in co-relation 456. Up to 16 conditions per place. [2024-10-14 17:12:02,312 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-14 17:12:02,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 302 transitions, 634 flow [2024-10-14 17:12:02,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-14 17:12:02,315 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-14 17:12:02,316 INFO L175 Difference]: Start difference. First operand has 304 places, 303 transitions, 614 flow. Second operand 3 states and 960 transitions. [2024-10-14 17:12:02,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 302 transitions, 634 flow [2024-10-14 17:12:02,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:02,320 INFO L231 Difference]: Finished difference. Result has 303 places, 302 transitions, 612 flow [2024-10-14 17:12:02,320 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=302, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=300, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=612, PETRI_PLACES=303, PETRI_TRANSITIONS=302} [2024-10-14 17:12:02,322 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-14 17:12:02,322 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 302 transitions, 612 flow [2024-10-14 17:12:02,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,323 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,323 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] [2024-10-14 17:12:02,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:12:02,323 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:02,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,331 INFO L85 PathProgramCache]: Analyzing trace with hash -725008606, now seen corresponding path program 1 times [2024-10-14 17:12:02,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390433373] [2024-10-14 17:12:02,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390433373] [2024-10-14 17:12:02,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390433373] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356125508] [2024-10-14 17:12:02,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 341 [2024-10-14 17:12:02,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 302 transitions, 612 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,411 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 341 [2024-10-14 17:12:02,411 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,457 INFO L124 PetriNetUnfolderBase]: 9/483 cut-off events. [2024-10-14 17:12:02,457 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-14 17:12:02,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 508 conditions, 483 events. 9/483 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 777 event pairs, 3 based on Foata normal form. 0/418 useless extension candidates. Maximal degree in co-relation 444. Up to 16 conditions per place. [2024-10-14 17:12:02,460 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 9 selfloop transitions, 2 changer transitions 0/301 dead transitions. [2024-10-14 17:12:02,460 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 301 transitions, 632 flow [2024-10-14 17:12:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-14 17:12:02,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-14 17:12:02,463 INFO L175 Difference]: Start difference. First operand has 303 places, 302 transitions, 612 flow. Second operand 3 states and 960 transitions. [2024-10-14 17:12:02,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 301 transitions, 632 flow [2024-10-14 17:12:02,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 301 transitions, 628 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:02,467 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 610 flow [2024-10-14 17:12:02,467 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=606, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=299, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=610, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-10-14 17:12:02,468 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-14 17:12:02,468 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 610 flow [2024-10-14 17:12:02,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,469 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,469 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] [2024-10-14 17:12:02,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:12:02,469 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:02,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash -808007066, now seen corresponding path program 1 times [2024-10-14 17:12:02,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747205666] [2024-10-14 17:12:02,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747205666] [2024-10-14 17:12:02,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747205666] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451695140] [2024-10-14 17:12:02,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-14 17:12:02,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 610 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-14 17:12:02,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,593 INFO L124 PetriNetUnfolderBase]: 17/649 cut-off events. [2024-10-14 17:12:02,593 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:12:02,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 683 conditions, 649 events. 17/649 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1959 event pairs, 4 based on Foata normal form. 0/560 useless extension candidates. Maximal degree in co-relation 611. Up to 22 conditions per place. [2024-10-14 17:12:02,597 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-14 17:12:02,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 637 flow [2024-10-14 17:12:02,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-14 17:12:02,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-14 17:12:02,600 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 610 flow. Second operand 3 states and 968 transitions. [2024-10-14 17:12:02,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 637 flow [2024-10-14 17:12:02,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 302 transitions, 633 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:02,604 INFO L231 Difference]: Finished difference. Result has 301 places, 301 transitions, 616 flow [2024-10-14 17:12:02,604 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=602, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=301, PETRI_TRANSITIONS=301} [2024-10-14 17:12:02,605 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -11 predicate places. [2024-10-14 17:12:02,605 INFO L471 AbstractCegarLoop]: Abstraction has has 301 places, 301 transitions, 616 flow [2024-10-14 17:12:02,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,606 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] [2024-10-14 17:12:02,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:12:02,606 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:02,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,607 INFO L85 PathProgramCache]: Analyzing trace with hash 894315208, now seen corresponding path program 1 times [2024-10-14 17:12:02,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349858919] [2024-10-14 17:12:02,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349858919] [2024-10-14 17:12:02,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349858919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798885665] [2024-10-14 17:12:02,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-14 17:12:02,667 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 301 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-14 17:12:02,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,736 INFO L124 PetriNetUnfolderBase]: 19/725 cut-off events. [2024-10-14 17:12:02,736 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:12:02,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 766 conditions, 725 events. 19/725 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2490 event pairs, 5 based on Foata normal form. 0/632 useless extension candidates. Maximal degree in co-relation 625. Up to 24 conditions per place. [2024-10-14 17:12:02,740 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-14 17:12:02,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 302 transitions, 643 flow [2024-10-14 17:12:02,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-14 17:12:02,742 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-14 17:12:02,742 INFO L175 Difference]: Start difference. First operand has 301 places, 301 transitions, 616 flow. Second operand 3 states and 968 transitions. [2024-10-14 17:12:02,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 302 transitions, 643 flow [2024-10-14 17:12:02,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 302 transitions, 643 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:02,746 INFO L231 Difference]: Finished difference. Result has 302 places, 301 transitions, 626 flow [2024-10-14 17:12:02,747 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=302, PETRI_TRANSITIONS=301} [2024-10-14 17:12:02,748 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-14 17:12:02,749 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 301 transitions, 626 flow [2024-10-14 17:12:02,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,750 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,750 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] [2024-10-14 17:12:02,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:12:02,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:02,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1671683357, now seen corresponding path program 1 times [2024-10-14 17:12:02,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392670877] [2024-10-14 17:12:02,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392670877] [2024-10-14 17:12:02,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392670877] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942844763] [2024-10-14 17:12:02,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,805 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-14 17:12:02,806 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 301 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-14 17:12:02,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:02,880 INFO L124 PetriNetUnfolderBase]: 20/667 cut-off events. [2024-10-14 17:12:02,880 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2024-10-14 17:12:02,882 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 667 events. 20/667 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2599 event pairs, 3 based on Foata normal form. 0/582 useless extension candidates. Maximal degree in co-relation 574. Up to 22 conditions per place. [2024-10-14 17:12:02,883 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-14 17:12:02,883 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 302 transitions, 653 flow [2024-10-14 17:12:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:02,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:02,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-14 17:12:02,886 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-14 17:12:02,887 INFO L175 Difference]: Start difference. First operand has 302 places, 301 transitions, 626 flow. Second operand 3 states and 968 transitions. [2024-10-14 17:12:02,887 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 302 transitions, 653 flow [2024-10-14 17:12:02,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 302 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:02,891 INFO L231 Difference]: Finished difference. Result has 303 places, 301 transitions, 636 flow [2024-10-14 17:12:02,892 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=636, PETRI_PLACES=303, PETRI_TRANSITIONS=301} [2024-10-14 17:12:02,893 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-14 17:12:02,893 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 301 transitions, 636 flow [2024-10-14 17:12:02,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,894 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:02,894 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:02,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:12:02,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:02,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:02,895 INFO L85 PathProgramCache]: Analyzing trace with hash 169965439, now seen corresponding path program 1 times [2024-10-14 17:12:02,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:02,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345567826] [2024-10-14 17:12:02,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:02,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:02,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345567826] [2024-10-14 17:12:02,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345567826] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:02,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:02,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111192903] [2024-10-14 17:12:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:02,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:02,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:02,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:02,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:02,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-14 17:12:02,941 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 301 transitions, 636 flow. Second operand has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:02,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:02,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-14 17:12:02,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,001 INFO L124 PetriNetUnfolderBase]: 22/710 cut-off events. [2024-10-14 17:12:03,002 INFO L125 PetriNetUnfolderBase]: For 5/7 co-relation queries the response was YES. [2024-10-14 17:12:03,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 769 conditions, 710 events. 22/710 cut-off events. For 5/7 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2979 event pairs, 3 based on Foata normal form. 0/623 useless extension candidates. Maximal degree in co-relation 626. Up to 25 conditions per place. [2024-10-14 17:12:03,006 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/302 dead transitions. [2024-10-14 17:12:03,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 302 transitions, 663 flow [2024-10-14 17:12:03,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-14 17:12:03,008 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-14 17:12:03,008 INFO L175 Difference]: Start difference. First operand has 303 places, 301 transitions, 636 flow. Second operand 3 states and 968 transitions. [2024-10-14 17:12:03,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 302 transitions, 663 flow [2024-10-14 17:12:03,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 302 transitions, 663 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:03,012 INFO L231 Difference]: Finished difference. Result has 304 places, 301 transitions, 646 flow [2024-10-14 17:12:03,013 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=632, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=297, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=646, PETRI_PLACES=304, PETRI_TRANSITIONS=301} [2024-10-14 17:12:03,014 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -8 predicate places. [2024-10-14 17:12:03,014 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 301 transitions, 646 flow [2024-10-14 17:12:03,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.6666666666667) internal successors, (959), 3 states have internal predecessors, (959), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,015 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,015 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:03,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:12:03,015 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:03,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1498151222, now seen corresponding path program 1 times [2024-10-14 17:12:03,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754979029] [2024-10-14 17:12:03,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:03,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754979029] [2024-10-14 17:12:03,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754979029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:03,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351051192] [2024-10-14 17:12:03,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,068 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,088 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-10-14 17:12:03,089 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 301 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,089 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,089 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-10-14 17:12:03,090 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,151 INFO L124 PetriNetUnfolderBase]: 43/669 cut-off events. [2024-10-14 17:12:03,152 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-10-14 17:12:03,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 669 events. 43/669 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2597 event pairs, 16 based on Foata normal form. 0/593 useless extension candidates. Maximal degree in co-relation 642. Up to 76 conditions per place. [2024-10-14 17:12:03,155 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/300 dead transitions. [2024-10-14 17:12:03,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 300 transitions, 677 flow [2024-10-14 17:12:03,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-14 17:12:03,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-14 17:12:03,158 INFO L175 Difference]: Start difference. First operand has 304 places, 301 transitions, 646 flow. Second operand 3 states and 956 transitions. [2024-10-14 17:12:03,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 300 transitions, 677 flow [2024-10-14 17:12:03,160 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 300 transitions, 677 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:03,163 INFO L231 Difference]: Finished difference. Result has 303 places, 299 transitions, 652 flow [2024-10-14 17:12:03,163 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=638, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=652, PETRI_PLACES=303, PETRI_TRANSITIONS=299} [2024-10-14 17:12:03,164 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-14 17:12:03,164 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 299 transitions, 652 flow [2024-10-14 17:12:03,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,166 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,166 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:03,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:12:03,166 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:03,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,167 INFO L85 PathProgramCache]: Analyzing trace with hash -909252948, now seen corresponding path program 1 times [2024-10-14 17:12:03,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578381287] [2024-10-14 17:12:03,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:03,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578381287] [2024-10-14 17:12:03,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578381287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:03,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022831610] [2024-10-14 17:12:03,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 341 [2024-10-14 17:12:03,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 299 transitions, 652 flow. Second operand has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 341 [2024-10-14 17:12:03,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,299 INFO L124 PetriNetUnfolderBase]: 47/692 cut-off events. [2024-10-14 17:12:03,299 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2024-10-14 17:12:03,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 692 events. 47/692 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2669 event pairs, 16 based on Foata normal form. 0/633 useless extension candidates. Maximal degree in co-relation 688. Up to 81 conditions per place. [2024-10-14 17:12:03,302 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 14 selfloop transitions, 2 changer transitions 0/298 dead transitions. [2024-10-14 17:12:03,302 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 298 transitions, 683 flow [2024-10-14 17:12:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 956 transitions. [2024-10-14 17:12:03,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9345063538611925 [2024-10-14 17:12:03,304 INFO L175 Difference]: Start difference. First operand has 303 places, 299 transitions, 652 flow. Second operand 3 states and 956 transitions. [2024-10-14 17:12:03,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 298 transitions, 683 flow [2024-10-14 17:12:03,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 298 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:03,308 INFO L231 Difference]: Finished difference. Result has 302 places, 297 transitions, 658 flow [2024-10-14 17:12:03,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=299, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=297} [2024-10-14 17:12:03,310 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-14 17:12:03,310 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 297 transitions, 658 flow [2024-10-14 17:12:03,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 313.3333333333333) internal successors, (940), 3 states have internal predecessors, (940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,310 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:03,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:12:03,311 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:03,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,311 INFO L85 PathProgramCache]: Analyzing trace with hash -1040875051, now seen corresponding path program 1 times [2024-10-14 17:12:03,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434408443] [2024-10-14 17:12:03,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:03,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434408443] [2024-10-14 17:12:03,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434408443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116782571] [2024-10-14 17:12:03,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,369 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-10-14 17:12:03,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 297 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-10-14 17:12:03,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,421 INFO L124 PetriNetUnfolderBase]: 21/545 cut-off events. [2024-10-14 17:12:03,421 INFO L125 PetriNetUnfolderBase]: For 4/9 co-relation queries the response was YES. [2024-10-14 17:12:03,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 646 conditions, 545 events. 21/545 cut-off events. For 4/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1772 event pairs, 2 based on Foata normal form. 1/509 useless extension candidates. Maximal degree in co-relation 501. Up to 20 conditions per place. [2024-10-14 17:12:03,425 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/297 dead transitions. [2024-10-14 17:12:03,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 297 transitions, 683 flow [2024-10-14 17:12:03,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-14 17:12:03,427 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-10-14 17:12:03,427 INFO L175 Difference]: Start difference. First operand has 302 places, 297 transitions, 658 flow. Second operand 3 states and 964 transitions. [2024-10-14 17:12:03,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 297 transitions, 683 flow [2024-10-14 17:12:03,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 297 transitions, 683 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:03,432 INFO L231 Difference]: Finished difference. Result has 303 places, 296 transitions, 660 flow [2024-10-14 17:12:03,432 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=296, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=660, PETRI_PLACES=303, PETRI_TRANSITIONS=296} [2024-10-14 17:12:03,433 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-14 17:12:03,433 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 296 transitions, 660 flow [2024-10-14 17:12:03,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,434 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,434 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:03,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:12:03,434 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:03,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1343105908, now seen corresponding path program 1 times [2024-10-14 17:12:03,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319725079] [2024-10-14 17:12:03,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:03,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319725079] [2024-10-14 17:12:03,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319725079] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:03,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87753416] [2024-10-14 17:12:03,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,498 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 341 [2024-10-14 17:12:03,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 296 transitions, 660 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 341 [2024-10-14 17:12:03,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,547 INFO L124 PetriNetUnfolderBase]: 20/536 cut-off events. [2024-10-14 17:12:03,547 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-14 17:12:03,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 536 events. 20/536 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1670 event pairs, 2 based on Foata normal form. 0/504 useless extension candidates. Maximal degree in co-relation 543. Up to 24 conditions per place. [2024-10-14 17:12:03,550 INFO L140 encePairwiseOnDemand]: 338/341 looper letters, 10 selfloop transitions, 2 changer transitions 0/296 dead transitions. [2024-10-14 17:12:03,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 296 transitions, 685 flow [2024-10-14 17:12:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2024-10-14 17:12:03,552 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9423264907135875 [2024-10-14 17:12:03,552 INFO L175 Difference]: Start difference. First operand has 303 places, 296 transitions, 660 flow. Second operand 3 states and 964 transitions. [2024-10-14 17:12:03,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 296 transitions, 685 flow [2024-10-14 17:12:03,555 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 296 transitions, 681 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:03,557 INFO L231 Difference]: Finished difference. Result has 302 places, 295 transitions, 658 flow [2024-10-14 17:12:03,558 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=302, PETRI_TRANSITIONS=295} [2024-10-14 17:12:03,558 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -10 predicate places. [2024-10-14 17:12:03,559 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 295 transitions, 658 flow [2024-10-14 17:12:03,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,559 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:03,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:12:03,560 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:03,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1721930605, now seen corresponding path program 1 times [2024-10-14 17:12:03,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929973703] [2024-10-14 17:12:03,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:03,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929973703] [2024-10-14 17:12:03,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929973703] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:12:03,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647795142] [2024-10-14 17:12:03,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,665 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-14 17:12:03,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 295 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-14 17:12:03,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,721 INFO L124 PetriNetUnfolderBase]: 20/639 cut-off events. [2024-10-14 17:12:03,721 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-14 17:12:03,723 INFO L83 FinitePrefix]: Finished finitePrefix Result has 755 conditions, 639 events. 20/639 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2203 event pairs, 3 based on Foata normal form. 1/602 useless extension candidates. Maximal degree in co-relation 620. Up to 25 conditions per place. [2024-10-14 17:12:03,724 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 13 selfloop transitions, 1 changer transitions 2/298 dead transitions. [2024-10-14 17:12:03,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 298 transitions, 695 flow [2024-10-14 17:12:03,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 969 transitions. [2024-10-14 17:12:03,726 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9472140762463344 [2024-10-14 17:12:03,726 INFO L175 Difference]: Start difference. First operand has 302 places, 295 transitions, 658 flow. Second operand 3 states and 969 transitions. [2024-10-14 17:12:03,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 298 transitions, 695 flow [2024-10-14 17:12:03,727 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 298 transitions, 691 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:03,729 INFO L231 Difference]: Finished difference. Result has 303 places, 293 transitions, 655 flow [2024-10-14 17:12:03,730 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=295, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=294, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=293} [2024-10-14 17:12:03,730 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-14 17:12:03,730 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 293 transitions, 655 flow [2024-10-14 17:12:03,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,731 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:03,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:12:03,731 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:03,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,732 INFO L85 PathProgramCache]: Analyzing trace with hash 954116435, now seen corresponding path program 2 times [2024-10-14 17:12:03,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450804920] [2024-10-14 17:12:03,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:03,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450804920] [2024-10-14 17:12:03,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450804920] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:12:03,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502712747] [2024-10-14 17:12:03,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,794 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,809 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 318 out of 341 [2024-10-14 17:12:03,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 293 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,810 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,810 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 318 of 341 [2024-10-14 17:12:03,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:03,870 INFO L124 PetriNetUnfolderBase]: 18/719 cut-off events. [2024-10-14 17:12:03,870 INFO L125 PetriNetUnfolderBase]: For 33/37 co-relation queries the response was YES. [2024-10-14 17:12:03,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 839 conditions, 719 events. 18/719 cut-off events. For 33/37 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2666 event pairs, 4 based on Foata normal form. 1/680 useless extension candidates. Maximal degree in co-relation 715. Up to 31 conditions per place. [2024-10-14 17:12:03,873 INFO L140 encePairwiseOnDemand]: 339/341 looper letters, 12 selfloop transitions, 1 changer transitions 2/295 dead transitions. [2024-10-14 17:12:03,873 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 295 transitions, 687 flow [2024-10-14 17:12:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:03,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 968 transitions. [2024-10-14 17:12:03,875 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.946236559139785 [2024-10-14 17:12:03,875 INFO L175 Difference]: Start difference. First operand has 303 places, 293 transitions, 655 flow. Second operand 3 states and 968 transitions. [2024-10-14 17:12:03,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 295 transitions, 687 flow [2024-10-14 17:12:03,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 295 transitions, 686 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:03,880 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 655 flow [2024-10-14 17:12:03,880 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=292, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2024-10-14 17:12:03,880 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -9 predicate places. [2024-10-14 17:12:03,881 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 655 flow [2024-10-14 17:12:03,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 321.3333333333333) internal successors, (964), 3 states have internal predecessors, (964), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,881 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:03,881 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:03,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:12:03,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:03,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 169845892, now seen corresponding path program 1 times [2024-10-14 17:12:03,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:03,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72626334] [2024-10-14 17:12:03,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:03,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:03,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:03,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:03,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:03,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72626334] [2024-10-14 17:12:03,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72626334] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:03,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:03,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904160465] [2024-10-14 17:12:03,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:03,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:03,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:03,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:03,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-10-14 17:12:03,949 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:03,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:03,949 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-10-14 17:12:03,949 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:04,017 INFO L124 PetriNetUnfolderBase]: 16/675 cut-off events. [2024-10-14 17:12:04,018 INFO L125 PetriNetUnfolderBase]: For 29/40 co-relation queries the response was YES. [2024-10-14 17:12:04,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 804 conditions, 675 events. 16/675 cut-off events. For 29/40 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2453 event pairs, 2 based on Foata normal form. 0/648 useless extension candidates. Maximal degree in co-relation 687. Up to 22 conditions per place. [2024-10-14 17:12:04,020 INFO L140 encePairwiseOnDemand]: 337/341 looper letters, 10 selfloop transitions, 1 changer transitions 0/288 dead transitions. [2024-10-14 17:12:04,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 288 transitions, 671 flow [2024-10-14 17:12:04,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 959 transitions. [2024-10-14 17:12:04,022 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9374389051808406 [2024-10-14 17:12:04,022 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 655 flow. Second operand 3 states and 959 transitions. [2024-10-14 17:12:04,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 288 transitions, 671 flow [2024-10-14 17:12:04,024 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 299 places, 288 transitions, 670 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:04,026 INFO L231 Difference]: Finished difference. Result has 299 places, 288 transitions, 650 flow [2024-10-14 17:12:04,026 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=648, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=650, PETRI_PLACES=299, PETRI_TRANSITIONS=288} [2024-10-14 17:12:04,027 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -13 predicate places. [2024-10-14 17:12:04,027 INFO L471 AbstractCegarLoop]: Abstraction has has 299 places, 288 transitions, 650 flow [2024-10-14 17:12:04,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:04,028 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:04,028 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:04,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:12:04,028 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-10-14 17:12:04,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:04,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1903255492, now seen corresponding path program 1 times [2024-10-14 17:12:04,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:04,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478006283] [2024-10-14 17:12:04,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:04,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:04,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:04,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:04,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478006283] [2024-10-14 17:12:04,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478006283] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:04,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:04,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:04,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528035764] [2024-10-14 17:12:04,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:04,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:04,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:04,090 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 341 [2024-10-14 17:12:04,092 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 299 places, 288 transitions, 650 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:04,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:04,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 341 [2024-10-14 17:12:04,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:04,151 INFO L124 PetriNetUnfolderBase]: 18/740 cut-off events. [2024-10-14 17:12:04,151 INFO L125 PetriNetUnfolderBase]: For 18/21 co-relation queries the response was YES. [2024-10-14 17:12:04,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 877 conditions, 740 events. 18/740 cut-off events. For 18/21 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2854 event pairs, 3 based on Foata normal form. 3/718 useless extension candidates. Maximal degree in co-relation 718. Up to 28 conditions per place. [2024-10-14 17:12:04,153 INFO L140 encePairwiseOnDemand]: 335/341 looper letters, 0 selfloop transitions, 0 changer transitions 287/287 dead transitions. [2024-10-14 17:12:04,153 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 672 flow [2024-10-14 17:12:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:04,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:04,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2024-10-14 17:12:04,155 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9384164222873901 [2024-10-14 17:12:04,155 INFO L175 Difference]: Start difference. First operand has 299 places, 288 transitions, 650 flow. Second operand 3 states and 960 transitions. [2024-10-14 17:12:04,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 672 flow [2024-10-14 17:12:04,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 287 transitions, 671 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:04,158 INFO L231 Difference]: Finished difference. Result has 297 places, 0 transitions, 0 flow [2024-10-14 17:12:04,158 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=341, PETRI_DIFFERENCE_MINUEND_FLOW=643, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=285, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=297, PETRI_TRANSITIONS=0} [2024-10-14 17:12:04,159 INFO L277 CegarLoopForPetriNet]: 312 programPoint places, -15 predicate places. [2024-10-14 17:12:04,160 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 0 transitions, 0 flow [2024-10-14 17:12:04,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 17:12:04,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-10-14 17:12:04,162 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-10-14 17:12:04,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-10-14 17:12:04,164 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-10-14 17:12:04,165 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-10-14 17:12:04,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:12:04,166 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:04,172 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:12:04,172 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:12:04,177 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:12:04 BasicIcfg [2024-10-14 17:12:04,177 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:12:04,178 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:12:04,178 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:12:04,178 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:12:04,178 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:00" (3/4) ... [2024-10-14 17:12:04,179 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:12:04,182 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-10-14 17:12:04,182 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-10-14 17:12:04,187 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-10-14 17:12:04,187 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-14 17:12:04,188 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:12:04,188 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 17:12:04,261 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:12:04,262 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:12:04,262 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:12:04,262 INFO L158 Benchmark]: Toolchain (without parser) took 4341.76ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 108.9MB in the beginning and 127.9MB in the end (delta: -19.0MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-10-14 17:12:04,262 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 176.2MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:12:04,263 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.52ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 96.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 17:12:04,263 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.62ms. Allocated memory is still 176.2MB. Free memory was 96.1MB in the beginning and 93.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:12:04,263 INFO L158 Benchmark]: Boogie Preprocessor took 27.84ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:12:04,263 INFO L158 Benchmark]: RCFGBuilder took 652.22ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 133.4MB in the end (delta: -41.4MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. [2024-10-14 17:12:04,263 INFO L158 Benchmark]: TraceAbstraction took 3290.29ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 132.7MB in the beginning and 133.2MB in the end (delta: -432.9kB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. [2024-10-14 17:12:04,263 INFO L158 Benchmark]: Witness Printer took 84.13ms. Allocated memory is still 276.8MB. Free memory was 133.2MB in the beginning and 127.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:12:04,264 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.22ms. Allocated memory is still 176.2MB. Free memory is still 132.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.52ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 96.1MB in the end (delta: 12.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.62ms. Allocated memory is still 176.2MB. Free memory was 96.1MB in the beginning and 93.7MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.84ms. Allocated memory is still 176.2MB. Free memory was 93.5MB in the beginning and 92.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 652.22ms. Allocated memory is still 176.2MB. Free memory was 92.0MB in the beginning and 133.4MB in the end (delta: -41.4MB). Peak memory consumption was 18.5MB. Max. memory is 16.1GB. * TraceAbstraction took 3290.29ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 132.7MB in the beginning and 133.2MB in the end (delta: -432.9kB). Peak memory consumption was 100.5MB. Max. memory is 16.1GB. * Witness Printer took 84.13ms. Allocated memory is still 276.8MB. Free memory was 133.2MB in the beginning and 127.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 43]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 45]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 75]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 508 locations, 50 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: 3.1s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 371 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 114 mSDsluCounter, 125 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 63 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 437 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 63 mSolverCounterUnsat, 125 mSDtfsCounter, 437 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=660occurred in iteration=13, InterpolantAutomatonStates: 54, 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.7s InterpolantComputationTime, 2020 NumberOfCodeBlocks, 2020 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 2002 ConstructedInterpolants, 0 QuantifiedInterpolants, 2358 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:12:04,286 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 Result: TRUE