./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-name-comparator-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-name-comparator-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 e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:12:03,194 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:12:03,246 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:12:03,251 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:12:03,255 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:12:03,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:12:03,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:12:03,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:12:03,279 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:12:03,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:12:03,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:12:03,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:12:03,280 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:12:03,281 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:12:03,281 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:12:03,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:12:03,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:12:03,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:12:03,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:12:03,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:12:03,282 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:12:03,285 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:12:03,285 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:12:03,285 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:12:03,286 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:12:03,286 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:12:03,286 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:12:03,286 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:12:03,287 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:12:03,287 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:12:03,287 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:12:03,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:03,287 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:12:03,287 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:12:03,288 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:12:03,288 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:12:03,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:12:03,291 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:12:03,291 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:12:03,291 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:12:03,291 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:12:03,292 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 -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2024-10-14 17:12:03,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:12:03,496 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:12:03,498 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:12:03,499 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:12:03,500 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:12:03,501 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-10-14 17:12:04,723 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:12:04,904 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:12:04,904 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2024-10-14 17:12:04,912 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af04ea84/277423fe997a44309eccfd233d887932/FLAG21f47e632 [2024-10-14 17:12:05,298 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1af04ea84/277423fe997a44309eccfd233d887932 [2024-10-14 17:12:05,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:12:05,302 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:12:05,303 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:05,303 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:12:05,312 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:12:05,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:05" (1/1) ... [2024-10-14 17:12:05,314 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518c2f2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:05, skipping insertion in model container [2024-10-14 17:12:05,314 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:05" (1/1) ... [2024-10-14 17:12:05,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:12:05,503 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:05,509 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:12:05,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:05,618 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:12:05,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:05 WrapperNode [2024-10-14 17:12:05,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:05,619 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:05,619 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:12:05,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:12:05,625 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:05" (1/1) ... [2024-10-14 17:12:05,637 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:05" (1/1) ... [2024-10-14 17:12:05,675 INFO L138 Inliner]: procedures = 24, calls = 25, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 590 [2024-10-14 17:12:05,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:05,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:12:05,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:12:05,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:12:05,683 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:05" (1/1) ... [2024-10-14 17:12:05,683 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:05" (1/1) ... [2024-10-14 17:12:05,686 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:05" (1/1) ... [2024-10-14 17:12:05,686 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:05" (1/1) ... [2024-10-14 17:12:05,695 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:05" (1/1) ... [2024-10-14 17:12:05,699 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:05" (1/1) ... [2024-10-14 17:12:05,701 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:05" (1/1) ... [2024-10-14 17:12:05,702 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:05" (1/1) ... [2024-10-14 17:12:05,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:12:05,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:12:05,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:12:05,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:12:05,706 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:05" (1/1) ... [2024-10-14 17:12:05,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:05,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:12:05,733 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:05,735 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:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:12:05,767 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:12:05,767 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:12:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:12:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:12:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:12:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:12:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:12:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:12:05,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:12:05,768 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:12:05,770 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:05,859 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:12:05,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:12:06,385 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:12:06,385 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:12:06,407 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:12:06,407 INFO L314 CfgBuilder]: Removed 3 assume(true) statements. [2024-10-14 17:12:06,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:06 BoogieIcfgContainer [2024-10-14 17:12:06,430 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:12:06,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:12:06,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:12:06,434 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:12:06,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:12:05" (1/3) ... [2024-10-14 17:12:06,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a34a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:06, skipping insertion in model container [2024-10-14 17:12:06,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:05" (2/3) ... [2024-10-14 17:12:06,435 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a34a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:06, skipping insertion in model container [2024-10-14 17:12:06,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:06" (3/3) ... [2024-10-14 17:12:06,440 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2024-10-14 17:12:06,475 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:12:06,476 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 102 error locations. [2024-10-14 17:12:06,476 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:12:06,595 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-10-14 17:12:06,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 740 places, 774 transitions, 1562 flow [2024-10-14 17:12:06,883 INFO L124 PetriNetUnfolderBase]: 41/772 cut-off events. [2024-10-14 17:12:06,883 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-10-14 17:12:06,905 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 772 events. 41/772 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2008 event pairs, 0 based on Foata normal form. 0/629 useless extension candidates. Maximal degree in co-relation 564. Up to 2 conditions per place. [2024-10-14 17:12:06,907 INFO L82 GeneralOperation]: Start removeDead. Operand has 740 places, 774 transitions, 1562 flow [2024-10-14 17:12:06,926 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 718 places, 750 transitions, 1512 flow [2024-10-14 17:12:06,938 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:12:06,948 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;@d4945be, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:12:06,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 190 error locations. [2024-10-14 17:12:06,951 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:12:06,951 INFO L124 PetriNetUnfolderBase]: 0/27 cut-off events. [2024-10-14 17:12:06,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:12:06,952 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:06,952 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] [2024-10-14 17:12:06,953 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:06,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:06,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1093316283, now seen corresponding path program 1 times [2024-10-14 17:12:06,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:06,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486564138] [2024-10-14 17:12:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:06,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:07,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:07,155 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:07,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:07,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486564138] [2024-10-14 17:12:07,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486564138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:07,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:07,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:07,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598770508] [2024-10-14 17:12:07,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:07,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:07,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:07,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:07,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:07,285 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:07,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 718 places, 750 transitions, 1512 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:07,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:07,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:07,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:07,637 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-10-14 17:12:07,638 INFO L125 PetriNetUnfolderBase]: For 29/30 co-relation queries the response was YES. [2024-10-14 17:12:07,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2516 conditions, 2402 events. 133/2402 cut-off events. For 29/30 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 15062 event pairs, 35 based on Foata normal form. 66/1971 useless extension candidates. Maximal degree in co-relation 2040. Up to 88 conditions per place. [2024-10-14 17:12:07,663 INFO L140 encePairwiseOnDemand]: 758/774 looper letters, 17 selfloop transitions, 2 changer transitions 2/736 dead transitions. [2024-10-14 17:12:07,664 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 719 places, 736 transitions, 1522 flow [2024-10-14 17:12:07,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:07,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:07,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2247 transitions. [2024-10-14 17:12:07,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9677002583979328 [2024-10-14 17:12:07,687 INFO L175 Difference]: Start difference. First operand has 718 places, 750 transitions, 1512 flow. Second operand 3 states and 2247 transitions. [2024-10-14 17:12:07,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 719 places, 736 transitions, 1522 flow [2024-10-14 17:12:07,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 715 places, 736 transitions, 1514 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-10-14 17:12:07,705 INFO L231 Difference]: Finished difference. Result has 715 places, 734 transitions, 1476 flow [2024-10-14 17:12:07,708 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1476, PETRI_DIFFERENCE_MINUEND_PLACES=713, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=734, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1476, PETRI_PLACES=715, PETRI_TRANSITIONS=734} [2024-10-14 17:12:07,712 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -3 predicate places. [2024-10-14 17:12:07,712 INFO L471 AbstractCegarLoop]: Abstraction has has 715 places, 734 transitions, 1476 flow [2024-10-14 17:12:07,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:07,714 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:07,715 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] [2024-10-14 17:12:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:12:07,715 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:07,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1776279694, now seen corresponding path program 1 times [2024-10-14 17:12:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353897188] [2024-10-14 17:12:07,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:07,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:07,773 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:07,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:07,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353897188] [2024-10-14 17:12:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353897188] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:07,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274960714] [2024-10-14 17:12:07,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:07,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:07,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:07,817 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:07,819 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 715 places, 734 transitions, 1476 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:07,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:07,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:07,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:08,401 INFO L124 PetriNetUnfolderBase]: 133/2402 cut-off events. [2024-10-14 17:12:08,405 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2024-10-14 17:12:08,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2503 conditions, 2402 events. 133/2402 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 14585 event pairs, 35 based on Foata normal form. 0/1902 useless extension candidates. Maximal degree in co-relation 2467. Up to 88 conditions per place. [2024-10-14 17:12:08,451 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/733 dead transitions. [2024-10-14 17:12:08,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 714 places, 733 transitions, 1512 flow [2024-10-14 17:12:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:08,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-10-14 17:12:08,463 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-10-14 17:12:08,463 INFO L175 Difference]: Start difference. First operand has 715 places, 734 transitions, 1476 flow. Second operand 3 states and 2234 transitions. [2024-10-14 17:12:08,463 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 714 places, 733 transitions, 1512 flow [2024-10-14 17:12:08,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 712 places, 733 transitions, 1508 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:08,480 INFO L231 Difference]: Finished difference. Result has 712 places, 733 transitions, 1474 flow [2024-10-14 17:12:08,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1470, PETRI_DIFFERENCE_MINUEND_PLACES=710, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=733, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=731, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1474, PETRI_PLACES=712, PETRI_TRANSITIONS=733} [2024-10-14 17:12:08,482 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -6 predicate places. [2024-10-14 17:12:08,482 INFO L471 AbstractCegarLoop]: Abstraction has has 712 places, 733 transitions, 1474 flow [2024-10-14 17:12:08,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:08,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:08,484 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] [2024-10-14 17:12:08,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:12:08,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:08,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:08,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1533949394, now seen corresponding path program 1 times [2024-10-14 17:12:08,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:08,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068588778] [2024-10-14 17:12:08,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:08,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:08,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:08,519 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:08,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:08,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068588778] [2024-10-14 17:12:08,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068588778] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:08,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:08,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:08,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726490194] [2024-10-14 17:12:08,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:08,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:08,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:08,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:08,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:08,589 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:08,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 712 places, 733 transitions, 1474 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:08,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:08,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:08,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:08,952 INFO L124 PetriNetUnfolderBase]: 130/2940 cut-off events. [2024-10-14 17:12:08,952 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-14 17:12:08,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2990 conditions, 2940 events. 130/2940 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 17835 event pairs, 8 based on Foata normal form. 0/2329 useless extension candidates. Maximal degree in co-relation 2946. Up to 34 conditions per place. [2024-10-14 17:12:09,039 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/732 dead transitions. [2024-10-14 17:12:09,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 713 places, 732 transitions, 1510 flow [2024-10-14 17:12:09,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:09,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:09,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-10-14 17:12:09,043 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-10-14 17:12:09,043 INFO L175 Difference]: Start difference. First operand has 712 places, 733 transitions, 1474 flow. Second operand 3 states and 2234 transitions. [2024-10-14 17:12:09,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 713 places, 732 transitions, 1510 flow [2024-10-14 17:12:09,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 711 places, 732 transitions, 1506 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:09,051 INFO L231 Difference]: Finished difference. Result has 711 places, 732 transitions, 1472 flow [2024-10-14 17:12:09,053 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1468, PETRI_DIFFERENCE_MINUEND_PLACES=709, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=732, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=730, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1472, PETRI_PLACES=711, PETRI_TRANSITIONS=732} [2024-10-14 17:12:09,053 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -7 predicate places. [2024-10-14 17:12:09,053 INFO L471 AbstractCegarLoop]: Abstraction has has 711 places, 732 transitions, 1472 flow [2024-10-14 17:12:09,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:09,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:09,055 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] [2024-10-14 17:12:09,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:12:09,055 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:09,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:09,056 INFO L85 PathProgramCache]: Analyzing trace with hash -1905956316, now seen corresponding path program 1 times [2024-10-14 17:12:09,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:09,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638895383] [2024-10-14 17:12:09,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:09,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:09,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:09,085 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:09,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:09,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638895383] [2024-10-14 17:12:09,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638895383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:09,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:09,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:09,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332277440] [2024-10-14 17:12:09,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:09,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:09,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:09,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:09,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:09,118 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-10-14 17:12:09,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 711 places, 732 transitions, 1472 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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:09,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:09,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-10-14 17:12:09,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:09,275 INFO L124 PetriNetUnfolderBase]: 44/1006 cut-off events. [2024-10-14 17:12:09,276 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:12:09,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1046 conditions, 1006 events. 44/1006 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3897 event pairs, 6 based on Foata normal form. 0/815 useless extension candidates. Maximal degree in co-relation 994. Up to 26 conditions per place. [2024-10-14 17:12:09,318 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/731 dead transitions. [2024-10-14 17:12:09,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 712 places, 731 transitions, 1500 flow [2024-10-14 17:12:09,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:09,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:09,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-10-14 17:12:09,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-10-14 17:12:09,324 INFO L175 Difference]: Start difference. First operand has 711 places, 732 transitions, 1472 flow. Second operand 3 states and 2242 transitions. [2024-10-14 17:12:09,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 712 places, 731 transitions, 1500 flow [2024-10-14 17:12:09,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 710 places, 731 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:09,345 INFO L231 Difference]: Finished difference. Result has 710 places, 731 transitions, 1470 flow [2024-10-14 17:12:09,346 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1466, PETRI_DIFFERENCE_MINUEND_PLACES=708, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=731, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=729, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1470, PETRI_PLACES=710, PETRI_TRANSITIONS=731} [2024-10-14 17:12:09,347 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -8 predicate places. [2024-10-14 17:12:09,351 INFO L471 AbstractCegarLoop]: Abstraction has has 710 places, 731 transitions, 1470 flow [2024-10-14 17:12:09,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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:09,353 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:09,353 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] [2024-10-14 17:12:09,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:12:09,353 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:09,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash 904596659, now seen corresponding path program 1 times [2024-10-14 17:12:09,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:09,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73101406] [2024-10-14 17:12:09,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:09,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:09,415 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:09,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:09,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73101406] [2024-10-14 17:12:09,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73101406] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:09,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:09,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:09,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848618733] [2024-10-14 17:12:09,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:09,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:09,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:09,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:09,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:09,454 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-10-14 17:12:09,456 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 710 places, 731 transitions, 1470 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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:09,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:09,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-10-14 17:12:09,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:09,929 INFO L124 PetriNetUnfolderBase]: 91/2110 cut-off events. [2024-10-14 17:12:09,929 INFO L125 PetriNetUnfolderBase]: For 1/2 co-relation queries the response was YES. [2024-10-14 17:12:09,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2146 conditions, 2110 events. 91/2110 cut-off events. For 1/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 10548 event pairs, 5 based on Foata normal form. 0/1681 useless extension candidates. Maximal degree in co-relation 2086. Up to 23 conditions per place. [2024-10-14 17:12:09,963 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/730 dead transitions. [2024-10-14 17:12:09,964 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 711 places, 730 transitions, 1496 flow [2024-10-14 17:12:09,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:09,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:09,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-10-14 17:12:09,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-10-14 17:12:09,971 INFO L175 Difference]: Start difference. First operand has 710 places, 731 transitions, 1470 flow. Second operand 3 states and 2244 transitions. [2024-10-14 17:12:09,972 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 711 places, 730 transitions, 1496 flow [2024-10-14 17:12:09,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 709 places, 730 transitions, 1492 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:09,984 INFO L231 Difference]: Finished difference. Result has 709 places, 730 transitions, 1468 flow [2024-10-14 17:12:09,985 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1464, PETRI_DIFFERENCE_MINUEND_PLACES=707, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=728, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1468, PETRI_PLACES=709, PETRI_TRANSITIONS=730} [2024-10-14 17:12:09,988 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -9 predicate places. [2024-10-14 17:12:09,988 INFO L471 AbstractCegarLoop]: Abstraction has has 709 places, 730 transitions, 1468 flow [2024-10-14 17:12:09,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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:09,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:09,991 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] [2024-10-14 17:12:09,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:12:09,992 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:09,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:09,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1158841221, now seen corresponding path program 1 times [2024-10-14 17:12:09,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:09,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257900950] [2024-10-14 17:12:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:09,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:10,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:10,041 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:10,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:10,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257900950] [2024-10-14 17:12:10,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257900950] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:10,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:10,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:10,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593587462] [2024-10-14 17:12:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:10,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:10,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:10,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:10,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:10,112 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-10-14 17:12:10,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 709 places, 730 transitions, 1468 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:10,115 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:10,115 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-10-14 17:12:10,115 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:10,606 INFO L124 PetriNetUnfolderBase]: 182/4041 cut-off events. [2024-10-14 17:12:10,606 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-14 17:12:10,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4105 conditions, 4041 events. 182/4041 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 28060 event pairs, 12 based on Foata normal form. 0/3194 useless extension candidates. Maximal degree in co-relation 4037. Up to 44 conditions per place. [2024-10-14 17:12:10,627 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/729 dead transitions. [2024-10-14 17:12:10,627 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 710 places, 729 transitions, 1508 flow [2024-10-14 17:12:10,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:10,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:10,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-10-14 17:12:10,630 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-10-14 17:12:10,631 INFO L175 Difference]: Start difference. First operand has 709 places, 730 transitions, 1468 flow. Second operand 3 states and 2230 transitions. [2024-10-14 17:12:10,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 710 places, 729 transitions, 1508 flow [2024-10-14 17:12:10,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 708 places, 729 transitions, 1504 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:10,638 INFO L231 Difference]: Finished difference. Result has 708 places, 729 transitions, 1466 flow [2024-10-14 17:12:10,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=706, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=729, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=727, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1466, PETRI_PLACES=708, PETRI_TRANSITIONS=729} [2024-10-14 17:12:10,640 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -10 predicate places. [2024-10-14 17:12:10,640 INFO L471 AbstractCegarLoop]: Abstraction has has 708 places, 729 transitions, 1466 flow [2024-10-14 17:12:10,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:10,641 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:10,641 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] [2024-10-14 17:12:10,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:12:10,641 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:10,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:10,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1659381709, now seen corresponding path program 1 times [2024-10-14 17:12:10,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:10,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988547774] [2024-10-14 17:12:10,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:10,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:10,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:10,666 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:10,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:10,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988547774] [2024-10-14 17:12:10,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988547774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:10,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:10,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:10,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541575160] [2024-10-14 17:12:10,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:10,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:10,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:10,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:10,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:10,715 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:10,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 708 places, 729 transitions, 1466 flow. Second operand has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:10,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:10,718 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:10,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:10,830 INFO L124 PetriNetUnfolderBase]: 46/987 cut-off events. [2024-10-14 17:12:10,831 INFO L125 PetriNetUnfolderBase]: For 10/11 co-relation queries the response was YES. [2024-10-14 17:12:10,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1030 conditions, 987 events. 46/987 cut-off events. For 10/11 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3754 event pairs, 8 based on Foata normal form. 0/801 useless extension candidates. Maximal degree in co-relation 954. Up to 35 conditions per place. [2024-10-14 17:12:10,850 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 2 changer transitions 0/728 dead transitions. [2024-10-14 17:12:10,850 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 709 places, 728 transitions, 1502 flow [2024-10-14 17:12:10,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:10,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:10,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2234 transitions. [2024-10-14 17:12:10,853 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9621016365202412 [2024-10-14 17:12:10,853 INFO L175 Difference]: Start difference. First operand has 708 places, 729 transitions, 1466 flow. Second operand 3 states and 2234 transitions. [2024-10-14 17:12:10,853 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 709 places, 728 transitions, 1502 flow [2024-10-14 17:12:10,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 707 places, 728 transitions, 1498 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:10,862 INFO L231 Difference]: Finished difference. Result has 707 places, 728 transitions, 1464 flow [2024-10-14 17:12:10,863 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1460, PETRI_DIFFERENCE_MINUEND_PLACES=705, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=728, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=726, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1464, PETRI_PLACES=707, PETRI_TRANSITIONS=728} [2024-10-14 17:12:10,864 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -11 predicate places. [2024-10-14 17:12:10,864 INFO L471 AbstractCegarLoop]: Abstraction has has 707 places, 728 transitions, 1464 flow [2024-10-14 17:12:10,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.3333333333334) internal successors, (2218), 3 states have internal predecessors, (2218), 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:10,865 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:10,865 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] [2024-10-14 17:12:10,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:12:10,866 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:10,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:10,866 INFO L85 PathProgramCache]: Analyzing trace with hash 303710898, now seen corresponding path program 1 times [2024-10-14 17:12:10,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:10,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170085815] [2024-10-14 17:12:10,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:10,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:10,894 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:10,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:10,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170085815] [2024-10-14 17:12:10,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170085815] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:10,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:10,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:10,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297005121] [2024-10-14 17:12:10,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:10,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:10,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:10,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:10,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:10,924 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 742 out of 774 [2024-10-14 17:12:10,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 707 places, 728 transitions, 1464 flow. Second operand has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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:10,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:10,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 742 of 774 [2024-10-14 17:12:10,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:11,049 INFO L124 PetriNetUnfolderBase]: 44/1002 cut-off events. [2024-10-14 17:12:11,050 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2024-10-14 17:12:11,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1036 conditions, 1002 events. 44/1002 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3592 event pairs, 6 based on Foata normal form. 0/812 useless extension candidates. Maximal degree in co-relation 952. Up to 26 conditions per place. [2024-10-14 17:12:11,068 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/727 dead transitions. [2024-10-14 17:12:11,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 727 transitions, 1492 flow [2024-10-14 17:12:11,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:11,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:11,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-10-14 17:12:11,072 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-10-14 17:12:11,072 INFO L175 Difference]: Start difference. First operand has 707 places, 728 transitions, 1464 flow. Second operand 3 states and 2242 transitions. [2024-10-14 17:12:11,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 727 transitions, 1492 flow [2024-10-14 17:12:11,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 727 transitions, 1488 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:11,080 INFO L231 Difference]: Finished difference. Result has 706 places, 727 transitions, 1462 flow [2024-10-14 17:12:11,081 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1458, PETRI_DIFFERENCE_MINUEND_PLACES=704, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=727, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=725, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=727} [2024-10-14 17:12:11,082 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-10-14 17:12:11,082 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 727 transitions, 1462 flow [2024-10-14 17:12:11,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.3333333333334) internal successors, (2230), 3 states have internal predecessors, (2230), 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:11,083 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:11,083 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] [2024-10-14 17:12:11,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:12:11,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:11,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:11,084 INFO L85 PathProgramCache]: Analyzing trace with hash 11741881, now seen corresponding path program 1 times [2024-10-14 17:12:11,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:11,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596891993] [2024-10-14 17:12:11,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:11,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:11,118 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:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:11,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596891993] [2024-10-14 17:12:11,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596891993] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:11,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:11,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:11,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356249597] [2024-10-14 17:12:11,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:11,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:11,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:11,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:11,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:11,147 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-10-14 17:12:11,149 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 727 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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:11,149 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:11,149 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-10-14 17:12:11,149 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:11,238 INFO L124 PetriNetUnfolderBase]: 31/736 cut-off events. [2024-10-14 17:12:11,238 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2024-10-14 17:12:11,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 736 events. 31/736 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2491 event pairs, 5 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 675. Up to 23 conditions per place. [2024-10-14 17:12:11,253 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 12 selfloop transitions, 2 changer transitions 0/726 dead transitions. [2024-10-14 17:12:11,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 726 transitions, 1488 flow [2024-10-14 17:12:11,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:11,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:11,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2244 transitions. [2024-10-14 17:12:11,257 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9664082687338501 [2024-10-14 17:12:11,257 INFO L175 Difference]: Start difference. First operand has 706 places, 727 transitions, 1462 flow. Second operand 3 states and 2244 transitions. [2024-10-14 17:12:11,257 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 726 transitions, 1488 flow [2024-10-14 17:12:11,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 705 places, 726 transitions, 1484 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:11,264 INFO L231 Difference]: Finished difference. Result has 705 places, 726 transitions, 1460 flow [2024-10-14 17:12:11,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1456, PETRI_DIFFERENCE_MINUEND_PLACES=703, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=726, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=724, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1460, PETRI_PLACES=705, PETRI_TRANSITIONS=726} [2024-10-14 17:12:11,266 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -13 predicate places. [2024-10-14 17:12:11,266 INFO L471 AbstractCegarLoop]: Abstraction has has 705 places, 726 transitions, 1460 flow [2024-10-14 17:12:11,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 744.3333333333334) internal successors, (2233), 3 states have internal predecessors, (2233), 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:11,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:11,267 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] [2024-10-14 17:12:11,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:12:11,267 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:11,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:11,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1961828454, now seen corresponding path program 1 times [2024-10-14 17:12:11,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:11,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747592301] [2024-10-14 17:12:11,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:11,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:11,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:11,291 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:11,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:11,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747592301] [2024-10-14 17:12:11,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747592301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:11,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:11,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:11,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245521221] [2024-10-14 17:12:11,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:11,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:11,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:11,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:11,342 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 736 out of 774 [2024-10-14 17:12:11,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 705 places, 726 transitions, 1460 flow. Second operand has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:11,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:11,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 736 of 774 [2024-10-14 17:12:11,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:11,453 INFO L124 PetriNetUnfolderBase]: 50/1000 cut-off events. [2024-10-14 17:12:11,453 INFO L125 PetriNetUnfolderBase]: For 14/15 co-relation queries the response was YES. [2024-10-14 17:12:11,464 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1052 conditions, 1000 events. 50/1000 cut-off events. For 14/15 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4102 event pairs, 12 based on Foata normal form. 0/811 useless extension candidates. Maximal degree in co-relation 952. Up to 44 conditions per place. [2024-10-14 17:12:11,469 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/725 dead transitions. [2024-10-14 17:12:11,469 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 706 places, 725 transitions, 1500 flow [2024-10-14 17:12:11,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:11,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:11,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2230 transitions. [2024-10-14 17:12:11,473 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9603789836347976 [2024-10-14 17:12:11,473 INFO L175 Difference]: Start difference. First operand has 705 places, 726 transitions, 1460 flow. Second operand 3 states and 2230 transitions. [2024-10-14 17:12:11,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 706 places, 725 transitions, 1500 flow [2024-10-14 17:12:11,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 704 places, 725 transitions, 1496 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:11,480 INFO L231 Difference]: Finished difference. Result has 704 places, 725 transitions, 1458 flow [2024-10-14 17:12:11,481 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1454, PETRI_DIFFERENCE_MINUEND_PLACES=702, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=725, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=723, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1458, PETRI_PLACES=704, PETRI_TRANSITIONS=725} [2024-10-14 17:12:11,482 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -14 predicate places. [2024-10-14 17:12:11,482 INFO L471 AbstractCegarLoop]: Abstraction has has 704 places, 725 transitions, 1458 flow [2024-10-14 17:12:11,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 737.3333333333334) internal successors, (2212), 3 states have internal predecessors, (2212), 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:11,483 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:11,483 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] [2024-10-14 17:12:11,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:12:11,484 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:11,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:11,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1079393406, now seen corresponding path program 1 times [2024-10-14 17:12:11,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:11,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549726033] [2024-10-14 17:12:11,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:11,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:11,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:11,847 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:11,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:11,847 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549726033] [2024-10-14 17:12:11,847 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549726033] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:11,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:11,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:12:11,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077099319] [2024-10-14 17:12:11,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:11,848 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:12:11,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:11,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:12:11,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:12:11,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 733 out of 774 [2024-10-14 17:12:11,934 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 704 places, 725 transitions, 1458 flow. Second operand has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 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:11,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:11,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 733 of 774 [2024-10-14 17:12:11,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:12,207 INFO L124 PetriNetUnfolderBase]: 131/2347 cut-off events. [2024-10-14 17:12:12,208 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-10-14 17:12:12,230 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2446 conditions, 2347 events. 131/2347 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 13138 event pairs, 24 based on Foata normal form. 0/1868 useless extension candidates. Maximal degree in co-relation 2339. Up to 84 conditions per place. [2024-10-14 17:12:12,241 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 20 selfloop transitions, 5 changer transitions 0/724 dead transitions. [2024-10-14 17:12:12,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 708 places, 724 transitions, 1506 flow [2024-10-14 17:12:12,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:12:12,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:12:12,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4424 transitions. [2024-10-14 17:12:12,247 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9526270456503014 [2024-10-14 17:12:12,248 INFO L175 Difference]: Start difference. First operand has 704 places, 725 transitions, 1458 flow. Second operand 6 states and 4424 transitions. [2024-10-14 17:12:12,248 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 708 places, 724 transitions, 1506 flow [2024-10-14 17:12:12,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 706 places, 724 transitions, 1502 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:12,255 INFO L231 Difference]: Finished difference. Result has 706 places, 724 transitions, 1462 flow [2024-10-14 17:12:12,256 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1452, PETRI_DIFFERENCE_MINUEND_PLACES=701, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=724, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=706, PETRI_TRANSITIONS=724} [2024-10-14 17:12:12,257 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -12 predicate places. [2024-10-14 17:12:12,257 INFO L471 AbstractCegarLoop]: Abstraction has has 706 places, 724 transitions, 1462 flow [2024-10-14 17:12:12,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 734.5) internal successors, (4407), 6 states have internal predecessors, (4407), 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:12,260 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:12,260 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] [2024-10-14 17:12:12,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:12:12,261 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:12,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1336149471, now seen corresponding path program 1 times [2024-10-14 17:12:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:12,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391689375] [2024-10-14 17:12:12,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:12,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:12,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:12,304 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:12,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:12,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391689375] [2024-10-14 17:12:12,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391689375] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:12,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:12,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:12,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499845161] [2024-10-14 17:12:12,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:12,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:12,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:12,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:12,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:12,318 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-10-14 17:12:12,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 706 places, 724 transitions, 1462 flow. Second operand has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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:12,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:12,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-10-14 17:12:12,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:12,587 INFO L124 PetriNetUnfolderBase]: 52/1222 cut-off events. [2024-10-14 17:12:12,587 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-10-14 17:12:12,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1252 conditions, 1222 events. 52/1222 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 4256 event pairs, 3 based on Foata normal form. 0/991 useless extension candidates. Maximal degree in co-relation 1234. Up to 18 conditions per place. [2024-10-14 17:12:12,619 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 9 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-10-14 17:12:12,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 707 places, 723 transitions, 1482 flow [2024-10-14 17:12:12,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:12,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2250 transitions. [2024-10-14 17:12:12,623 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9689922480620154 [2024-10-14 17:12:12,623 INFO L175 Difference]: Start difference. First operand has 706 places, 724 transitions, 1462 flow. Second operand 3 states and 2250 transitions. [2024-10-14 17:12:12,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 707 places, 723 transitions, 1482 flow [2024-10-14 17:12:12,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 702 places, 723 transitions, 1472 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:12:12,632 INFO L231 Difference]: Finished difference. Result has 702 places, 723 transitions, 1454 flow [2024-10-14 17:12:12,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=700, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=723, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=721, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1454, PETRI_PLACES=702, PETRI_TRANSITIONS=723} [2024-10-14 17:12:12,634 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -16 predicate places. [2024-10-14 17:12:12,634 INFO L471 AbstractCegarLoop]: Abstraction has has 702 places, 723 transitions, 1454 flow [2024-10-14 17:12:12,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.3333333333334) internal successors, (2242), 3 states have internal predecessors, (2242), 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:12,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:12,636 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:12,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:12:12,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:12,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:12,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1486570270, now seen corresponding path program 1 times [2024-10-14 17:12:12,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:12,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278084070] [2024-10-14 17:12:12,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:12,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:12,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:12,673 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:12,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:12,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278084070] [2024-10-14 17:12:12,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278084070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:12,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:12,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415651263] [2024-10-14 17:12:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:12,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:12,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:12,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:12,700 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-10-14 17:12:12,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 702 places, 723 transitions, 1454 flow. Second operand has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 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:12,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:12,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-10-14 17:12:12,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:12,886 INFO L124 PetriNetUnfolderBase]: 59/1274 cut-off events. [2024-10-14 17:12:12,887 INFO L125 PetriNetUnfolderBase]: For 2/8 co-relation queries the response was YES. [2024-10-14 17:12:12,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1322 conditions, 1274 events. 59/1274 cut-off events. For 2/8 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 5967 event pairs, 2 based on Foata normal form. 1/1035 useless extension candidates. Maximal degree in co-relation 1167. Up to 27 conditions per place. [2024-10-14 17:12:12,908 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/723 dead transitions. [2024-10-14 17:12:12,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 703 places, 723 transitions, 1485 flow [2024-10-14 17:12:12,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:12,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:12,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-10-14 17:12:12,912 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-10-14 17:12:12,913 INFO L175 Difference]: Start difference. First operand has 702 places, 723 transitions, 1454 flow. Second operand 3 states and 2248 transitions. [2024-10-14 17:12:12,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 703 places, 723 transitions, 1485 flow [2024-10-14 17:12:12,917 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 701 places, 723 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:12,924 INFO L231 Difference]: Finished difference. Result has 701 places, 722 transitions, 1452 flow [2024-10-14 17:12:12,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=699, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=722, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=720, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1452, PETRI_PLACES=701, PETRI_TRANSITIONS=722} [2024-10-14 17:12:12,926 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -17 predicate places. [2024-10-14 17:12:12,926 INFO L471 AbstractCegarLoop]: Abstraction has has 701 places, 722 transitions, 1452 flow [2024-10-14 17:12:12,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.6666666666666) internal successors, (2237), 3 states have internal predecessors, (2237), 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:12,932 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:12,932 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] [2024-10-14 17:12:12,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:12:12,932 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:12,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:12,932 INFO L85 PathProgramCache]: Analyzing trace with hash 193912122, now seen corresponding path program 1 times [2024-10-14 17:12:12,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:12,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021255820] [2024-10-14 17:12:12,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:12,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:12,977 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:12,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:12,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021255820] [2024-10-14 17:12:12,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021255820] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:12,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:12,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092715384] [2024-10-14 17:12:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:12,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:12,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:12,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:12,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:13,019 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:13,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 701 places, 722 transitions, 1452 flow. Second operand has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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:13,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:13,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:13,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:13,194 INFO L124 PetriNetUnfolderBase]: 65/1273 cut-off events. [2024-10-14 17:12:13,194 INFO L125 PetriNetUnfolderBase]: For 2/11 co-relation queries the response was YES. [2024-10-14 17:12:13,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1345 conditions, 1273 events. 65/1273 cut-off events. For 2/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 5968 event pairs, 13 based on Foata normal form. 1/1036 useless extension candidates. Maximal degree in co-relation 1178. Up to 45 conditions per place. [2024-10-14 17:12:13,214 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/722 dead transitions. [2024-10-14 17:12:13,214 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 702 places, 722 transitions, 1495 flow [2024-10-14 17:12:13,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:13,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:13,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-10-14 17:12:13,218 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-10-14 17:12:13,218 INFO L175 Difference]: Start difference. First operand has 701 places, 722 transitions, 1452 flow. Second operand 3 states and 2236 transitions. [2024-10-14 17:12:13,218 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 702 places, 722 transitions, 1495 flow [2024-10-14 17:12:13,225 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 700 places, 722 transitions, 1491 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:13,230 INFO L231 Difference]: Finished difference. Result has 700 places, 721 transitions, 1450 flow [2024-10-14 17:12:13,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1446, PETRI_DIFFERENCE_MINUEND_PLACES=698, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=721, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=719, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1450, PETRI_PLACES=700, PETRI_TRANSITIONS=721} [2024-10-14 17:12:13,232 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -18 predicate places. [2024-10-14 17:12:13,232 INFO L471 AbstractCegarLoop]: Abstraction has has 700 places, 721 transitions, 1450 flow [2024-10-14 17:12:13,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 739.6666666666666) internal successors, (2219), 3 states have internal predecessors, (2219), 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:13,233 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:13,233 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] [2024-10-14 17:12:13,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:12:13,233 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:13,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:13,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1917880343, now seen corresponding path program 1 times [2024-10-14 17:12:13,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:13,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880619776] [2024-10-14 17:12:13,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:13,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:13,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:13,262 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:13,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:13,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880619776] [2024-10-14 17:12:13,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880619776] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:13,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:13,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:13,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786073325] [2024-10-14 17:12:13,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:13,263 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:13,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:13,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:13,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:13,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-10-14 17:12:13,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 700 places, 721 transitions, 1450 flow. Second operand has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 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:13,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:13,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-10-14 17:12:13,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:13,404 INFO L124 PetriNetUnfolderBase]: 47/998 cut-off events. [2024-10-14 17:12:13,404 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-10-14 17:12:13,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1037 conditions, 998 events. 47/998 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 3599 event pairs, 7 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 865. Up to 27 conditions per place. [2024-10-14 17:12:13,421 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/721 dead transitions. [2024-10-14 17:12:13,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 701 places, 721 transitions, 1481 flow [2024-10-14 17:12:13,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:13,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:13,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2248 transitions. [2024-10-14 17:12:13,425 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9681309216192937 [2024-10-14 17:12:13,425 INFO L175 Difference]: Start difference. First operand has 700 places, 721 transitions, 1450 flow. Second operand 3 states and 2248 transitions. [2024-10-14 17:12:13,425 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 701 places, 721 transitions, 1481 flow [2024-10-14 17:12:13,428 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 699 places, 721 transitions, 1477 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:13,433 INFO L231 Difference]: Finished difference. Result has 699 places, 720 transitions, 1448 flow [2024-10-14 17:12:13,434 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1444, PETRI_DIFFERENCE_MINUEND_PLACES=697, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=720, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=718, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1448, PETRI_PLACES=699, PETRI_TRANSITIONS=720} [2024-10-14 17:12:13,435 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -19 predicate places. [2024-10-14 17:12:13,435 INFO L471 AbstractCegarLoop]: Abstraction has has 699 places, 720 transitions, 1448 flow [2024-10-14 17:12:13,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.0) internal successors, (2238), 3 states have internal predecessors, (2238), 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:13,436 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:13,436 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] [2024-10-14 17:12:13,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:12:13,436 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:13,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:13,436 INFO L85 PathProgramCache]: Analyzing trace with hash 106760103, now seen corresponding path program 1 times [2024-10-14 17:12:13,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:13,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563531855] [2024-10-14 17:12:13,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:13,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:13,463 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:13,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:13,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563531855] [2024-10-14 17:12:13,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563531855] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:13,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:13,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:13,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354163181] [2024-10-14 17:12:13,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:13,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:13,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:13,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-10-14 17:12:13,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 699 places, 720 transitions, 1448 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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:13,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:13,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-10-14 17:12:13,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:14,015 INFO L124 PetriNetUnfolderBase]: 383/5332 cut-off events. [2024-10-14 17:12:14,016 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2024-10-14 17:12:14,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5648 conditions, 5332 events. 383/5332 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 41055 event pairs, 100 based on Foata normal form. 0/4262 useless extension candidates. Maximal degree in co-relation 5179. Up to 296 conditions per place. [2024-10-14 17:12:14,062 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/713 dead transitions. [2024-10-14 17:12:14,062 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 691 places, 713 transitions, 1491 flow [2024-10-14 17:12:14,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-10-14 17:12:14,066 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-10-14 17:12:14,066 INFO L175 Difference]: Start difference. First operand has 699 places, 720 transitions, 1448 flow. Second operand 3 states and 2210 transitions. [2024-10-14 17:12:14,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 691 places, 713 transitions, 1491 flow [2024-10-14 17:12:14,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 689 places, 713 transitions, 1487 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:14,075 INFO L231 Difference]: Finished difference. Result has 690 places, 712 transitions, 1438 flow [2024-10-14 17:12:14,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1424, PETRI_DIFFERENCE_MINUEND_PLACES=687, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=710, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=708, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1438, PETRI_PLACES=690, PETRI_TRANSITIONS=712} [2024-10-14 17:12:14,076 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -28 predicate places. [2024-10-14 17:12:14,077 INFO L471 AbstractCegarLoop]: Abstraction has has 690 places, 712 transitions, 1438 flow [2024-10-14 17:12:14,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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:14,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:14,078 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] [2024-10-14 17:12:14,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:12:14,078 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:14,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:14,078 INFO L85 PathProgramCache]: Analyzing trace with hash -482699703, now seen corresponding path program 1 times [2024-10-14 17:12:14,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:14,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455583749] [2024-10-14 17:12:14,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:14,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:14,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:14,105 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:14,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:14,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455583749] [2024-10-14 17:12:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455583749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:14,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:14,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:14,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025266591] [2024-10-14 17:12:14,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:14,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:14,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:14,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:14,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:14,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 724 out of 774 [2024-10-14 17:12:14,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 690 places, 712 transitions, 1438 flow. Second operand has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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:14,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:14,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 724 of 774 [2024-10-14 17:12:14,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:14,689 INFO L124 PetriNetUnfolderBase]: 398/5526 cut-off events. [2024-10-14 17:12:14,689 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-14 17:12:14,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5857 conditions, 5526 events. 398/5526 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 43228 event pairs, 100 based on Foata normal form. 0/4483 useless extension candidates. Maximal degree in co-relation 5425. Up to 304 conditions per place. [2024-10-14 17:12:14,728 INFO L140 encePairwiseOnDemand]: 762/774 looper letters, 26 selfloop transitions, 2 changer transitions 0/705 dead transitions. [2024-10-14 17:12:14,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 682 places, 705 transitions, 1481 flow [2024-10-14 17:12:14,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:14,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:14,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2210 transitions. [2024-10-14 17:12:14,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9517657192075797 [2024-10-14 17:12:14,731 INFO L175 Difference]: Start difference. First operand has 690 places, 712 transitions, 1438 flow. Second operand 3 states and 2210 transitions. [2024-10-14 17:12:14,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 682 places, 705 transitions, 1481 flow [2024-10-14 17:12:14,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 682 places, 705 transitions, 1481 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:14,739 INFO L231 Difference]: Finished difference. Result has 683 places, 704 transitions, 1432 flow [2024-10-14 17:12:14,739 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=680, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1432, PETRI_PLACES=683, PETRI_TRANSITIONS=704} [2024-10-14 17:12:14,740 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -35 predicate places. [2024-10-14 17:12:14,740 INFO L471 AbstractCegarLoop]: Abstraction has has 683 places, 704 transitions, 1432 flow [2024-10-14 17:12:14,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 725.3333333333334) internal successors, (2176), 3 states have internal predecessors, (2176), 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:14,741 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:14,741 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] [2024-10-14 17:12:14,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:12:14,741 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:14,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:14,741 INFO L85 PathProgramCache]: Analyzing trace with hash 763123450, now seen corresponding path program 1 times [2024-10-14 17:12:14,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:14,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352823930] [2024-10-14 17:12:14,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:14,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:14,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:14,770 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:14,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:14,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352823930] [2024-10-14 17:12:14,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352823930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:14,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:14,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:14,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721456536] [2024-10-14 17:12:14,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:14,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:14,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:14,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:14,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:14,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:14,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 683 places, 704 transitions, 1432 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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:14,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:14,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:14,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:14,958 INFO L124 PetriNetUnfolderBase]: 79/1465 cut-off events. [2024-10-14 17:12:14,959 INFO L125 PetriNetUnfolderBase]: For 17/18 co-relation queries the response was YES. [2024-10-14 17:12:14,971 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1558 conditions, 1465 events. 79/1465 cut-off events. For 17/18 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7725 event pairs, 2 based on Foata normal form. 0/1218 useless extension candidates. Maximal degree in co-relation 1122. Up to 67 conditions per place. [2024-10-14 17:12:14,976 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 19 selfloop transitions, 2 changer transitions 0/704 dead transitions. [2024-10-14 17:12:14,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 684 places, 704 transitions, 1475 flow [2024-10-14 17:12:14,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:14,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:14,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2236 transitions. [2024-10-14 17:12:14,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9629629629629629 [2024-10-14 17:12:14,980 INFO L175 Difference]: Start difference. First operand has 683 places, 704 transitions, 1432 flow. Second operand 3 states and 2236 transitions. [2024-10-14 17:12:14,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 684 places, 704 transitions, 1475 flow [2024-10-14 17:12:14,983 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 684 places, 704 transitions, 1475 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:14,987 INFO L231 Difference]: Finished difference. Result has 684 places, 703 transitions, 1434 flow [2024-10-14 17:12:14,988 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1430, PETRI_DIFFERENCE_MINUEND_PLACES=682, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=684, PETRI_TRANSITIONS=703} [2024-10-14 17:12:14,989 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -34 predicate places. [2024-10-14 17:12:14,989 INFO L471 AbstractCegarLoop]: Abstraction has has 684 places, 703 transitions, 1434 flow [2024-10-14 17:12:14,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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:14,990 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:14,990 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] [2024-10-14 17:12:14,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:12:14,990 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:14,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash -554590367, now seen corresponding path program 1 times [2024-10-14 17:12:14,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:14,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286205383] [2024-10-14 17:12:14,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:15,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:15,022 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:15,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:15,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286205383] [2024-10-14 17:12:15,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286205383] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:15,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:15,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:15,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856053171] [2024-10-14 17:12:15,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:15,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:15,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:15,055 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-10-14 17:12:15,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 684 places, 703 transitions, 1434 flow. Second operand has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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:15,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:15,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-10-14 17:12:15,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:15,292 INFO L124 PetriNetUnfolderBase]: 116/2291 cut-off events. [2024-10-14 17:12:15,292 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-10-14 17:12:15,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2394 conditions, 2291 events. 116/2291 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 12437 event pairs, 4 based on Foata normal form. 0/1908 useless extension candidates. Maximal degree in co-relation 1968. Up to 28 conditions per place. [2024-10-14 17:12:15,313 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 17 selfloop transitions, 9 changer transitions 0/702 dead transitions. [2024-10-14 17:12:15,314 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 702 transitions, 1485 flow [2024-10-14 17:12:15,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:15,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:15,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2228 transitions. [2024-10-14 17:12:15,319 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9595176571920758 [2024-10-14 17:12:15,319 INFO L175 Difference]: Start difference. First operand has 684 places, 703 transitions, 1434 flow. Second operand 3 states and 2228 transitions. [2024-10-14 17:12:15,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 702 transitions, 1485 flow [2024-10-14 17:12:15,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 678 places, 702 transitions, 1481 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:15,328 INFO L231 Difference]: Finished difference. Result has 679 places, 701 transitions, 1461 flow [2024-10-14 17:12:15,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1418, PETRI_DIFFERENCE_MINUEND_PLACES=676, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1461, PETRI_PLACES=679, PETRI_TRANSITIONS=701} [2024-10-14 17:12:15,330 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-10-14 17:12:15,330 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 701 transitions, 1461 flow [2024-10-14 17:12:15,331 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.3333333333334) internal successors, (2200), 3 states have internal predecessors, (2200), 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:15,331 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:15,331 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] [2024-10-14 17:12:15,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:12:15,331 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:15,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:15,332 INFO L85 PathProgramCache]: Analyzing trace with hash 909712816, now seen corresponding path program 1 times [2024-10-14 17:12:15,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:15,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950809432] [2024-10-14 17:12:15,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:15,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:15,366 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:15,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:15,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950809432] [2024-10-14 17:12:15,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950809432] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:15,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:15,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:15,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119234372] [2024-10-14 17:12:15,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:15,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:15,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:15,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:15,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:15,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:12:15,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 701 transitions, 1461 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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:15,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:15,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:12:15,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:15,632 INFO L124 PetriNetUnfolderBase]: 112/2245 cut-off events. [2024-10-14 17:12:15,633 INFO L125 PetriNetUnfolderBase]: For 41/49 co-relation queries the response was YES. [2024-10-14 17:12:15,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2368 conditions, 2245 events. 112/2245 cut-off events. For 41/49 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 14462 event pairs, 10 based on Foata normal form. 1/1876 useless extension candidates. Maximal degree in co-relation 1941. Up to 44 conditions per place. [2024-10-14 17:12:15,657 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 20 selfloop transitions, 3 changer transitions 0/701 dead transitions. [2024-10-14 17:12:15,657 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 680 places, 701 transitions, 1508 flow [2024-10-14 17:12:15,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:15,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:15,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2240 transitions. [2024-10-14 17:12:15,661 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9646856158484065 [2024-10-14 17:12:15,661 INFO L175 Difference]: Start difference. First operand has 679 places, 701 transitions, 1461 flow. Second operand 3 states and 2240 transitions. [2024-10-14 17:12:15,661 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 680 places, 701 transitions, 1508 flow [2024-10-14 17:12:15,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 679 places, 701 transitions, 1499 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:15,671 INFO L231 Difference]: Finished difference. Result has 679 places, 700 transitions, 1456 flow [2024-10-14 17:12:15,672 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1450, PETRI_DIFFERENCE_MINUEND_PLACES=677, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1456, PETRI_PLACES=679, PETRI_TRANSITIONS=700} [2024-10-14 17:12:15,673 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -39 predicate places. [2024-10-14 17:12:15,673 INFO L471 AbstractCegarLoop]: Abstraction has has 679 places, 700 transitions, 1456 flow [2024-10-14 17:12:15,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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:15,673 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:15,673 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] [2024-10-14 17:12:15,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:12:15,674 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:15,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:15,674 INFO L85 PathProgramCache]: Analyzing trace with hash -606276703, now seen corresponding path program 1 times [2024-10-14 17:12:15,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:15,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704526012] [2024-10-14 17:12:15,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:15,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:15,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:15,703 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:15,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:15,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704526012] [2024-10-14 17:12:15,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704526012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:15,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:15,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:15,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895724443] [2024-10-14 17:12:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:15,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:15,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:15,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:15,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:15,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 732 out of 774 [2024-10-14 17:12:15,738 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 679 places, 700 transitions, 1456 flow. Second operand has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 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:15,738 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:15,738 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 732 of 774 [2024-10-14 17:12:15,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:15,886 INFO L124 PetriNetUnfolderBase]: 76/1484 cut-off events. [2024-10-14 17:12:15,886 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2024-10-14 17:12:15,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1605 conditions, 1484 events. 76/1484 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 7785 event pairs, 7 based on Foata normal form. 1/1268 useless extension candidates. Maximal degree in co-relation 1154. Up to 43 conditions per place. [2024-10-14 17:12:15,904 INFO L140 encePairwiseOnDemand]: 759/774 looper letters, 13 selfloop transitions, 8 changer transitions 13/699 dead transitions. [2024-10-14 17:12:15,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 675 places, 699 transitions, 1505 flow [2024-10-14 17:12:15,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:15,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:15,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2227 transitions. [2024-10-14 17:12:15,908 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.959086993970715 [2024-10-14 17:12:15,908 INFO L175 Difference]: Start difference. First operand has 679 places, 700 transitions, 1456 flow. Second operand 3 states and 2227 transitions. [2024-10-14 17:12:15,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 675 places, 699 transitions, 1505 flow [2024-10-14 17:12:15,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 673 places, 699 transitions, 1499 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:15,916 INFO L231 Difference]: Finished difference. Result has 674 places, 685 transitions, 1449 flow [2024-10-14 17:12:15,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1438, PETRI_DIFFERENCE_MINUEND_PLACES=671, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=686, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1449, PETRI_PLACES=674, PETRI_TRANSITIONS=685} [2024-10-14 17:12:15,917 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -44 predicate places. [2024-10-14 17:12:15,917 INFO L471 AbstractCegarLoop]: Abstraction has has 674 places, 685 transitions, 1449 flow [2024-10-14 17:12:15,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 733.6666666666666) internal successors, (2201), 3 states have internal predecessors, (2201), 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:15,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:15,918 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] [2024-10-14 17:12:15,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:12:15,918 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:15,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:15,918 INFO L85 PathProgramCache]: Analyzing trace with hash -1279355931, now seen corresponding path program 1 times [2024-10-14 17:12:15,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:15,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633981114] [2024-10-14 17:12:15,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:15,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:15,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:15,944 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:15,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:15,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633981114] [2024-10-14 17:12:15,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633981114] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:15,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:15,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:15,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958568918] [2024-10-14 17:12:15,945 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:15,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:15,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:15,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:15,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:15,983 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:12:15,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 674 places, 685 transitions, 1449 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:15,984 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:15,984 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:12:15,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:16,183 INFO L124 PetriNetUnfolderBase]: 75/1468 cut-off events. [2024-10-14 17:12:16,184 INFO L125 PetriNetUnfolderBase]: For 85/86 co-relation queries the response was YES. [2024-10-14 17:12:16,194 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1646 conditions, 1468 events. 75/1468 cut-off events. For 85/86 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7636 event pairs, 10 based on Foata normal form. 0/1253 useless extension candidates. Maximal degree in co-relation 1419. Up to 67 conditions per place. [2024-10-14 17:12:16,199 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/685 dead transitions. [2024-10-14 17:12:16,200 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 685 transitions, 1490 flow [2024-10-14 17:12:16,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:16,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-10-14 17:12:16,204 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-10-14 17:12:16,204 INFO L175 Difference]: Start difference. First operand has 674 places, 685 transitions, 1449 flow. Second operand 3 states and 2237 transitions. [2024-10-14 17:12:16,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 685 transitions, 1490 flow [2024-10-14 17:12:16,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 685 transitions, 1482 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:16,213 INFO L231 Difference]: Finished difference. Result has 662 places, 684 transitions, 1445 flow [2024-10-14 17:12:16,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=681, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1445, PETRI_PLACES=662, PETRI_TRANSITIONS=684} [2024-10-14 17:12:16,215 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-10-14 17:12:16,215 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 684 transitions, 1445 flow [2024-10-14 17:12:16,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:16,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:16,216 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:12:16,216 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:16,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:16,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1167645847, now seen corresponding path program 1 times [2024-10-14 17:12:16,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:16,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160221669] [2024-10-14 17:12:16,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:16,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:16,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:16,254 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:16,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:16,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160221669] [2024-10-14 17:12:16,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160221669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:16,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:16,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:12:16,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946022758] [2024-10-14 17:12:16,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:16,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:16,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:16,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:16,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:16,284 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-10-14 17:12:16,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 684 transitions, 1445 flow. Second operand has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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:16,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:16,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-10-14 17:12:16,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:17,083 INFO L124 PetriNetUnfolderBase]: 227/4868 cut-off events. [2024-10-14 17:12:17,083 INFO L125 PetriNetUnfolderBase]: For 24/25 co-relation queries the response was YES. [2024-10-14 17:12:17,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5207 conditions, 4868 events. 227/4868 cut-off events. For 24/25 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41496 event pairs, 12 based on Foata normal form. 0/4091 useless extension candidates. Maximal degree in co-relation 4505. Up to 99 conditions per place. [2024-10-14 17:12:17,161 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 17 selfloop transitions, 4 changer transitions 0/690 dead transitions. [2024-10-14 17:12:17,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 664 places, 690 transitions, 1501 flow [2024-10-14 17:12:17,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:17,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:17,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2254 transitions. [2024-10-14 17:12:17,165 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.970714900947459 [2024-10-14 17:12:17,165 INFO L175 Difference]: Start difference. First operand has 662 places, 684 transitions, 1445 flow. Second operand 3 states and 2254 transitions. [2024-10-14 17:12:17,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 664 places, 690 transitions, 1501 flow [2024-10-14 17:12:17,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 690 transitions, 1495 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:17,173 INFO L231 Difference]: Finished difference. Result has 664 places, 688 transitions, 1479 flow [2024-10-14 17:12:17,173 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1439, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=684, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1479, PETRI_PLACES=664, PETRI_TRANSITIONS=688} [2024-10-14 17:12:17,174 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-10-14 17:12:17,174 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 688 transitions, 1479 flow [2024-10-14 17:12:17,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 745.3333333333334) internal successors, (2236), 3 states have internal predecessors, (2236), 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:17,175 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:17,175 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] [2024-10-14 17:12:17,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:12:17,175 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:17,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:17,176 INFO L85 PathProgramCache]: Analyzing trace with hash 305042375, now seen corresponding path program 1 times [2024-10-14 17:12:17,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:17,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507109029] [2024-10-14 17:12:17,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:17,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:17,202 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:17,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:17,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507109029] [2024-10-14 17:12:17,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507109029] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:17,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:17,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:17,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66041734] [2024-10-14 17:12:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:17,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:17,240 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-10-14 17:12:17,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 688 transitions, 1479 flow. Second operand has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 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:17,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:17,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-10-14 17:12:17,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:18,047 INFO L124 PetriNetUnfolderBase]: 317/6361 cut-off events. [2024-10-14 17:12:18,047 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-10-14 17:12:18,097 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6974 conditions, 6361 events. 317/6361 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 56104 event pairs, 15 based on Foata normal form. 0/5415 useless extension candidates. Maximal degree in co-relation 5735. Up to 138 conditions per place. [2024-10-14 17:12:18,115 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/685 dead transitions. [2024-10-14 17:12:18,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 685 transitions, 1532 flow [2024-10-14 17:12:18,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:18,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-10-14 17:12:18,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-10-14 17:12:18,118 INFO L175 Difference]: Start difference. First operand has 664 places, 688 transitions, 1479 flow. Second operand 3 states and 2215 transitions. [2024-10-14 17:12:18,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 685 transitions, 1532 flow [2024-10-14 17:12:18,121 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 685 transitions, 1528 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:18,125 INFO L231 Difference]: Finished difference. Result has 659 places, 684 transitions, 1511 flow [2024-10-14 17:12:18,126 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1459, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1511, PETRI_PLACES=659, PETRI_TRANSITIONS=684} [2024-10-14 17:12:18,126 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-10-14 17:12:18,126 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 684 transitions, 1511 flow [2024-10-14 17:12:18,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 727.6666666666666) internal successors, (2183), 3 states have internal predecessors, (2183), 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:18,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:18,127 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] [2024-10-14 17:12:18,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:12:18,127 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:18,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:18,128 INFO L85 PathProgramCache]: Analyzing trace with hash -425129412, now seen corresponding path program 1 times [2024-10-14 17:12:18,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:18,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378072599] [2024-10-14 17:12:18,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:18,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:18,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:18,151 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:18,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:18,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378072599] [2024-10-14 17:12:18,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378072599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:18,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:18,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:18,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124688041] [2024-10-14 17:12:18,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:18,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:18,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:18,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:18,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:18,196 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:18,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 684 transitions, 1511 flow. Second operand has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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:18,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:18,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:18,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:19,135 INFO L124 PetriNetUnfolderBase]: 298/6252 cut-off events. [2024-10-14 17:12:19,135 INFO L125 PetriNetUnfolderBase]: For 165/165 co-relation queries the response was YES. [2024-10-14 17:12:19,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6917 conditions, 6252 events. 298/6252 cut-off events. For 165/165 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 60153 event pairs, 32 based on Foata normal form. 0/5301 useless extension candidates. Maximal degree in co-relation 5677. Up to 122 conditions per place. [2024-10-14 17:12:19,198 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/684 dead transitions. [2024-10-14 17:12:19,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 684 transitions, 1560 flow [2024-10-14 17:12:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:19,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-10-14 17:12:19,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-10-14 17:12:19,202 INFO L175 Difference]: Start difference. First operand has 659 places, 684 transitions, 1511 flow. Second operand 3 states and 2235 transitions. [2024-10-14 17:12:19,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 684 transitions, 1560 flow [2024-10-14 17:12:19,205 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 684 transitions, 1542 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:19,210 INFO L231 Difference]: Finished difference. Result has 658 places, 683 transitions, 1497 flow [2024-10-14 17:12:19,210 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=683, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=680, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=658, PETRI_TRANSITIONS=683} [2024-10-14 17:12:19,211 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-10-14 17:12:19,211 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 683 transitions, 1497 flow [2024-10-14 17:12:19,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.0) internal successors, (2220), 3 states have internal predecessors, (2220), 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:19,211 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:19,212 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] [2024-10-14 17:12:19,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 17:12:19,212 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:19,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:19,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1119298151, now seen corresponding path program 1 times [2024-10-14 17:12:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:19,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868654309] [2024-10-14 17:12:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:19,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:19,284 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:19,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:19,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868654309] [2024-10-14 17:12:19,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868654309] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:19,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:19,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:19,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74284] [2024-10-14 17:12:19,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:19,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:19,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:19,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:19,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:19,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 726 out of 774 [2024-10-14 17:12:19,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 683 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 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:19,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:19,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 726 of 774 [2024-10-14 17:12:19,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:20,595 INFO L124 PetriNetUnfolderBase]: 318/5797 cut-off events. [2024-10-14 17:12:20,596 INFO L125 PetriNetUnfolderBase]: For 86/88 co-relation queries the response was YES. [2024-10-14 17:12:20,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6560 conditions, 5797 events. 318/5797 cut-off events. For 86/88 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 55947 event pairs, 16 based on Foata normal form. 0/4977 useless extension candidates. Maximal degree in co-relation 5688. Up to 262 conditions per place. [2024-10-14 17:12:20,647 INFO L140 encePairwiseOnDemand]: 757/774 looper letters, 20 selfloop transitions, 9 changer transitions 0/680 dead transitions. [2024-10-14 17:12:20,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 680 transitions, 1550 flow [2024-10-14 17:12:20,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:20,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2215 transitions. [2024-10-14 17:12:20,651 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9539190353143842 [2024-10-14 17:12:20,651 INFO L175 Difference]: Start difference. First operand has 658 places, 683 transitions, 1497 flow. Second operand 3 states and 2215 transitions. [2024-10-14 17:12:20,651 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 680 transitions, 1550 flow [2024-10-14 17:12:20,654 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 650 places, 680 transitions, 1544 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:20,659 INFO L231 Difference]: Finished difference. Result has 652 places, 679 transitions, 1527 flow [2024-10-14 17:12:20,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1475, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=675, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1527, PETRI_PLACES=652, PETRI_TRANSITIONS=679} [2024-10-14 17:12:20,660 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -66 predicate places. [2024-10-14 17:12:20,660 INFO L471 AbstractCegarLoop]: Abstraction has has 652 places, 679 transitions, 1527 flow [2024-10-14 17:12:20,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 728.0) internal successors, (2184), 3 states have internal predecessors, (2184), 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:20,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:20,665 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] [2024-10-14 17:12:20,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 17:12:20,665 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:20,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:20,665 INFO L85 PathProgramCache]: Analyzing trace with hash -953003855, now seen corresponding path program 1 times [2024-10-14 17:12:20,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:20,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159569888] [2024-10-14 17:12:20,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:20,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:20,713 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:20,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:20,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159569888] [2024-10-14 17:12:20,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159569888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:20,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:20,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:20,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990635925] [2024-10-14 17:12:20,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:20,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:20,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:20,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:20,775 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:12:20,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 652 places, 679 transitions, 1527 flow. Second operand has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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:20,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:20,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:12:20,785 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:21,765 INFO L124 PetriNetUnfolderBase]: 300/5767 cut-off events. [2024-10-14 17:12:21,766 INFO L125 PetriNetUnfolderBase]: For 370/372 co-relation queries the response was YES. [2024-10-14 17:12:21,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6681 conditions, 5767 events. 300/5767 cut-off events. For 370/372 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 55050 event pairs, 35 based on Foata normal form. 0/4963 useless extension candidates. Maximal degree in co-relation 5780. Up to 235 conditions per place. [2024-10-14 17:12:21,885 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/679 dead transitions. [2024-10-14 17:12:21,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 653 places, 679 transitions, 1576 flow [2024-10-14 17:12:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:21,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:21,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-10-14 17:12:21,890 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-10-14 17:12:21,891 INFO L175 Difference]: Start difference. First operand has 652 places, 679 transitions, 1527 flow. Second operand 3 states and 2235 transitions. [2024-10-14 17:12:21,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 653 places, 679 transitions, 1576 flow [2024-10-14 17:12:21,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 651 places, 679 transitions, 1558 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:21,906 INFO L231 Difference]: Finished difference. Result has 651 places, 678 transitions, 1513 flow [2024-10-14 17:12:21,906 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1507, PETRI_DIFFERENCE_MINUEND_PLACES=649, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=678, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1513, PETRI_PLACES=651, PETRI_TRANSITIONS=678} [2024-10-14 17:12:21,907 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -67 predicate places. [2024-10-14 17:12:21,907 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 678 transitions, 1513 flow [2024-10-14 17:12:21,908 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.3333333333334) internal successors, (2221), 3 states have internal predecessors, (2221), 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:21,911 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:21,911 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] [2024-10-14 17:12:21,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 17:12:21,911 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread1Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:21,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:21,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1435016231, now seen corresponding path program 1 times [2024-10-14 17:12:21,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:21,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693670786] [2024-10-14 17:12:21,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:21,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:21,971 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:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:21,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693670786] [2024-10-14 17:12:21,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693670786] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:21,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:21,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102987071] [2024-10-14 17:12:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:21,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:21,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:21,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:22,001 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:12:22,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 651 places, 678 transitions, 1513 flow. Second operand has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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:22,006 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:22,006 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:12:22,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:23,321 INFO L124 PetriNetUnfolderBase]: 263/5685 cut-off events. [2024-10-14 17:12:23,322 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-10-14 17:12:23,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6400 conditions, 5685 events. 263/5685 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 54350 event pairs, 9 based on Foata normal form. 0/4946 useless extension candidates. Maximal degree in co-relation 5448. Up to 106 conditions per place. [2024-10-14 17:12:23,429 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-10-14 17:12:23,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 649 places, 675 transitions, 1538 flow [2024-10-14 17:12:23,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:23,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-10-14 17:12:23,432 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-10-14 17:12:23,433 INFO L175 Difference]: Start difference. First operand has 651 places, 678 transitions, 1513 flow. Second operand 3 states and 2239 transitions. [2024-10-14 17:12:23,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 649 places, 675 transitions, 1538 flow [2024-10-14 17:12:23,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 647 places, 675 transitions, 1532 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:23,443 INFO L231 Difference]: Finished difference. Result has 647 places, 674 transitions, 1505 flow [2024-10-14 17:12:23,444 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=645, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=647, PETRI_TRANSITIONS=674} [2024-10-14 17:12:23,448 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -71 predicate places. [2024-10-14 17:12:23,448 INFO L471 AbstractCegarLoop]: Abstraction has has 647 places, 674 transitions, 1505 flow [2024-10-14 17:12:23,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.6666666666666) internal successors, (2225), 3 states have internal predecessors, (2225), 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:23,449 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:23,449 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] [2024-10-14 17:12:23,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 17:12:23,449 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:23,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:23,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1561939652, now seen corresponding path program 1 times [2024-10-14 17:12:23,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:23,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76477616] [2024-10-14 17:12:23,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:23,526 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:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:23,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76477616] [2024-10-14 17:12:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76477616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:23,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:23,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460538160] [2024-10-14 17:12:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:23,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:23,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:23,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:23,561 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:12:23,563 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 647 places, 674 transitions, 1505 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:23,566 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:23,566 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:12:23,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:24,754 INFO L124 PetriNetUnfolderBase]: 291/5673 cut-off events. [2024-10-14 17:12:24,755 INFO L125 PetriNetUnfolderBase]: For 52/54 co-relation queries the response was YES. [2024-10-14 17:12:24,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6434 conditions, 5673 events. 291/5673 cut-off events. For 52/54 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 53536 event pairs, 12 based on Foata normal form. 0/4965 useless extension candidates. Maximal degree in co-relation 5570. Up to 162 conditions per place. [2024-10-14 17:12:24,864 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 12 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-10-14 17:12:24,864 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 645 places, 671 transitions, 1530 flow [2024-10-14 17:12:24,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:24,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2239 transitions. [2024-10-14 17:12:24,868 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9642549526270456 [2024-10-14 17:12:24,868 INFO L175 Difference]: Start difference. First operand has 647 places, 674 transitions, 1505 flow. Second operand 3 states and 2239 transitions. [2024-10-14 17:12:24,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 645 places, 671 transitions, 1530 flow [2024-10-14 17:12:24,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 671 transitions, 1524 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:24,881 INFO L231 Difference]: Finished difference. Result has 643 places, 670 transitions, 1497 flow [2024-10-14 17:12:24,881 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1491, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1497, PETRI_PLACES=643, PETRI_TRANSITIONS=670} [2024-10-14 17:12:24,883 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-10-14 17:12:24,884 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 670 transitions, 1497 flow [2024-10-14 17:12:24,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:24,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:24,885 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] [2024-10-14 17:12:24,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 17:12:24,885 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:24,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:24,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1286364741, now seen corresponding path program 1 times [2024-10-14 17:12:24,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:24,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199759400] [2024-10-14 17:12:24,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:24,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:24,964 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:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199759400] [2024-10-14 17:12:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199759400] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:24,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:24,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527866675] [2024-10-14 17:12:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:24,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:24,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:24,980 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-10-14 17:12:24,984 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 670 transitions, 1497 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:24,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:24,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-10-14 17:12:24,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:26,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 382#L76-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,525 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-10-14 17:12:26,525 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-10-14 17:12:26,525 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,525 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,525 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,525 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-10-14 17:12:26,525 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-10-14 17:12:26,525 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-10-14 17:12:26,525 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-10-14 17:12:26,527 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 382#L76-1true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,527 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-10-14 17:12:26,527 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-10-14 17:12:26,527 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,527 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,539 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 406#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 382#L76-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,539 INFO L294 olderBase$Statistics]: this new event has 337 ancestors and is cut-off event [2024-10-14 17:12:26,539 INFO L297 olderBase$Statistics]: existing Event has 247 ancestors and is cut-off event [2024-10-14 17:12:26,540 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-10-14 17:12:26,540 INFO L297 olderBase$Statistics]: existing Event has 251 ancestors and is cut-off event [2024-10-14 17:12:26,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 829#true, 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,556 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-10-14 17:12:26,556 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,556 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,556 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 829#true, 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,556 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:26,556 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:26,557 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,557 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,557 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,557 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:26,557 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,557 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:26,557 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,558 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,558 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-10-14 17:12:26,558 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,558 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,558 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,559 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 382#L76-1true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,559 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:26,559 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,559 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:26,559 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,561 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,561 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:26,561 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,561 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,561 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:26,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 406#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 382#L76-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,568 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-10-14 17:12:26,568 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,568 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,568 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,570 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), 406#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,570 INFO L294 olderBase$Statistics]: this new event has 340 ancestors and is cut-off event [2024-10-14 17:12:26,570 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:26,570 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,570 INFO L297 olderBase$Statistics]: existing Event has 254 ancestors and is cut-off event [2024-10-14 17:12:26,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 829#true, 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,584 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-10-14 17:12:26,584 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-14 17:12:26,584 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,588 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-14 17:12:26,588 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][518], [Black: 829#true, 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,588 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-10-14 17:12:26,588 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-10-14 17:12:26,588 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:26,588 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:26,590 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [614#L55-1true, Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,590 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-10-14 17:12:26,590 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:26,590 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-10-14 17:12:26,590 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:26,617 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, 406#L55-2true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,617 INFO L294 olderBase$Statistics]: this new event has 343 ancestors and is cut-off event [2024-10-14 17:12:26,617 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:26,617 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-14 17:12:26,617 INFO L297 olderBase$Statistics]: existing Event has 257 ancestors and is cut-off event [2024-10-14 17:12:26,690 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,691 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-14 17:12:26,691 INFO L297 olderBase$Statistics]: existing Event has 263 ancestors and is cut-off event [2024-10-14 17:12:26,691 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-10-14 17:12:26,691 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-10-14 17:12:26,691 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,691 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-10-14 17:12:26,691 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-10-14 17:12:26,691 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-10-14 17:12:26,692 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-10-14 17:12:26,702 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 831#(= |#race~break_10~0| 0), Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,702 INFO L294 olderBase$Statistics]: this new event has 353 ancestors and is cut-off event [2024-10-14 17:12:26,702 INFO L297 olderBase$Statistics]: existing Event has 353 ancestors and is cut-off event [2024-10-14 17:12:26,702 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-14 17:12:26,702 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-14 17:12:26,708 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), 619#L76-2true, Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-10-14 17:12:26,708 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-10-14 17:12:26,708 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-10-14 17:12:26,708 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-10-14 17:12:26,708 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-10-14 17:12:26,709 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2275] thread1EXIT-->L109-1: Formula: (and (= v_thread1Thread1of1ForFork0_thidvar1_4 0) (= (let ((.cse0 (mod |v_ULTIMATE.start_main_~t1~0#1_6| 4294967296))) (ite (<= .cse0 2147483647) .cse0 (+ .cse0 (- 4294967296)))) v_thread1Thread1of1ForFork0_thidvar0_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork0_thidvar0=v_thread1Thread1of1ForFork0_thidvar0_4, thread1Thread1of1ForFork0_thidvar1=v_thread1Thread1of1ForFork0_thidvar1_4} AuxVars[] AssignedVars[][519], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), 531#L109-1true, Black: 795#true]) [2024-10-14 17:12:26,709 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-10-14 17:12:26,709 INFO L297 olderBase$Statistics]: existing Event has 266 ancestors and is cut-off event [2024-10-14 17:12:26,709 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-10-14 17:12:26,709 INFO L297 olderBase$Statistics]: existing Event has 270 ancestors and is cut-off event [2024-10-14 17:12:26,717 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][513], [Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), 842#(= |#race~i_8~0| 0), 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 531#L109-1true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:26,717 INFO L294 olderBase$Statistics]: this new event has 356 ancestors and is cut-off event [2024-10-14 17:12:26,717 INFO L297 olderBase$Statistics]: existing Event has 356 ancestors and is cut-off event [2024-10-14 17:12:26,717 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-14 17:12:26,717 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-14 17:12:26,772 INFO L124 PetriNetUnfolderBase]: 565/10661 cut-off events. [2024-10-14 17:12:26,772 INFO L125 PetriNetUnfolderBase]: For 36/38 co-relation queries the response was YES. [2024-10-14 17:12:26,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11965 conditions, 10661 events. 565/10661 cut-off events. For 36/38 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 107737 event pairs, 22 based on Foata normal form. 0/9336 useless extension candidates. Maximal degree in co-relation 10879. Up to 298 conditions per place. [2024-10-14 17:12:26,912 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 2 changer transitions 0/672 dead transitions. [2024-10-14 17:12:26,912 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 672 transitions, 1527 flow [2024-10-14 17:12:26,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:26,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:26,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-10-14 17:12:26,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-10-14 17:12:26,914 INFO L175 Difference]: Start difference. First operand has 643 places, 670 transitions, 1497 flow. Second operand 3 states and 2258 transitions. [2024-10-14 17:12:26,914 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 672 transitions, 1527 flow [2024-10-14 17:12:26,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 641 places, 672 transitions, 1521 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:26,923 INFO L231 Difference]: Finished difference. Result has 642 places, 670 transitions, 1501 flow [2024-10-14 17:12:26,924 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1487, PETRI_DIFFERENCE_MINUEND_PLACES=639, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=668, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1501, PETRI_PLACES=642, PETRI_TRANSITIONS=670} [2024-10-14 17:12:26,924 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -76 predicate places. [2024-10-14 17:12:26,924 INFO L471 AbstractCegarLoop]: Abstraction has has 642 places, 670 transitions, 1501 flow [2024-10-14 17:12:26,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:26,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:26,925 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] [2024-10-14 17:12:26,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 17:12:26,926 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread1Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:26,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:26,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1638973717, now seen corresponding path program 1 times [2024-10-14 17:12:26,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:26,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691796867] [2024-10-14 17:12:26,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:26,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:26,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:26,991 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:26,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:26,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691796867] [2024-10-14 17:12:26,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691796867] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:26,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:26,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:26,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777943040] [2024-10-14 17:12:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:26,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:26,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:26,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:26,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:27,053 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:12:27,055 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 642 places, 670 transitions, 1501 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:27,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:27,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:12:27,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:28,299 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:28,299 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:28,300 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:28,300 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:28,300 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:28,300 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:28,300 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-10-14 17:12:28,300 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-10-14 17:12:28,300 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:28,300 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:28,356 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [614#L55-1true, Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:28,356 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-10-14 17:12:28,356 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:28,356 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-10-14 17:12:28,357 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:28,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([1820] L55-->L55-1: Formula: (= |v_#race~nondet_0~0_1| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_1|} AuxVars[] AssignedVars[#race~nondet_0~0][512], [614#L55-1true, Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:28,357 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:28,357 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:28,357 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:28,357 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:29,013 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:29,013 INFO L294 olderBase$Statistics]: this new event has 336 ancestors and is cut-off event [2024-10-14 17:12:29,013 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:29,013 INFO L297 olderBase$Statistics]: existing Event has 246 ancestors and is cut-off event [2024-10-14 17:12:29,013 INFO L297 olderBase$Statistics]: existing Event has 250 ancestors and is cut-off event [2024-10-14 17:12:29,036 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [614#L55-1true, Black: 829#true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:29,037 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:29,037 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:29,037 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:29,037 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:29,038 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:29,038 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:29,038 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:29,038 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:29,038 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:29,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][517], [Black: 829#true, 614#L55-1true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:29,060 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-10-14 17:12:29,060 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:29,060 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-10-14 17:12:29,060 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:29,185 INFO L124 PetriNetUnfolderBase]: 706/15546 cut-off events. [2024-10-14 17:12:29,185 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2024-10-14 17:12:29,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17503 conditions, 15546 events. 706/15546 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 173667 event pairs, 63 based on Foata normal form. 0/13771 useless extension candidates. Maximal degree in co-relation 16427. Up to 356 conditions per place. [2024-10-14 17:12:29,297 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2024-10-14 17:12:29,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 643 places, 670 transitions, 1542 flow [2024-10-14 17:12:29,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:29,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:29,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-10-14 17:12:29,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-10-14 17:12:29,299 INFO L175 Difference]: Start difference. First operand has 642 places, 670 transitions, 1501 flow. Second operand 3 states and 2237 transitions. [2024-10-14 17:12:29,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 643 places, 670 transitions, 1542 flow [2024-10-14 17:12:29,303 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 643 places, 670 transitions, 1542 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:29,307 INFO L231 Difference]: Finished difference. Result has 643 places, 669 transitions, 1505 flow [2024-10-14 17:12:29,308 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1505, PETRI_PLACES=643, PETRI_TRANSITIONS=669} [2024-10-14 17:12:29,308 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -75 predicate places. [2024-10-14 17:12:29,308 INFO L471 AbstractCegarLoop]: Abstraction has has 643 places, 669 transitions, 1505 flow [2024-10-14 17:12:29,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:29,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:29,309 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 17:12:29,310 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:29,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash 600421044, now seen corresponding path program 1 times [2024-10-14 17:12:29,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:29,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024795979] [2024-10-14 17:12:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:29,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:29,402 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:29,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:29,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024795979] [2024-10-14 17:12:29,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024795979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:29,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:29,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:12:29,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150839663] [2024-10-14 17:12:29,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:29,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:12:29,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:29,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:12:29,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:12:29,435 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-10-14 17:12:29,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 643 places, 669 transitions, 1505 flow. Second operand has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 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:29,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:29,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-10-14 17:12:29,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:30,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:30,600 INFO L294 olderBase$Statistics]: this new event has 339 ancestors and is cut-off event [2024-10-14 17:12:30,600 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:30,600 INFO L297 olderBase$Statistics]: existing Event has 253 ancestors and is cut-off event [2024-10-14 17:12:30,600 INFO L297 olderBase$Statistics]: existing Event has 249 ancestors and is cut-off event [2024-10-14 17:12:30,623 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 829#true, 614#L55-1true, 847#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 852#(= ~i_4~0 0), 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:30,623 INFO L294 olderBase$Statistics]: this new event has 342 ancestors and is cut-off event [2024-10-14 17:12:30,623 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:30,623 INFO L297 olderBase$Statistics]: existing Event has 252 ancestors and is cut-off event [2024-10-14 17:12:30,623 INFO L297 olderBase$Statistics]: existing Event has 256 ancestors and is cut-off event [2024-10-14 17:12:31,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:31,028 INFO L294 olderBase$Statistics]: this new event has 429 ancestors and is cut-off event [2024-10-14 17:12:31,028 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-10-14 17:12:31,028 INFO L297 olderBase$Statistics]: existing Event has 343 ancestors and is cut-off event [2024-10-14 17:12:31,028 INFO L297 olderBase$Statistics]: existing Event has 339 ancestors and is cut-off event [2024-10-14 17:12:31,065 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:31,066 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-10-14 17:12:31,066 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-10-14 17:12:31,066 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-10-14 17:12:31,066 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-10-14 17:12:31,066 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [614#L55-1true, Black: 829#true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:31,066 INFO L294 olderBase$Statistics]: this new event has 432 ancestors and is cut-off event [2024-10-14 17:12:31,066 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-10-14 17:12:31,066 INFO L297 olderBase$Statistics]: existing Event has 346 ancestors and is cut-off event [2024-10-14 17:12:31,066 INFO L297 olderBase$Statistics]: existing Event has 342 ancestors and is cut-off event [2024-10-14 17:12:31,084 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][507], [614#L55-1true, Black: 829#true, 847#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:31,084 INFO L294 olderBase$Statistics]: this new event has 435 ancestors and is cut-off event [2024-10-14 17:12:31,084 INFO L297 olderBase$Statistics]: existing Event has 345 ancestors and is cut-off event [2024-10-14 17:12:31,084 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-10-14 17:12:31,084 INFO L297 olderBase$Statistics]: existing Event has 349 ancestors and is cut-off event [2024-10-14 17:12:31,138 INFO L124 PetriNetUnfolderBase]: 463/10013 cut-off events. [2024-10-14 17:12:31,138 INFO L125 PetriNetUnfolderBase]: For 44/44 co-relation queries the response was YES. [2024-10-14 17:12:31,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11254 conditions, 10013 events. 463/10013 cut-off events. For 44/44 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 92206 event pairs, 26 based on Foata normal form. 0/8837 useless extension candidates. Maximal degree in co-relation 11011. Up to 159 conditions per place. [2024-10-14 17:12:31,333 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 13 selfloop transitions, 8 changer transitions 0/678 dead transitions. [2024-10-14 17:12:31,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 647 places, 678 transitions, 1569 flow [2024-10-14 17:12:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:12:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 17:12:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3752 transitions. [2024-10-14 17:12:31,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9695090439276486 [2024-10-14 17:12:31,336 INFO L175 Difference]: Start difference. First operand has 643 places, 669 transitions, 1505 flow. Second operand 5 states and 3752 transitions. [2024-10-14 17:12:31,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 647 places, 678 transitions, 1569 flow [2024-10-14 17:12:31,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 645 places, 678 transitions, 1563 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:31,352 INFO L231 Difference]: Finished difference. Result has 648 places, 673 transitions, 1545 flow [2024-10-14 17:12:31,353 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=641, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=662, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1545, PETRI_PLACES=648, PETRI_TRANSITIONS=673} [2024-10-14 17:12:31,353 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -70 predicate places. [2024-10-14 17:12:31,354 INFO L471 AbstractCegarLoop]: Abstraction has has 648 places, 673 transitions, 1545 flow [2024-10-14 17:12:31,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 747.75) internal successors, (2991), 4 states have internal predecessors, (2991), 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:31,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:31,358 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] [2024-10-14 17:12:31,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 17:12:31,358 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:31,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:31,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1824687237, now seen corresponding path program 1 times [2024-10-14 17:12:31,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:31,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540267076] [2024-10-14 17:12:31,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:31,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:31,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:31,447 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:31,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:31,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540267076] [2024-10-14 17:12:31,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540267076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:31,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:31,448 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:12:31,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500778375] [2024-10-14 17:12:31,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:31,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:12:31,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:31,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:12:31,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:12:31,495 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-10-14 17:12:31,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 648 places, 673 transitions, 1545 flow. Second operand has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 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:31,497 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:31,497 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-10-14 17:12:31,497 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:32,598 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:32,599 INFO L294 olderBase$Statistics]: this new event has 354 ancestors and is cut-off event [2024-10-14 17:12:32,599 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-10-14 17:12:32,599 INFO L297 olderBase$Statistics]: existing Event has 268 ancestors and is cut-off event [2024-10-14 17:12:32,599 INFO L297 olderBase$Statistics]: existing Event has 264 ancestors and is cut-off event [2024-10-14 17:12:32,621 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [614#L55-1true, Black: 829#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:32,621 INFO L294 olderBase$Statistics]: this new event has 357 ancestors and is cut-off event [2024-10-14 17:12:32,622 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-10-14 17:12:32,622 INFO L297 olderBase$Statistics]: existing Event has 267 ancestors and is cut-off event [2024-10-14 17:12:32,622 INFO L297 olderBase$Statistics]: existing Event has 271 ancestors and is cut-off event [2024-10-14 17:12:32,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:32,986 INFO L294 olderBase$Statistics]: this new event has 444 ancestors and is cut-off event [2024-10-14 17:12:32,986 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-14 17:12:32,986 INFO L297 olderBase$Statistics]: existing Event has 354 ancestors and is cut-off event [2024-10-14 17:12:32,986 INFO L297 olderBase$Statistics]: existing Event has 358 ancestors and is cut-off event [2024-10-14 17:12:32,994 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:32,995 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-10-14 17:12:32,995 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-14 17:12:32,995 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-14 17:12:32,995 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-14 17:12:32,995 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [614#L55-1true, Black: 829#true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:32,996 INFO L294 olderBase$Statistics]: this new event has 447 ancestors and is cut-off event [2024-10-14 17:12:32,996 INFO L297 olderBase$Statistics]: existing Event has 357 ancestors and is cut-off event [2024-10-14 17:12:32,996 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-14 17:12:32,996 INFO L297 olderBase$Statistics]: existing Event has 361 ancestors and is cut-off event [2024-10-14 17:12:33,005 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][506], [Black: 829#true, 614#L55-1true, 850#true, Black: 804#(= |#race~result_3~0| 0), 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:33,006 INFO L294 olderBase$Statistics]: this new event has 450 ancestors and is cut-off event [2024-10-14 17:12:33,006 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-10-14 17:12:33,006 INFO L297 olderBase$Statistics]: existing Event has 364 ancestors and is cut-off event [2024-10-14 17:12:33,006 INFO L297 olderBase$Statistics]: existing Event has 360 ancestors and is cut-off event [2024-10-14 17:12:33,057 INFO L124 PetriNetUnfolderBase]: 399/8981 cut-off events. [2024-10-14 17:12:33,057 INFO L125 PetriNetUnfolderBase]: For 39/43 co-relation queries the response was YES. [2024-10-14 17:12:33,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10021 conditions, 8981 events. 399/8981 cut-off events. For 39/43 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 79863 event pairs, 14 based on Foata normal form. 1/7930 useless extension candidates. Maximal degree in co-relation 9793. Up to 159 conditions per place. [2024-10-14 17:12:33,241 INFO L140 encePairwiseOnDemand]: 767/774 looper letters, 7 selfloop transitions, 6 changer transitions 0/674 dead transitions. [2024-10-14 17:12:33,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 652 places, 674 transitions, 1573 flow [2024-10-14 17:12:33,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:12:33,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 17:12:33,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3744 transitions. [2024-10-14 17:12:33,243 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9674418604651163 [2024-10-14 17:12:33,243 INFO L175 Difference]: Start difference. First operand has 648 places, 673 transitions, 1545 flow. Second operand 5 states and 3744 transitions. [2024-10-14 17:12:33,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 652 places, 674 transitions, 1573 flow [2024-10-14 17:12:33,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 652 places, 674 transitions, 1573 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:33,251 INFO L231 Difference]: Finished difference. Result has 653 places, 674 transitions, 1565 flow [2024-10-14 17:12:33,252 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1545, PETRI_DIFFERENCE_MINUEND_PLACES=648, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1565, PETRI_PLACES=653, PETRI_TRANSITIONS=674} [2024-10-14 17:12:33,252 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -65 predicate places. [2024-10-14 17:12:33,252 INFO L471 AbstractCegarLoop]: Abstraction has has 653 places, 674 transitions, 1565 flow [2024-10-14 17:12:33,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 747.8) internal successors, (3739), 5 states have internal predecessors, (3739), 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:33,253 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:33,253 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] [2024-10-14 17:12:33,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 17:12:33,253 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:33,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:33,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2084869071, now seen corresponding path program 1 times [2024-10-14 17:12:33,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:33,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631566251] [2024-10-14 17:12:33,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:33,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:33,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:33,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631566251] [2024-10-14 17:12:33,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631566251] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 17:12:33,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468085205] [2024-10-14 17:12:33,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:33,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 17:12:33,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:12:33,344 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 17:12:33,345 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 17:12:33,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:33,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 17:12:33,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 17:12:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:33,600 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 17:12:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:33,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468085205] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 17:12:33,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 17:12:33,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-10-14 17:12:33,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513792163] [2024-10-14 17:12:33,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 17:12:33,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-14 17:12:33,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:33,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-14 17:12:33,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-14 17:12:33,813 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 743 out of 774 [2024-10-14 17:12:33,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 653 places, 674 transitions, 1565 flow. Second operand has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 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:33,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:33,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 743 of 774 [2024-10-14 17:12:33,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:35,244 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:35,244 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-10-14 17:12:35,244 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-10-14 17:12:35,244 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-10-14 17:12:35,244 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-14 17:12:35,264 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 829#true, 614#L55-1true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 852#(= ~i_4~0 0), Black: 850#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:35,265 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-10-14 17:12:35,265 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-14 17:12:35,265 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-14 17:12:35,265 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-10-14 17:12:35,538 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, Black: 816#true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:35,538 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-10-14 17:12:35,538 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-10-14 17:12:35,539 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-10-14 17:12:35,539 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-10-14 17:12:35,546 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:35,546 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-10-14 17:12:35,547 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:35,547 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:35,547 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-10-14 17:12:35,547 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [614#L55-1true, Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, Black: 816#true, 382#L76-1true, Black: 823#(= |#race~break_6~0| 0), 845#(= |#race~nondet_0~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:35,547 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-10-14 17:12:35,548 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:35,548 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-10-14 17:12:35,548 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:35,556 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][514], [614#L55-1true, Black: 829#true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 843#true, 859#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), Black: 791#true, 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:35,556 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-10-14 17:12:35,556 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-10-14 17:12:35,556 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-10-14 17:12:35,556 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-10-14 17:12:35,603 INFO L124 PetriNetUnfolderBase]: 399/8998 cut-off events. [2024-10-14 17:12:35,603 INFO L125 PetriNetUnfolderBase]: For 44/48 co-relation queries the response was YES. [2024-10-14 17:12:35,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10061 conditions, 8998 events. 399/8998 cut-off events. For 44/48 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 79826 event pairs, 14 based on Foata normal form. 2/7948 useless extension candidates. Maximal degree in co-relation 9847. Up to 159 conditions per place. [2024-10-14 17:12:35,756 INFO L140 encePairwiseOnDemand]: 764/774 looper letters, 11 selfloop transitions, 13 changer transitions 0/682 dead transitions. [2024-10-14 17:12:35,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 682 transitions, 1631 flow [2024-10-14 17:12:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 17:12:35,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-10-14 17:12:35,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 8199 transitions. [2024-10-14 17:12:35,759 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9630021141649049 [2024-10-14 17:12:35,760 INFO L175 Difference]: Start difference. First operand has 653 places, 674 transitions, 1565 flow. Second operand 11 states and 8199 transitions. [2024-10-14 17:12:35,760 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 682 transitions, 1631 flow [2024-10-14 17:12:35,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 682 transitions, 1621 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-10-14 17:12:35,767 INFO L231 Difference]: Finished difference. Result has 663 places, 680 transitions, 1615 flow [2024-10-14 17:12:35,768 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1555, PETRI_DIFFERENCE_MINUEND_PLACES=650, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=674, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1615, PETRI_PLACES=663, PETRI_TRANSITIONS=680} [2024-10-14 17:12:35,768 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -55 predicate places. [2024-10-14 17:12:35,768 INFO L471 AbstractCegarLoop]: Abstraction has has 663 places, 680 transitions, 1615 flow [2024-10-14 17:12:35,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 745.0) internal successors, (10430), 14 states have internal predecessors, (10430), 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:35,769 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:35,770 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:35,784 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 17:12:35,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable33 [2024-10-14 17:12:35,975 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:35,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:35,975 INFO L85 PathProgramCache]: Analyzing trace with hash 666138895, now seen corresponding path program 2 times [2024-10-14 17:12:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:35,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130758436] [2024-10-14 17:12:35,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:35,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:36,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130758436] [2024-10-14 17:12:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130758436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:12:36,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033806113] [2024-10-14 17:12:36,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:36,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:12:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:36,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:12:36,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:12:36,445 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-10-14 17:12:36,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 663 places, 680 transitions, 1615 flow. Second operand has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 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:36,446 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:36,446 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-10-14 17:12:36,446 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:38,027 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 503#L108-4true, Black: 816#true, 382#L76-1true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:38,027 INFO L294 olderBase$Statistics]: this new event has 384 ancestors and is cut-off event [2024-10-14 17:12:38,027 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-10-14 17:12:38,027 INFO L297 olderBase$Statistics]: existing Event has 298 ancestors and is cut-off event [2024-10-14 17:12:38,027 INFO L297 olderBase$Statistics]: existing Event has 294 ancestors and is cut-off event [2024-10-14 17:12:38,060 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [614#L55-1true, Black: 829#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 503#L108-4true, 382#L76-1true, Black: 816#true, Black: 850#true, 845#(= |#race~nondet_0~0| 0), 852#(= ~i_4~0 0), Black: 821#true, Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:38,061 INFO L294 olderBase$Statistics]: this new event has 387 ancestors and is cut-off event [2024-10-14 17:12:38,061 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-14 17:12:38,061 INFO L297 olderBase$Statistics]: existing Event has 297 ancestors and is cut-off event [2024-10-14 17:12:38,061 INFO L297 olderBase$Statistics]: existing Event has 301 ancestors and is cut-off event [2024-10-14 17:12:38,479 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:38,479 INFO L294 olderBase$Statistics]: this new event has 474 ancestors and is cut-off event [2024-10-14 17:12:38,479 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-10-14 17:12:38,479 INFO L297 olderBase$Statistics]: existing Event has 388 ancestors and is cut-off event [2024-10-14 17:12:38,479 INFO L297 olderBase$Statistics]: existing Event has 384 ancestors and is cut-off event [2024-10-14 17:12:38,490 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 831#(= |#race~break_10~0| 0), 614#L55-1true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:38,491 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-10-14 17:12:38,491 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-10-14 17:12:38,491 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:38,491 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:38,492 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 614#L55-1true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), 850#true, Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 503#L108-4true, 382#L76-1true, Black: 816#true, 845#(= |#race~nondet_0~0| 0), Black: 823#(= |#race~break_6~0| 0), Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:38,492 INFO L294 olderBase$Statistics]: this new event has 477 ancestors and is cut-off event [2024-10-14 17:12:38,492 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:38,492 INFO L297 olderBase$Statistics]: existing Event has 391 ancestors and is cut-off event [2024-10-14 17:12:38,492 INFO L297 olderBase$Statistics]: existing Event has 387 ancestors and is cut-off event [2024-10-14 17:12:38,504 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([2097] L76-->L76-1: Formula: (= |v_#race~nondet_0~0_4| 0) InVars {} OutVars{#race~nondet_0~0=|v_#race~nondet_0~0_4|} AuxVars[] AssignedVars[#race~nondet_0~0][515], [Black: 829#true, 614#L55-1true, 850#true, Black: 867#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 0)), Black: 804#(= |#race~result_3~0| 0), 869#true, 793#(= |#race~name_1~0| 0), 818#(= ~name_2~0 ~name_1~0), Black: 811#(= |#race~result_7~0| 0), Black: 2174#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 2182#(and (<= |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|)), Black: 843#true, Black: 2188#(and (<= 3 |ULTIMATE.start_create_fresh_int_array_~size#1|) (<= 3 |ULTIMATE.start_create_fresh_int_array_#in~size#1|) (<= (+ |ULTIMATE.start_create_fresh_int_array_~i~0#1| 1) |ULTIMATE.start_create_fresh_int_array_~size#1|)), 2192#true, 503#L108-4true, Black: 816#true, 382#L76-1true, 845#(= |#race~nondet_0~0| 0), Black: 821#true, Black: 852#(= ~i_4~0 0), Black: 791#true, Black: 855#(and (= ~i_4~0 0) |thread1Thread1of1ForFork0_#t~short8#1|), 797#(= |#race~name_2~0| 0), Black: 795#true]) [2024-10-14 17:12:38,505 INFO L294 olderBase$Statistics]: this new event has 480 ancestors and is cut-off event [2024-10-14 17:12:38,505 INFO L297 olderBase$Statistics]: existing Event has 390 ancestors and is cut-off event [2024-10-14 17:12:38,505 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-10-14 17:12:38,505 INFO L297 olderBase$Statistics]: existing Event has 394 ancestors and is cut-off event [2024-10-14 17:12:38,571 INFO L124 PetriNetUnfolderBase]: 473/10030 cut-off events. [2024-10-14 17:12:38,572 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2024-10-14 17:12:38,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11446 conditions, 10030 events. 473/10030 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 92128 event pairs, 17 based on Foata normal form. 0/8886 useless extension candidates. Maximal degree in co-relation 11213. Up to 159 conditions per place. [2024-10-14 17:12:38,746 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/683 dead transitions. [2024-10-14 17:12:38,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1671 flow [2024-10-14 17:12:38,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:12:38,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:12:38,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-10-14 17:12:38,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-10-14 17:12:38,750 INFO L175 Difference]: Start difference. First operand has 663 places, 680 transitions, 1615 flow. Second operand 6 states and 4457 transitions. [2024-10-14 17:12:38,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1671 flow [2024-10-14 17:12:38,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 664 places, 683 transitions, 1659 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-10-14 17:12:38,761 INFO L231 Difference]: Finished difference. Result has 664 places, 679 transitions, 1613 flow [2024-10-14 17:12:38,762 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=673, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1613, PETRI_PLACES=664, PETRI_TRANSITIONS=679} [2024-10-14 17:12:38,762 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -54 predicate places. [2024-10-14 17:12:38,763 INFO L471 AbstractCegarLoop]: Abstraction has has 664 places, 679 transitions, 1613 flow [2024-10-14 17:12:38,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.5) internal successors, (4449), 6 states have internal predecessors, (4449), 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:38,763 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:38,764 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 17:12:38,764 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:38,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:38,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1241122122, now seen corresponding path program 1 times [2024-10-14 17:12:38,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:38,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653688539] [2024-10-14 17:12:38,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:38,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:38,882 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:38,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:38,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653688539] [2024-10-14 17:12:38,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653688539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:38,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:38,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:12:38,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211697286] [2024-10-14 17:12:38,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:38,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:12:38,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:38,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:12:38,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:12:38,917 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 746 out of 774 [2024-10-14 17:12:38,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 664 places, 679 transitions, 1613 flow. Second operand has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 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:38,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:38,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 746 of 774 [2024-10-14 17:12:38,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:41,706 INFO L124 PetriNetUnfolderBase]: 649/12848 cut-off events. [2024-10-14 17:12:41,706 INFO L125 PetriNetUnfolderBase]: For 139/143 co-relation queries the response was YES. [2024-10-14 17:12:41,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14636 conditions, 12848 events. 649/12848 cut-off events. For 139/143 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 126768 event pairs, 42 based on Foata normal form. 0/11319 useless extension candidates. Maximal degree in co-relation 14420. Up to 283 conditions per place. [2024-10-14 17:12:41,847 INFO L140 encePairwiseOnDemand]: 766/774 looper letters, 12 selfloop transitions, 8 changer transitions 0/687 dead transitions. [2024-10-14 17:12:41,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 687 transitions, 1672 flow [2024-10-14 17:12:41,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:12:41,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 17:12:41,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 3751 transitions. [2024-10-14 17:12:41,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.969250645994832 [2024-10-14 17:12:41,850 INFO L175 Difference]: Start difference. First operand has 664 places, 679 transitions, 1613 flow. Second operand 5 states and 3751 transitions. [2024-10-14 17:12:41,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 687 transitions, 1672 flow [2024-10-14 17:12:41,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 663 places, 687 transitions, 1660 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:12:41,858 INFO L231 Difference]: Finished difference. Result has 666 places, 683 transitions, 1647 flow [2024-10-14 17:12:41,858 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1601, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=679, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=672, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=683} [2024-10-14 17:12:41,859 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-10-14 17:12:41,859 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 683 transitions, 1647 flow [2024-10-14 17:12:41,859 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 748.0) internal successors, (2992), 4 states have internal predecessors, (2992), 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:41,859 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:41,860 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 17:12:41,860 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err42ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:41,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:41,860 INFO L85 PathProgramCache]: Analyzing trace with hash -998272639, now seen corresponding path program 1 times [2024-10-14 17:12:41,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:41,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464612246] [2024-10-14 17:12:41,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:41,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:41,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:41,908 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:41,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:41,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464612246] [2024-10-14 17:12:41,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464612246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:41,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:41,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:41,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527138049] [2024-10-14 17:12:41,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:41,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:41,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:41,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:41,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:41,947 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:12:41,948 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 683 transitions, 1647 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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:41,948 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:41,948 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:12:41,948 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:44,641 INFO L124 PetriNetUnfolderBase]: 731/12842 cut-off events. [2024-10-14 17:12:44,642 INFO L125 PetriNetUnfolderBase]: For 633/637 co-relation queries the response was YES. [2024-10-14 17:12:44,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15201 conditions, 12842 events. 731/12842 cut-off events. For 633/637 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 129466 event pairs, 103 based on Foata normal form. 0/11329 useless extension candidates. Maximal degree in co-relation 14980. Up to 611 conditions per place. [2024-10-14 17:12:44,930 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 16 selfloop transitions, 3 changer transitions 1/683 dead transitions. [2024-10-14 17:12:44,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 667 places, 683 transitions, 1688 flow [2024-10-14 17:12:44,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:44,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-10-14 17:12:44,932 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-10-14 17:12:44,932 INFO L175 Difference]: Start difference. First operand has 666 places, 683 transitions, 1647 flow. Second operand 3 states and 2237 transitions. [2024-10-14 17:12:44,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 667 places, 683 transitions, 1688 flow [2024-10-14 17:12:44,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 667 places, 683 transitions, 1688 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:44,943 INFO L231 Difference]: Finished difference. Result has 667 places, 682 transitions, 1651 flow [2024-10-14 17:12:44,943 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=665, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=682, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=667, PETRI_TRANSITIONS=682} [2024-10-14 17:12:44,944 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -51 predicate places. [2024-10-14 17:12:44,944 INFO L471 AbstractCegarLoop]: Abstraction has has 667 places, 682 transitions, 1651 flow [2024-10-14 17:12:44,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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:44,944 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:44,944 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:44,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 17:12:44,945 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread1Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:44,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash -619068074, now seen corresponding path program 1 times [2024-10-14 17:12:44,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:44,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407304718] [2024-10-14 17:12:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:44,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:44,985 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:44,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:44,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407304718] [2024-10-14 17:12:44,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407304718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:44,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:44,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:44,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836095073] [2024-10-14 17:12:44,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:44,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:44,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:44,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:44,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:45,007 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-10-14 17:12:45,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 667 places, 682 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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:45,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:45,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-10-14 17:12:45,008 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:47,221 INFO L124 PetriNetUnfolderBase]: 567/11726 cut-off events. [2024-10-14 17:12:47,222 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2024-10-14 17:12:47,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13549 conditions, 11726 events. 567/11726 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 110192 event pairs, 52 based on Foata normal form. 0/10408 useless extension candidates. Maximal degree in co-relation 13327. Up to 253 conditions per place. [2024-10-14 17:12:47,461 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/682 dead transitions. [2024-10-14 17:12:47,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 668 places, 682 transitions, 1678 flow [2024-10-14 17:12:47,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:47,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-10-14 17:12:47,467 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-10-14 17:12:47,467 INFO L175 Difference]: Start difference. First operand has 667 places, 682 transitions, 1651 flow. Second operand 3 states and 2249 transitions. [2024-10-14 17:12:47,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 668 places, 682 transitions, 1678 flow [2024-10-14 17:12:47,481 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 666 places, 682 transitions, 1672 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:47,490 INFO L231 Difference]: Finished difference. Result has 666 places, 681 transitions, 1647 flow [2024-10-14 17:12:47,491 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1643, PETRI_DIFFERENCE_MINUEND_PLACES=664, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=681, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=679, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1647, PETRI_PLACES=666, PETRI_TRANSITIONS=681} [2024-10-14 17:12:47,491 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -52 predicate places. [2024-10-14 17:12:47,491 INFO L471 AbstractCegarLoop]: Abstraction has has 666 places, 681 transitions, 1647 flow [2024-10-14 17:12:47,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 746.6666666666666) internal successors, (2240), 3 states have internal predecessors, (2240), 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:47,495 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:47,495 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 17:12:47,495 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread2Err14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:47,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:47,496 INFO L85 PathProgramCache]: Analyzing trace with hash 2116113572, now seen corresponding path program 1 times [2024-10-14 17:12:47,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:47,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909101497] [2024-10-14 17:12:47,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:47,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:48,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:48,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909101497] [2024-10-14 17:12:48,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909101497] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:48,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:48,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:12:48,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554706422] [2024-10-14 17:12:48,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:48,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:12:48,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:48,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:12:48,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:12:48,125 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 739 out of 774 [2024-10-14 17:12:48,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 666 places, 681 transitions, 1647 flow. Second operand has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 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:48,127 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:48,127 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 739 of 774 [2024-10-14 17:12:48,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:50,759 INFO L124 PetriNetUnfolderBase]: 670/12757 cut-off events. [2024-10-14 17:12:50,760 INFO L125 PetriNetUnfolderBase]: For 292/296 co-relation queries the response was YES. [2024-10-14 17:12:50,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14903 conditions, 12757 events. 670/12757 cut-off events. For 292/296 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 126995 event pairs, 30 based on Foata normal form. 0/11365 useless extension candidates. Maximal degree in co-relation 14667. Up to 283 conditions per place. [2024-10-14 17:12:50,981 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 17 selfloop transitions, 6 changer transitions 0/684 dead transitions. [2024-10-14 17:12:50,982 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 670 places, 684 transitions, 1703 flow [2024-10-14 17:12:50,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:12:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:12:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 4457 transitions. [2024-10-14 17:12:50,984 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9597329888027563 [2024-10-14 17:12:50,984 INFO L175 Difference]: Start difference. First operand has 666 places, 681 transitions, 1647 flow. Second operand 6 states and 4457 transitions. [2024-10-14 17:12:50,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 670 places, 684 transitions, 1703 flow [2024-10-14 17:12:50,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 668 places, 684 transitions, 1699 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:50,993 INFO L231 Difference]: Finished difference. Result has 668 places, 680 transitions, 1653 flow [2024-10-14 17:12:50,994 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1641, PETRI_DIFFERENCE_MINUEND_PLACES=663, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1653, PETRI_PLACES=668, PETRI_TRANSITIONS=680} [2024-10-14 17:12:50,994 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -50 predicate places. [2024-10-14 17:12:50,994 INFO L471 AbstractCegarLoop]: Abstraction has has 668 places, 680 transitions, 1653 flow [2024-10-14 17:12:50,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 741.6666666666666) internal successors, (4450), 6 states have internal predecessors, (4450), 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:50,995 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:50,995 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 17:12:50,995 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread1Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:50,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:50,996 INFO L85 PathProgramCache]: Analyzing trace with hash -2031637157, now seen corresponding path program 1 times [2024-10-14 17:12:50,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:50,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541762303] [2024-10-14 17:12:50,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:50,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:51,043 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:51,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:51,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541762303] [2024-10-14 17:12:51,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541762303] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:51,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:51,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:51,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106679804] [2024-10-14 17:12:51,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:51,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:51,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:51,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:51,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:51,060 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-10-14 17:12:51,061 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 668 places, 680 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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:51,061 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:51,061 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-10-14 17:12:51,062 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:53,761 INFO L124 PetriNetUnfolderBase]: 653/13672 cut-off events. [2024-10-14 17:12:53,762 INFO L125 PetriNetUnfolderBase]: For 192/194 co-relation queries the response was YES. [2024-10-14 17:12:53,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15987 conditions, 13672 events. 653/13672 cut-off events. For 192/194 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 130550 event pairs, 26 based on Foata normal form. 0/12248 useless extension candidates. Maximal degree in co-relation 15765. Up to 313 conditions per place. [2024-10-14 17:12:53,945 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 14 selfloop transitions, 2 changer transitions 0/679 dead transitions. [2024-10-14 17:12:53,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 666 places, 679 transitions, 1685 flow [2024-10-14 17:12:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:53,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:53,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2243 transitions. [2024-10-14 17:12:53,947 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9659776055124892 [2024-10-14 17:12:53,947 INFO L175 Difference]: Start difference. First operand has 668 places, 680 transitions, 1653 flow. Second operand 3 states and 2243 transitions. [2024-10-14 17:12:53,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 666 places, 679 transitions, 1685 flow [2024-10-14 17:12:53,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 661 places, 679 transitions, 1673 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:12:53,957 INFO L231 Difference]: Finished difference. Result has 662 places, 677 transitions, 1643 flow [2024-10-14 17:12:53,958 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=659, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=677} [2024-10-14 17:12:53,958 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-10-14 17:12:53,958 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 677 transitions, 1643 flow [2024-10-14 17:12:53,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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:53,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:53,959 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 17:12:53,959 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:53,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash 844557227, now seen corresponding path program 1 times [2024-10-14 17:12:53,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:53,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861044057] [2024-10-14 17:12:53,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:53,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:54,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861044057] [2024-10-14 17:12:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861044057] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:54,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:54,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:54,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8537372] [2024-10-14 17:12:54,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:54,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:54,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:54,040 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 745 out of 774 [2024-10-14 17:12:54,041 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 677 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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:54,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:54,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 745 of 774 [2024-10-14 17:12:54,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:56,766 INFO L124 PetriNetUnfolderBase]: 687/12102 cut-off events. [2024-10-14 17:12:56,767 INFO L125 PetriNetUnfolderBase]: For 256/260 co-relation queries the response was YES. [2024-10-14 17:12:56,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14276 conditions, 12102 events. 687/12102 cut-off events. For 256/260 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 120908 event pairs, 82 based on Foata normal form. 0/10846 useless extension candidates. Maximal degree in co-relation 14053. Up to 434 conditions per place. [2024-10-14 17:12:56,901 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 11 selfloop transitions, 2 changer transitions 0/677 dead transitions. [2024-10-14 17:12:56,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 663 places, 677 transitions, 1670 flow [2024-10-14 17:12:56,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:56,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:56,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2249 transitions. [2024-10-14 17:12:56,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9685615848406546 [2024-10-14 17:12:56,905 INFO L175 Difference]: Start difference. First operand has 662 places, 677 transitions, 1643 flow. Second operand 3 states and 2249 transitions. [2024-10-14 17:12:56,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 663 places, 677 transitions, 1670 flow [2024-10-14 17:12:56,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 662 places, 677 transitions, 1668 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:56,915 INFO L231 Difference]: Finished difference. Result has 662 places, 676 transitions, 1643 flow [2024-10-14 17:12:56,916 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1639, PETRI_DIFFERENCE_MINUEND_PLACES=660, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=676, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=662, PETRI_TRANSITIONS=676} [2024-10-14 17:12:56,916 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -56 predicate places. [2024-10-14 17:12:56,916 INFO L471 AbstractCegarLoop]: Abstraction has has 662 places, 676 transitions, 1643 flow [2024-10-14 17:12:56,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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:56,917 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:56,917 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 17:12:56,917 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread2Err16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:56,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:56,917 INFO L85 PathProgramCache]: Analyzing trace with hash 340901488, now seen corresponding path program 1 times [2024-10-14 17:12:56,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:56,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379431084] [2024-10-14 17:12:56,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:56,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:56,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:56,979 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:56,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:56,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379431084] [2024-10-14 17:12:56,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379431084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:56,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:56,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:56,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013176274] [2024-10-14 17:12:56,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:56,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:56,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:56,982 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:56,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:56,999 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 741 out of 774 [2024-10-14 17:12:57,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 662 places, 676 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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:57,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:57,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 741 of 774 [2024-10-14 17:12:57,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:59,753 INFO L124 PetriNetUnfolderBase]: 693/11895 cut-off events. [2024-10-14 17:12:59,753 INFO L125 PetriNetUnfolderBase]: For 306/310 co-relation queries the response was YES. [2024-10-14 17:12:59,868 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14202 conditions, 11895 events. 693/11895 cut-off events. For 306/310 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 118628 event pairs, 30 based on Foata normal form. 0/10840 useless extension candidates. Maximal degree in co-relation 13979. Up to 520 conditions per place. [2024-10-14 17:12:59,892 INFO L140 encePairwiseOnDemand]: 768/774 looper letters, 13 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-10-14 17:12:59,892 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1672 flow [2024-10-14 17:12:59,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2242 transitions. [2024-10-14 17:12:59,894 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9655469422911284 [2024-10-14 17:12:59,894 INFO L175 Difference]: Start difference. First operand has 662 places, 676 transitions, 1643 flow. Second operand 3 states and 2242 transitions. [2024-10-14 17:12:59,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1672 flow [2024-10-14 17:12:59,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1666 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:59,903 INFO L231 Difference]: Finished difference. Result has 659 places, 673 transitions, 1641 flow [2024-10-14 17:12:59,903 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=659, PETRI_TRANSITIONS=673} [2024-10-14 17:12:59,904 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-10-14 17:12:59,904 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 673 transitions, 1641 flow [2024-10-14 17:12:59,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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:59,904 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:59,904 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 17:12:59,905 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread1Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:12:59,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:59,905 INFO L85 PathProgramCache]: Analyzing trace with hash -998187927, now seen corresponding path program 1 times [2024-10-14 17:12:59,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:59,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369408613] [2024-10-14 17:12:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:59,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:59,945 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:12:59,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:59,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369408613] [2024-10-14 17:12:59,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369408613] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:59,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:59,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:59,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748608422] [2024-10-14 17:12:59,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:59,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:59,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:59,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:59,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:59,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:12:59,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 673 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:59,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:59,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:12:59,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:03,138 INFO L124 PetriNetUnfolderBase]: 825/17128 cut-off events. [2024-10-14 17:13:03,138 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2024-10-14 17:13:03,333 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20017 conditions, 17128 events. 825/17128 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 177861 event pairs, 75 based on Foata normal form. 0/15687 useless extension candidates. Maximal degree in co-relation 19793. Up to 418 conditions per place. [2024-10-14 17:13:03,374 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-10-14 17:13:03,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 673 transitions, 1682 flow [2024-10-14 17:13:03,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:03,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:03,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-10-14 17:13:03,376 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-10-14 17:13:03,376 INFO L175 Difference]: Start difference. First operand has 659 places, 673 transitions, 1641 flow. Second operand 3 states and 2237 transitions. [2024-10-14 17:13:03,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 673 transitions, 1682 flow [2024-10-14 17:13:03,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1680 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:03,386 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1643 flow [2024-10-14 17:13:03,387 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1637, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1643, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-10-14 17:13:03,387 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-10-14 17:13:03,387 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1643 flow [2024-10-14 17:13:03,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:13:03,388 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:03,388 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:03,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-10-14 17:13:03,388 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting thread2Err19ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:03,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:03,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1994743042, now seen corresponding path program 1 times [2024-10-14 17:13:03,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:03,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215094659] [2024-10-14 17:13:03,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:03,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:03,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:03,434 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:03,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:03,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215094659] [2024-10-14 17:13:03,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215094659] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:03,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:03,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:03,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435656959] [2024-10-14 17:13:03,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:03,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:03,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:03,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:03,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:03,472 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:13:03,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1643 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:13:03,473 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:03,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:13:03,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:06,372 INFO L124 PetriNetUnfolderBase]: 747/12382 cut-off events. [2024-10-14 17:13:06,372 INFO L125 PetriNetUnfolderBase]: For 634/638 co-relation queries the response was YES. [2024-10-14 17:13:06,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15075 conditions, 12382 events. 747/12382 cut-off events. For 634/638 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 124343 event pairs, 110 based on Foata normal form. 0/11349 useless extension candidates. Maximal degree in co-relation 14851. Up to 645 conditions per place. [2024-10-14 17:13:06,492 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-10-14 17:13:06,492 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1684 flow [2024-10-14 17:13:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:06,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-10-14 17:13:06,494 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-10-14 17:13:06,494 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1643 flow. Second operand 3 states and 2237 transitions. [2024-10-14 17:13:06,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1684 flow [2024-10-14 17:13:06,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:06,502 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1641 flow [2024-10-14 17:13:06,503 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1635, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1641, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-10-14 17:13:06,503 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-10-14 17:13:06,503 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1641 flow [2024-10-14 17:13:06,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:13:06,503 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:06,504 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:06,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-10-14 17:13:06,504 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting thread1Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:06,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:06,504 INFO L85 PathProgramCache]: Analyzing trace with hash -660982826, now seen corresponding path program 1 times [2024-10-14 17:13:06,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:06,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534631393] [2024-10-14 17:13:06,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:06,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:06,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:06,545 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:06,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534631393] [2024-10-14 17:13:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1534631393] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:06,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:06,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:06,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620347858] [2024-10-14 17:13:06,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:06,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:06,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:06,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:06,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:06,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:13:06,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1641 flow. Second operand has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 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:13:06,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:06,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:13:06,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:10,387 INFO L124 PetriNetUnfolderBase]: 871/18314 cut-off events. [2024-10-14 17:13:10,388 INFO L125 PetriNetUnfolderBase]: For 466/468 co-relation queries the response was YES. [2024-10-14 17:13:10,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21607 conditions, 18314 events. 871/18314 cut-off events. For 466/468 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 191673 event pairs, 66 based on Foata normal form. 0/16865 useless extension candidates. Maximal degree in co-relation 21383. Up to 451 conditions per place. [2024-10-14 17:13:10,610 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-10-14 17:13:10,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1690 flow [2024-10-14 17:13:10,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:10,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-10-14 17:13:10,612 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-10-14 17:13:10,612 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1641 flow. Second operand 3 states and 2235 transitions. [2024-10-14 17:13:10,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1690 flow [2024-10-14 17:13:10,621 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1684 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:10,625 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1639 flow [2024-10-14 17:13:10,625 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1633, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1639, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2024-10-14 17:13:10,626 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2024-10-14 17:13:10,626 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1639 flow [2024-10-14 17:13:10,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 740.6666666666666) internal successors, (2222), 3 states have internal predecessors, (2222), 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:13:10,626 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:10,627 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:10,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-10-14 17:13:10,627 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting thread2Err23ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:10,627 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:10,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1700936363, now seen corresponding path program 1 times [2024-10-14 17:13:10,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:10,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236904144] [2024-10-14 17:13:10,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:10,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:10,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:10,668 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:10,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:10,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236904144] [2024-10-14 17:13:10,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236904144] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:10,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:10,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636968687] [2024-10-14 17:13:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:10,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:10,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:10,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:10,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:10,706 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:13:10,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1639 flow. Second operand has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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:13:10,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:10,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:13:10,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:13,130 INFO L124 PetriNetUnfolderBase]: 743/12362 cut-off events. [2024-10-14 17:13:13,130 INFO L125 PetriNetUnfolderBase]: For 563/567 co-relation queries the response was YES. [2024-10-14 17:13:13,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14951 conditions, 12362 events. 743/12362 cut-off events. For 563/567 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 125155 event pairs, 118 based on Foata normal form. 0/11372 useless extension candidates. Maximal degree in co-relation 14727. Up to 648 conditions per place. [2024-10-14 17:13:13,322 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 21 selfloop transitions, 3 changer transitions 0/670 dead transitions. [2024-10-14 17:13:13,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 670 transitions, 1688 flow [2024-10-14 17:13:13,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:13,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:13,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-10-14 17:13:13,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-10-14 17:13:13,324 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1639 flow. Second operand 3 states and 2235 transitions. [2024-10-14 17:13:13,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 670 transitions, 1688 flow [2024-10-14 17:13:13,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 670 transitions, 1682 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:13,335 INFO L231 Difference]: Finished difference. Result has 656 places, 669 transitions, 1637 flow [2024-10-14 17:13:13,336 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1637, PETRI_PLACES=656, PETRI_TRANSITIONS=669} [2024-10-14 17:13:13,337 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -62 predicate places. [2024-10-14 17:13:13,337 INFO L471 AbstractCegarLoop]: Abstraction has has 656 places, 669 transitions, 1637 flow [2024-10-14 17:13:13,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 741.0) internal successors, (2223), 3 states have internal predecessors, (2223), 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:13:13,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:13,338 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:13,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-10-14 17:13:13,338 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:13,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:13,338 INFO L85 PathProgramCache]: Analyzing trace with hash -143512538, now seen corresponding path program 1 times [2024-10-14 17:13:13,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:13,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794452036] [2024-10-14 17:13:13,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:13,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:13,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:13,386 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:13,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:13,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794452036] [2024-10-14 17:13:13,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794452036] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:13,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:13,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:13,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789447762] [2024-10-14 17:13:13,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:13,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:13,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:13,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:13,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:13,392 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-10-14 17:13:13,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 656 places, 669 transitions, 1637 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:13:13,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:13,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-10-14 17:13:13,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:15,831 INFO L124 PetriNetUnfolderBase]: 557/11430 cut-off events. [2024-10-14 17:13:15,831 INFO L125 PetriNetUnfolderBase]: For 152/154 co-relation queries the response was YES. [2024-10-14 17:13:16,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13402 conditions, 11430 events. 557/11430 cut-off events. For 152/154 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 102706 event pairs, 40 based on Foata normal form. 0/10545 useless extension candidates. Maximal degree in co-relation 13179. Up to 205 conditions per place. [2024-10-14 17:13:16,081 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-10-14 17:13:16,081 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 658 places, 672 transitions, 1670 flow [2024-10-14 17:13:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:16,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-10-14 17:13:16,082 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-10-14 17:13:16,082 INFO L175 Difference]: Start difference. First operand has 656 places, 669 transitions, 1637 flow. Second operand 3 states and 2258 transitions. [2024-10-14 17:13:16,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 658 places, 672 transitions, 1670 flow [2024-10-14 17:13:16,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 656 places, 672 transitions, 1664 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:16,093 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1653 flow [2024-10-14 17:13:16,093 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1631, PETRI_DIFFERENCE_MINUEND_PLACES=654, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=669, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=666, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1653, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-10-14 17:13:16,094 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-10-14 17:13:16,094 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1653 flow [2024-10-14 17:13:16,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:13:16,094 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:16,094 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:16,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-10-14 17:13:16,094 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting thread1Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:16,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:16,095 INFO L85 PathProgramCache]: Analyzing trace with hash -2083246806, now seen corresponding path program 1 times [2024-10-14 17:13:16,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:16,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783704038] [2024-10-14 17:13:16,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:16,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:16,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:16,144 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:16,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:16,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783704038] [2024-10-14 17:13:16,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783704038] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:16,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:16,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575748335] [2024-10-14 17:13:16,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:16,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:16,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:16,181 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:13:16,182 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1653 flow. Second operand has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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:13:16,182 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:16,182 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:13:16,182 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:19,851 INFO L124 PetriNetUnfolderBase]: 911/19053 cut-off events. [2024-10-14 17:13:19,851 INFO L125 PetriNetUnfolderBase]: For 429/429 co-relation queries the response was YES. [2024-10-14 17:13:20,183 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22437 conditions, 19053 events. 911/19053 cut-off events. For 429/429 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 198182 event pairs, 71 based on Foata normal form. 0/17655 useless extension candidates. Maximal degree in co-relation 22212. Up to 430 conditions per place. [2024-10-14 17:13:20,233 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/671 dead transitions. [2024-10-14 17:13:20,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 671 transitions, 1694 flow [2024-10-14 17:13:20,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:20,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-10-14 17:13:20,235 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-10-14 17:13:20,235 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1653 flow. Second operand 3 states and 2237 transitions. [2024-10-14 17:13:20,235 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 671 transitions, 1694 flow [2024-10-14 17:13:20,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 671 transitions, 1688 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:20,246 INFO L231 Difference]: Finished difference. Result has 657 places, 670 transitions, 1651 flow [2024-10-14 17:13:20,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1651, PETRI_PLACES=657, PETRI_TRANSITIONS=670} [2024-10-14 17:13:20,247 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -61 predicate places. [2024-10-14 17:13:20,247 INFO L471 AbstractCegarLoop]: Abstraction has has 657 places, 670 transitions, 1651 flow [2024-10-14 17:13:20,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.6666666666666) internal successors, (2228), 3 states have internal predecessors, (2228), 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:13:20,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:20,248 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:20,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-10-14 17:13:20,248 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:20,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:20,248 INFO L85 PathProgramCache]: Analyzing trace with hash -641068229, now seen corresponding path program 1 times [2024-10-14 17:13:20,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:20,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364908926] [2024-10-14 17:13:20,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:20,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:20,311 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:20,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:20,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364908926] [2024-10-14 17:13:20,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364908926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:20,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:20,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:20,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805393420] [2024-10-14 17:13:20,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:20,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:20,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:20,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:20,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:20,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-10-14 17:13:20,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 657 places, 670 transitions, 1651 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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:13:20,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:20,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-10-14 17:13:20,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:22,746 INFO L124 PetriNetUnfolderBase]: 631/11740 cut-off events. [2024-10-14 17:13:22,746 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2024-10-14 17:13:22,886 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13971 conditions, 11740 events. 631/11740 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 114056 event pairs, 59 based on Foata normal form. 0/10819 useless extension candidates. Maximal degree in co-relation 13747. Up to 317 conditions per place. [2024-10-14 17:13:22,912 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/673 dead transitions. [2024-10-14 17:13:22,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 659 places, 673 transitions, 1684 flow [2024-10-14 17:13:22,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:22,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-10-14 17:13:22,914 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-10-14 17:13:22,915 INFO L175 Difference]: Start difference. First operand has 657 places, 670 transitions, 1651 flow. Second operand 3 states and 2258 transitions. [2024-10-14 17:13:22,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 659 places, 673 transitions, 1684 flow [2024-10-14 17:13:22,919 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 657 places, 673 transitions, 1678 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:22,924 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1667 flow [2024-10-14 17:13:22,925 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1645, PETRI_DIFFERENCE_MINUEND_PLACES=655, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=670, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=667, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1667, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-10-14 17:13:22,925 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-10-14 17:13:22,925 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1667 flow [2024-10-14 17:13:22,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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:13:22,926 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:22,926 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:22,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-10-14 17:13:22,926 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting thread2Err28ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:22,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:22,927 INFO L85 PathProgramCache]: Analyzing trace with hash 802080159, now seen corresponding path program 1 times [2024-10-14 17:13:22,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:22,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015009281] [2024-10-14 17:13:22,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:22,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:22,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:22,981 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:22,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:22,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015009281] [2024-10-14 17:13:22,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015009281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:22,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:22,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:22,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259679636] [2024-10-14 17:13:22,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:22,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:22,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:22,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:22,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:23,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 740 out of 774 [2024-10-14 17:13:23,016 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1667 flow. Second operand has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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:13:23,016 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:23,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 740 of 774 [2024-10-14 17:13:23,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:25,662 INFO L124 PetriNetUnfolderBase]: 747/12434 cut-off events. [2024-10-14 17:13:25,662 INFO L125 PetriNetUnfolderBase]: For 759/763 co-relation queries the response was YES. [2024-10-14 17:13:25,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15468 conditions, 12434 events. 747/12434 cut-off events. For 759/763 co-relation queries the response was YES. Maximal size of possible extension queue 121. Compared 126047 event pairs, 102 based on Foata normal form. 0/11596 useless extension candidates. Maximal degree in co-relation 15242. Up to 613 conditions per place. [2024-10-14 17:13:25,913 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 17 selfloop transitions, 3 changer transitions 0/672 dead transitions. [2024-10-14 17:13:25,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 672 transitions, 1708 flow [2024-10-14 17:13:25,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:25,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:25,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2237 transitions. [2024-10-14 17:13:25,915 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9633936261843239 [2024-10-14 17:13:25,915 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1667 flow. Second operand 3 states and 2237 transitions. [2024-10-14 17:13:25,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 672 transitions, 1708 flow [2024-10-14 17:13:25,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 672 transitions, 1702 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:25,926 INFO L231 Difference]: Finished difference. Result has 658 places, 671 transitions, 1665 flow [2024-10-14 17:13:25,927 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1665, PETRI_PLACES=658, PETRI_TRANSITIONS=671} [2024-10-14 17:13:25,927 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -60 predicate places. [2024-10-14 17:13:25,927 INFO L471 AbstractCegarLoop]: Abstraction has has 658 places, 671 transitions, 1665 flow [2024-10-14 17:13:25,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 743.0) internal successors, (2229), 3 states have internal predecessors, (2229), 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:13:25,928 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:25,928 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:25,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-10-14 17:13:25,928 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:25,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 454451236, now seen corresponding path program 1 times [2024-10-14 17:13:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982318624] [2024-10-14 17:13:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:25,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:25,984 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:25,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:25,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982318624] [2024-10-14 17:13:25,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982318624] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:25,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:25,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:25,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353420489] [2024-10-14 17:13:25,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:25,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:25,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:25,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:25,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:25,993 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-10-14 17:13:25,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 658 places, 671 transitions, 1665 flow. Second operand has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:13:25,994 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:25,994 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-10-14 17:13:25,994 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:28,318 INFO L124 PetriNetUnfolderBase]: 557/11576 cut-off events. [2024-10-14 17:13:28,318 INFO L125 PetriNetUnfolderBase]: For 166/168 co-relation queries the response was YES. [2024-10-14 17:13:28,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13858 conditions, 11576 events. 557/11576 cut-off events. For 166/168 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 103365 event pairs, 40 based on Foata normal form. 0/10782 useless extension candidates. Maximal degree in co-relation 13633. Up to 205 conditions per place. [2024-10-14 17:13:28,545 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/674 dead transitions. [2024-10-14 17:13:28,545 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 660 places, 674 transitions, 1698 flow [2024-10-14 17:13:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:28,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:28,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-10-14 17:13:28,547 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-10-14 17:13:28,547 INFO L175 Difference]: Start difference. First operand has 658 places, 671 transitions, 1665 flow. Second operand 3 states and 2258 transitions. [2024-10-14 17:13:28,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 660 places, 674 transitions, 1698 flow [2024-10-14 17:13:28,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 658 places, 674 transitions, 1692 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:28,557 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1681 flow [2024-10-14 17:13:28,557 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1659, PETRI_DIFFERENCE_MINUEND_PLACES=656, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=671, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=668, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1681, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-10-14 17:13:28,557 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2024-10-14 17:13:28,557 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1681 flow [2024-10-14 17:13:28,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.3333333333334) internal successors, (2248), 3 states have internal predecessors, (2248), 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:13:28,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:28,558 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:28,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-10-14 17:13:28,558 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting thread1Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:28,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:28,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1329290536, now seen corresponding path program 1 times [2024-10-14 17:13:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433735891] [2024-10-14 17:13:28,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:28,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:28,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:28,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:28,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433735891] [2024-10-14 17:13:28,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [433735891] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:28,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:28,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:28,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268860287] [2024-10-14 17:13:28,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:28,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:28,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:28,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:28,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:28,645 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:13:28,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1681 flow. Second operand has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:13:28,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:28,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:13:28,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:33,314 INFO L124 PetriNetUnfolderBase]: 1079/23272 cut-off events. [2024-10-14 17:13:33,315 INFO L125 PetriNetUnfolderBase]: For 436/438 co-relation queries the response was YES. [2024-10-14 17:13:33,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27821 conditions, 23272 events. 1079/23272 cut-off events. For 436/438 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 253664 event pairs, 68 based on Foata normal form. 0/21765 useless extension candidates. Maximal degree in co-relation 27594. Up to 565 conditions per place. [2024-10-14 17:13:33,618 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 22 selfloop transitions, 2 changer transitions 0/673 dead transitions. [2024-10-14 17:13:33,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 673 transitions, 1730 flow [2024-10-14 17:13:33,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:33,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:33,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-10-14 17:13:33,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-10-14 17:13:33,620 INFO L175 Difference]: Start difference. First operand has 660 places, 673 transitions, 1681 flow. Second operand 3 states and 2235 transitions. [2024-10-14 17:13:33,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 673 transitions, 1730 flow [2024-10-14 17:13:33,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 673 transitions, 1724 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:33,633 INFO L231 Difference]: Finished difference. Result has 659 places, 672 transitions, 1677 flow [2024-10-14 17:13:33,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=670, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1677, PETRI_PLACES=659, PETRI_TRANSITIONS=672} [2024-10-14 17:13:33,633 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -59 predicate places. [2024-10-14 17:13:33,633 INFO L471 AbstractCegarLoop]: Abstraction has has 659 places, 672 transitions, 1677 flow [2024-10-14 17:13:33,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.0) internal successors, (2226), 3 states have internal predecessors, (2226), 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:13:33,634 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:33,634 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:33,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-10-14 17:13:33,634 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:33,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:33,635 INFO L85 PathProgramCache]: Analyzing trace with hash -275091676, now seen corresponding path program 1 times [2024-10-14 17:13:33,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:33,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78225368] [2024-10-14 17:13:33,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:33,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:33,674 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:33,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:33,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78225368] [2024-10-14 17:13:33,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78225368] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:33,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:33,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:33,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602476368] [2024-10-14 17:13:33,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:33,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:33,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:33,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:33,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:33,684 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 748 out of 774 [2024-10-14 17:13:33,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 659 places, 672 transitions, 1677 flow. Second operand has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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:13:33,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:33,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 748 of 774 [2024-10-14 17:13:33,685 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:36,495 INFO L124 PetriNetUnfolderBase]: 623/11884 cut-off events. [2024-10-14 17:13:36,495 INFO L125 PetriNetUnfolderBase]: For 214/218 co-relation queries the response was YES. [2024-10-14 17:13:36,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14445 conditions, 11884 events. 623/11884 cut-off events. For 214/218 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 115577 event pairs, 59 based on Foata normal form. 0/11074 useless extension candidates. Maximal degree in co-relation 14219. Up to 317 conditions per place. [2024-10-14 17:13:36,673 INFO L140 encePairwiseOnDemand]: 770/774 looper letters, 10 selfloop transitions, 3 changer transitions 0/675 dead transitions. [2024-10-14 17:13:36,673 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 661 places, 675 transitions, 1710 flow [2024-10-14 17:13:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:36,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:36,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2258 transitions. [2024-10-14 17:13:36,674 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9724375538329026 [2024-10-14 17:13:36,675 INFO L175 Difference]: Start difference. First operand has 659 places, 672 transitions, 1677 flow. Second operand 3 states and 2258 transitions. [2024-10-14 17:13:36,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 661 places, 675 transitions, 1710 flow [2024-10-14 17:13:36,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 659 places, 675 transitions, 1706 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:36,684 INFO L231 Difference]: Finished difference. Result has 661 places, 674 transitions, 1695 flow [2024-10-14 17:13:36,684 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1673, PETRI_DIFFERENCE_MINUEND_PLACES=657, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=672, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=669, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1695, PETRI_PLACES=661, PETRI_TRANSITIONS=674} [2024-10-14 17:13:36,685 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -57 predicate places. [2024-10-14 17:13:36,685 INFO L471 AbstractCegarLoop]: Abstraction has has 661 places, 674 transitions, 1695 flow [2024-10-14 17:13:36,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 749.6666666666666) internal successors, (2249), 3 states have internal predecessors, (2249), 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:13:36,685 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:36,685 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:36,685 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-10-14 17:13:36,686 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting thread2Err33ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:36,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:36,686 INFO L85 PathProgramCache]: Analyzing trace with hash 318230216, now seen corresponding path program 1 times [2024-10-14 17:13:36,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:36,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049452263] [2024-10-14 17:13:36,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:36,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049452263] [2024-10-14 17:13:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049452263] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455730950] [2024-10-14 17:13:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:36,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:36,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:36,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:36,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 738 out of 774 [2024-10-14 17:13:36,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 661 places, 674 transitions, 1695 flow. Second operand has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:13:36,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:36,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 738 of 774 [2024-10-14 17:13:36,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:39,630 INFO L124 PetriNetUnfolderBase]: 773/12756 cut-off events. [2024-10-14 17:13:39,630 INFO L125 PetriNetUnfolderBase]: For 755/759 co-relation queries the response was YES. [2024-10-14 17:13:39,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16245 conditions, 12756 events. 773/12756 cut-off events. For 755/759 co-relation queries the response was YES. Maximal size of possible extension queue 120. Compared 129886 event pairs, 122 based on Foata normal form. 0/12008 useless extension candidates. Maximal degree in co-relation 16017. Up to 694 conditions per place. [2024-10-14 17:13:39,951 INFO L140 encePairwiseOnDemand]: 771/774 looper letters, 22 selfloop transitions, 2 changer transitions 0/674 dead transitions. [2024-10-14 17:13:39,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 662 places, 674 transitions, 1744 flow [2024-10-14 17:13:39,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:39,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:39,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 2235 transitions. [2024-10-14 17:13:39,953 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.962532299741602 [2024-10-14 17:13:39,953 INFO L175 Difference]: Start difference. First operand has 661 places, 674 transitions, 1695 flow. Second operand 3 states and 2235 transitions. [2024-10-14 17:13:39,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 662 places, 674 transitions, 1744 flow [2024-10-14 17:13:39,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 660 places, 674 transitions, 1738 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:39,965 INFO L231 Difference]: Finished difference. Result has 660 places, 673 transitions, 1691 flow [2024-10-14 17:13:39,966 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=774, PETRI_DIFFERENCE_MINUEND_FLOW=1687, PETRI_DIFFERENCE_MINUEND_PLACES=658, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=671, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1691, PETRI_PLACES=660, PETRI_TRANSITIONS=673} [2024-10-14 17:13:39,966 INFO L277 CegarLoopForPetriNet]: 718 programPoint places, -58 predicate places. [2024-10-14 17:13:39,966 INFO L471 AbstractCegarLoop]: Abstraction has has 660 places, 673 transitions, 1691 flow [2024-10-14 17:13:39,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 742.3333333333334) internal successors, (2227), 3 states have internal predecessors, (2227), 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:13:39,967 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:39,967 INFO L204 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:39,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-10-14 17:13:39,967 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting thread1Err35ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 186 more)] === [2024-10-14 17:13:39,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:39,967 INFO L85 PathProgramCache]: Analyzing trace with hash 496722894, now seen corresponding path program 1 times [2024-10-14 17:13:39,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:39,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356919923] [2024-10-14 17:13:39,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:39,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:40,011 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-10-14 17:13:40,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:40,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356919923] [2024-10-14 17:13:40,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356919923] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:40,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:40,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:40,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226581924] [2024-10-14 17:13:40,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:40,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:40,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:40,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:40,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:40,038 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 744 out of 774 [2024-10-14 17:13:40,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 660 places, 673 transitions, 1691 flow. Second operand has 3 states, 3 states have (on average 747.0) internal successors, (2241), 3 states have internal predecessors, (2241), 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:13:40,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:40,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 744 of 774 [2024-10-14 17:13:40,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand