./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-trans.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-trans.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 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:12:03,596 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:12:03,670 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,680 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:12:03,680 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:12:03,708 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:12:03,709 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:12:03,709 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:12:03,710 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:12:03,712 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:12:03,713 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:12:03,713 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:12:03,713 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:12:03,714 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:12:03,714 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:12:03,716 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:12:03,716 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:12:03,717 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:12:03,717 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:12:03,717 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:12:03,717 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:12:03,719 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:12:03,719 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:12:03,720 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:12:03,720 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:12:03,720 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:12:03,720 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:12:03,721 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:12:03,721 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:12:03,721 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:12:03,721 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:12:03,722 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:03,722 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:12:03,722 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:12:03,722 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:12:03,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:12:03,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:12:03,727 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:12:03,727 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:12:03,728 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:12:03,728 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:12:03,729 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 -> 362ca5c35cce683744d8d619a442f154ce469608d45ae43ff282ddf886694959 [2024-10-14 17:12:04,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:12:04,037 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:12:04,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:12:04,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:12:04,044 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:12:04,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2024-10-14 17:12:05,484 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:12:05,666 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:12:05,667 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-name-comparator-trans.wvr.c [2024-10-14 17:12:05,679 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bb73938/d093d3112814495c99ae8964ab29f1f7/FLAG1f09a8c1a [2024-10-14 17:12:06,053 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/13bb73938/d093d3112814495c99ae8964ab29f1f7 [2024-10-14 17:12:06,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:12:06,056 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:12:06,057 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:06,057 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:12:06,064 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:12:06,065 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:06" (1/1) ... [2024-10-14 17:12:06,065 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1647451b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:06, skipping insertion in model container [2024-10-14 17:12:06,066 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:12:06" (1/1) ... [2024-10-14 17:12:06,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:12:06,343 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:06,351 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:12:06,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:12:06,418 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:12:06,418 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:06 WrapperNode [2024-10-14 17:12:06,419 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:12:06,420 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:06,420 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:12:06,420 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:12:06,429 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:06" (1/1) ... [2024-10-14 17:12:06,444 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:06" (1/1) ... [2024-10-14 17:12:06,484 INFO L138 Inliner]: procedures = 25, calls = 30, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 844 [2024-10-14 17:12:06,485 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:12:06,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:12:06,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:12:06,486 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:12:06,495 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:06" (1/1) ... [2024-10-14 17:12:06,496 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:06" (1/1) ... [2024-10-14 17:12:06,502 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:06" (1/1) ... [2024-10-14 17:12:06,505 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:06" (1/1) ... [2024-10-14 17:12:06,526 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:06" (1/1) ... [2024-10-14 17:12:06,535 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:06" (1/1) ... [2024-10-14 17:12:06,539 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:06" (1/1) ... [2024-10-14 17:12:06,542 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:06" (1/1) ... [2024-10-14 17:12:06,549 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:12:06,550 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:12:06,551 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:12:06,551 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:12:06,552 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:06" (1/1) ... [2024-10-14 17:12:06,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:12:06,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:12:06,587 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:06,590 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:06,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:12:06,646 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-10-14 17:12:06,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-10-14 17:12:06,647 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-10-14 17:12:06,647 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-10-14 17:12:06,648 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-10-14 17:12:06,648 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-10-14 17:12:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:12:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:12:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:12:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:12:06,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:12:06,649 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:12:06,652 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:06,810 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:12:06,812 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:12:07,842 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:12:07,843 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:12:07,895 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:12:07,899 INFO L314 CfgBuilder]: Removed 4 assume(true) statements. [2024-10-14 17:12:07,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:07 BoogieIcfgContainer [2024-10-14 17:12:07,902 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:12:07,904 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:12:07,904 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:12:07,908 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:12:07,908 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:12:06" (1/3) ... [2024-10-14 17:12:07,909 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3397b0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:07, skipping insertion in model container [2024-10-14 17:12:07,909 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:12:06" (2/3) ... [2024-10-14 17:12:07,910 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3397b0ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:12:07, skipping insertion in model container [2024-10-14 17:12:07,910 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:12:07" (3/3) ... [2024-10-14 17:12:07,911 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-trans.wvr.c [2024-10-14 17:12:07,929 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:12:07,930 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 149 error locations. [2024-10-14 17:12:07,930 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:12:08,128 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-10-14 17:12:08,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1058 places, 1106 transitions, 2233 flow [2024-10-14 17:12:08,745 INFO L124 PetriNetUnfolderBase]: 58/1103 cut-off events. [2024-10-14 17:12:08,746 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-10-14 17:12:08,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1116 conditions, 1103 events. 58/1103 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3809 event pairs, 0 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 849. Up to 2 conditions per place. [2024-10-14 17:12:08,796 INFO L82 GeneralOperation]: Start removeDead. Operand has 1058 places, 1106 transitions, 2233 flow [2024-10-14 17:12:08,898 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1036 places, 1082 transitions, 2182 flow [2024-10-14 17:12:08,908 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:12:08,919 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;@10a21810, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:12:08,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 281 error locations. [2024-10-14 17:12:08,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:12:08,925 INFO L124 PetriNetUnfolderBase]: 0/32 cut-off events. [2024-10-14 17:12:08,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:12:08,925 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:08,926 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] [2024-10-14 17:12:08,927 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:08,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:08,932 INFO L85 PathProgramCache]: Analyzing trace with hash -339342035, now seen corresponding path program 1 times [2024-10-14 17:12:08,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:08,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94845032] [2024-10-14 17:12:08,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:08,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:09,149 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,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:09,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94845032] [2024-10-14 17:12:09,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94845032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:09,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:09,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:09,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296224018] [2024-10-14 17:12:09,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:09,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:09,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:09,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:09,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:09,270 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:12:09,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1036 places, 1082 transitions, 2182 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 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,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:09,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:12:09,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:11,536 INFO L124 PetriNetUnfolderBase]: 227/4391 cut-off events. [2024-10-14 17:12:11,538 INFO L125 PetriNetUnfolderBase]: For 57/64 co-relation queries the response was YES. [2024-10-14 17:12:11,710 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4546 conditions, 4391 events. 227/4391 cut-off events. For 57/64 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 33698 event pairs, 45 based on Foata normal form. 208/3683 useless extension candidates. Maximal degree in co-relation 3736. Up to 110 conditions per place. [2024-10-14 17:12:11,777 INFO L140 encePairwiseOnDemand]: 1085/1106 looper letters, 19 selfloop transitions, 2 changer transitions 2/1063 dead transitions. [2024-10-14 17:12:11,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1037 places, 1063 transitions, 2186 flow [2024-10-14 17:12:11,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:11,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:11,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3229 transitions. [2024-10-14 17:12:11,810 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9731766124171187 [2024-10-14 17:12:11,812 INFO L175 Difference]: Start difference. First operand has 1036 places, 1082 transitions, 2182 flow. Second operand 3 states and 3229 transitions. [2024-10-14 17:12:11,814 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1037 places, 1063 transitions, 2186 flow [2024-10-14 17:12:11,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1031 places, 1063 transitions, 2174 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-10-14 17:12:11,848 INFO L231 Difference]: Finished difference. Result has 1031 places, 1061 transitions, 2132 flow [2024-10-14 17:12:11,852 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2132, PETRI_DIFFERENCE_MINUEND_PLACES=1029, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1063, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1061, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2132, PETRI_PLACES=1031, PETRI_TRANSITIONS=1061} [2024-10-14 17:12:11,858 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -5 predicate places. [2024-10-14 17:12:11,858 INFO L471 AbstractCegarLoop]: Abstraction has has 1031 places, 1061 transitions, 2132 flow [2024-10-14 17:12:11,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 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,860 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:11,861 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] [2024-10-14 17:12:11,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:12:11,861 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:11,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:11,862 INFO L85 PathProgramCache]: Analyzing trace with hash -791162709, now seen corresponding path program 1 times [2024-10-14 17:12:11,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:11,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924801641] [2024-10-14 17:12:11,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:11,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:11,960 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,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:11,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924801641] [2024-10-14 17:12:11,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924801641] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:11,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:11,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:11,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461936414] [2024-10-14 17:12:11,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:11,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:11,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:11,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:11,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:12,031 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:12:12,035 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 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,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:12,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:12:12,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:15,741 INFO L124 PetriNetUnfolderBase]: 613/12175 cut-off events. [2024-10-14 17:12:15,742 INFO L125 PetriNetUnfolderBase]: For 6/24 co-relation queries the response was YES. [2024-10-14 17:12:15,876 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12409 conditions, 12175 events. 613/12175 cut-off events. For 6/24 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 120276 event pairs, 95 based on Foata normal form. 0/9562 useless extension candidates. Maximal degree in co-relation 12368. Up to 185 conditions per place. [2024-10-14 17:12:15,967 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 19 selfloop transitions, 2 changer transitions 0/1060 dead transitions. [2024-10-14 17:12:15,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1030 places, 1060 transitions, 2172 flow [2024-10-14 17:12:15,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:15,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-10-14 17:12:15,974 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9677516576250753 [2024-10-14 17:12:15,974 INFO L175 Difference]: Start difference. First operand has 1031 places, 1061 transitions, 2132 flow. Second operand 3 states and 3211 transitions. [2024-10-14 17:12:15,974 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1030 places, 1060 transitions, 2172 flow [2024-10-14 17:12:15,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1028 places, 1060 transitions, 2168 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:15,991 INFO L231 Difference]: Finished difference. Result has 1028 places, 1060 transitions, 2130 flow [2024-10-14 17:12:15,993 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2126, PETRI_DIFFERENCE_MINUEND_PLACES=1026, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1060, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1058, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2130, PETRI_PLACES=1028, PETRI_TRANSITIONS=1060} [2024-10-14 17:12:15,994 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -8 predicate places. [2024-10-14 17:12:15,994 INFO L471 AbstractCegarLoop]: Abstraction has has 1028 places, 1060 transitions, 2130 flow [2024-10-14 17:12:15,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 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,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:15,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:15,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:12:15,997 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:15,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:15,999 INFO L85 PathProgramCache]: Analyzing trace with hash -759212998, now seen corresponding path program 1 times [2024-10-14 17:12:15,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:15,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482269022] [2024-10-14 17:12:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:16,079 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,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:16,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482269022] [2024-10-14 17:12:16,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482269022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:16,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:16,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:16,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198065527] [2024-10-14 17:12:16,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:16,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:16,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:16,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:16,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:16,152 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:12:16,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 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,163 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:16,163 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:12:16,163 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:17,244 INFO L124 PetriNetUnfolderBase]: 241/3573 cut-off events. [2024-10-14 17:12:17,244 INFO L125 PetriNetUnfolderBase]: For 42/75 co-relation queries the response was YES. [2024-10-14 17:12:17,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3772 conditions, 3573 events. 241/3573 cut-off events. For 42/75 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 27260 event pairs, 95 based on Foata normal form. 0/2832 useless extension candidates. Maximal degree in co-relation 3723. Up to 185 conditions per place. [2024-10-14 17:12:17,382 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 19 selfloop transitions, 2 changer transitions 0/1059 dead transitions. [2024-10-14 17:12:17,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1029 places, 1059 transitions, 2170 flow [2024-10-14 17:12:17,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:17,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:17,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-10-14 17:12:17,390 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9677516576250753 [2024-10-14 17:12:17,390 INFO L175 Difference]: Start difference. First operand has 1028 places, 1060 transitions, 2130 flow. Second operand 3 states and 3211 transitions. [2024-10-14 17:12:17,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1029 places, 1059 transitions, 2170 flow [2024-10-14 17:12:17,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1027 places, 1059 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:17,407 INFO L231 Difference]: Finished difference. Result has 1027 places, 1059 transitions, 2128 flow [2024-10-14 17:12:17,409 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2124, PETRI_DIFFERENCE_MINUEND_PLACES=1025, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1059, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1057, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2128, PETRI_PLACES=1027, PETRI_TRANSITIONS=1059} [2024-10-14 17:12:17,411 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -9 predicate places. [2024-10-14 17:12:17,411 INFO L471 AbstractCegarLoop]: Abstraction has has 1027 places, 1059 transitions, 2128 flow [2024-10-14 17:12:17,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.3333333333333) internal successors, (3193), 3 states have internal predecessors, (3193), 0 states have call successors, (0), 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,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:17,414 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] [2024-10-14 17:12:17,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:12:17,414 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:17,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:17,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1995732884, now seen corresponding path program 1 times [2024-10-14 17:12:17,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:17,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755306527] [2024-10-14 17:12:17,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:17,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:17,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:17,488 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,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:17,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755306527] [2024-10-14 17:12:17,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755306527] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:17,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:17,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742545148] [2024-10-14 17:12:17,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:17,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:17,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:17,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:17,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:17,541 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1106 [2024-10-14 17:12:17,545 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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,545 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:17,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1106 [2024-10-14 17:12:17,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:19,139 INFO L124 PetriNetUnfolderBase]: 246/5498 cut-off events. [2024-10-14 17:12:19,140 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-14 17:12:19,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5574 conditions, 5498 events. 246/5498 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 43636 event pairs, 16 based on Foata normal form. 0/4346 useless extension candidates. Maximal degree in co-relation 5517. Up to 51 conditions per place. [2024-10-14 17:12:19,370 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 18 selfloop transitions, 2 changer transitions 0/1058 dead transitions. [2024-10-14 17:12:19,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1028 places, 1058 transitions, 2166 flow [2024-10-14 17:12:19,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:19,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:19,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-10-14 17:12:19,379 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-10-14 17:12:19,379 INFO L175 Difference]: Start difference. First operand has 1027 places, 1059 transitions, 2128 flow. Second operand 3 states and 3213 transitions. [2024-10-14 17:12:19,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1028 places, 1058 transitions, 2166 flow [2024-10-14 17:12:19,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1026 places, 1058 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:19,402 INFO L231 Difference]: Finished difference. Result has 1026 places, 1058 transitions, 2126 flow [2024-10-14 17:12:19,407 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2122, PETRI_DIFFERENCE_MINUEND_PLACES=1024, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1058, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1056, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2126, PETRI_PLACES=1026, PETRI_TRANSITIONS=1058} [2024-10-14 17:12:19,408 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -10 predicate places. [2024-10-14 17:12:19,408 INFO L471 AbstractCegarLoop]: Abstraction has has 1026 places, 1058 transitions, 2126 flow [2024-10-14 17:12:19,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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,413 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:19,414 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] [2024-10-14 17:12:19,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:12:19,414 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:19,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:19,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1388008775, now seen corresponding path program 1 times [2024-10-14 17:12:19,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:19,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182778932] [2024-10-14 17:12:19,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:19,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:19,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:19,484 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,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:19,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182778932] [2024-10-14 17:12:19,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182778932] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:19,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:19,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:19,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561230084] [2024-10-14 17:12:19,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:19,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:19,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:19,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:19,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:19,526 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1106 [2024-10-14 17:12:19,531 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1026 places, 1058 transitions, 2126 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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,531 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:19,531 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1106 [2024-10-14 17:12:19,532 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:19,966 INFO L124 PetriNetUnfolderBase]: 74/1607 cut-off events. [2024-10-14 17:12:19,966 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:12:20,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1668 conditions, 1607 events. 74/1607 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8190 event pairs, 12 based on Foata normal form. 0/1294 useless extension candidates. Maximal degree in co-relation 1603. Up to 40 conditions per place. [2024-10-14 17:12:20,024 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/1057 dead transitions. [2024-10-14 17:12:20,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1027 places, 1057 transitions, 2158 flow [2024-10-14 17:12:20,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:20,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:20,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2024-10-14 17:12:20,031 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9701627486437613 [2024-10-14 17:12:20,031 INFO L175 Difference]: Start difference. First operand has 1026 places, 1058 transitions, 2126 flow. Second operand 3 states and 3219 transitions. [2024-10-14 17:12:20,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1027 places, 1057 transitions, 2158 flow [2024-10-14 17:12:20,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1025 places, 1057 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:20,047 INFO L231 Difference]: Finished difference. Result has 1025 places, 1057 transitions, 2124 flow [2024-10-14 17:12:20,049 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2120, PETRI_DIFFERENCE_MINUEND_PLACES=1023, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1057, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1055, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2124, PETRI_PLACES=1025, PETRI_TRANSITIONS=1057} [2024-10-14 17:12:20,052 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -11 predicate places. [2024-10-14 17:12:20,052 INFO L471 AbstractCegarLoop]: Abstraction has has 1025 places, 1057 transitions, 2124 flow [2024-10-14 17:12:20,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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,055 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:20,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, 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,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:12:20,055 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:20,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1598375661, now seen corresponding path program 1 times [2024-10-14 17:12:20,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:20,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138006899] [2024-10-14 17:12:20,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:20,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:20,112 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,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:20,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138006899] [2024-10-14 17:12:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138006899] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:20,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985428137] [2024-10-14 17:12:20,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:20,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:20,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:20,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:20,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:20,188 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1106 [2024-10-14 17:12:20,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 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,193 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:20,193 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1106 [2024-10-14 17:12:20,193 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:21,386 INFO L124 PetriNetUnfolderBase]: 168/3831 cut-off events. [2024-10-14 17:12:21,386 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2024-10-14 17:12:21,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3885 conditions, 3831 events. 168/3831 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25916 event pairs, 10 based on Foata normal form. 0/3042 useless extension candidates. Maximal degree in co-relation 3812. Up to 35 conditions per place. [2024-10-14 17:12:21,541 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/1056 dead transitions. [2024-10-14 17:12:21,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1026 places, 1056 transitions, 2154 flow [2024-10-14 17:12:21,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:21,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2024-10-14 17:12:21,548 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9707655213984328 [2024-10-14 17:12:21,548 INFO L175 Difference]: Start difference. First operand has 1025 places, 1057 transitions, 2124 flow. Second operand 3 states and 3221 transitions. [2024-10-14 17:12:21,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1026 places, 1056 transitions, 2154 flow [2024-10-14 17:12:21,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1024 places, 1056 transitions, 2150 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:21,568 INFO L231 Difference]: Finished difference. Result has 1024 places, 1056 transitions, 2122 flow [2024-10-14 17:12:21,569 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2118, PETRI_DIFFERENCE_MINUEND_PLACES=1022, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1056, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1054, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2122, PETRI_PLACES=1024, PETRI_TRANSITIONS=1056} [2024-10-14 17:12:21,570 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -12 predicate places. [2024-10-14 17:12:21,570 INFO L471 AbstractCegarLoop]: Abstraction has has 1024 places, 1056 transitions, 2122 flow [2024-10-14 17:12:21,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 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,573 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:21,573 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:21,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:12:21,573 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:21,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:21,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1905169515, now seen corresponding path program 1 times [2024-10-14 17:12:21,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:21,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860573769] [2024-10-14 17:12:21,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:21,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:21,639 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,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:21,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860573769] [2024-10-14 17:12:21,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860573769] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:21,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:21,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:21,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740151505] [2024-10-14 17:12:21,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:21,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:21,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:21,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:21,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:21,714 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1106 [2024-10-14 17:12:21,719 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 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,719 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:21,719 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1106 [2024-10-14 17:12:21,719 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:24,336 INFO L124 PetriNetUnfolderBase]: 350/7715 cut-off events. [2024-10-14 17:12:24,336 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2024-10-14 17:12:24,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7818 conditions, 7715 events. 350/7715 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 68253 event pairs, 24 based on Foata normal form. 0/6092 useless extension candidates. Maximal degree in co-relation 7737. Up to 70 conditions per place. [2024-10-14 17:12:24,674 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 21 selfloop transitions, 2 changer transitions 0/1055 dead transitions. [2024-10-14 17:12:24,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1025 places, 1055 transitions, 2166 flow [2024-10-14 17:12:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:24,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:24,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2024-10-14 17:12:24,679 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9665461121157324 [2024-10-14 17:12:24,679 INFO L175 Difference]: Start difference. First operand has 1024 places, 1056 transitions, 2122 flow. Second operand 3 states and 3207 transitions. [2024-10-14 17:12:24,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1025 places, 1055 transitions, 2166 flow [2024-10-14 17:12:24,685 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1023 places, 1055 transitions, 2162 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:24,696 INFO L231 Difference]: Finished difference. Result has 1023 places, 1055 transitions, 2120 flow [2024-10-14 17:12:24,697 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2116, PETRI_DIFFERENCE_MINUEND_PLACES=1021, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1055, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1053, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2120, PETRI_PLACES=1023, PETRI_TRANSITIONS=1055} [2024-10-14 17:12:24,698 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -13 predicate places. [2024-10-14 17:12:24,698 INFO L471 AbstractCegarLoop]: Abstraction has has 1023 places, 1055 transitions, 2120 flow [2024-10-14 17:12:24,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 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,701 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:24,701 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] [2024-10-14 17:12:24,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:12:24,702 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:24,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:24,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1555495033, now seen corresponding path program 1 times [2024-10-14 17:12:24,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:24,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706052834] [2024-10-14 17:12:24,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:24,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:24,760 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,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:24,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706052834] [2024-10-14 17:12:24,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706052834] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:24,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:24,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:24,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44904756] [2024-10-14 17:12:24,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:24,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:24,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:24,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:24,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:24,814 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1106 [2024-10-14 17:12:24,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:24,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1106 [2024-10-14 17:12:24,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:25,860 INFO L124 PetriNetUnfolderBase]: 150/3278 cut-off events. [2024-10-14 17:12:25,860 INFO L125 PetriNetUnfolderBase]: For 9/33 co-relation queries the response was YES. [2024-10-14 17:12:25,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3346 conditions, 3278 events. 150/3278 cut-off events. For 9/33 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 21542 event pairs, 16 based on Foata normal form. 0/2607 useless extension candidates. Maximal degree in co-relation 3257. Up to 51 conditions per place. [2024-10-14 17:12:25,975 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 18 selfloop transitions, 2 changer transitions 0/1054 dead transitions. [2024-10-14 17:12:25,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1024 places, 1054 transitions, 2158 flow [2024-10-14 17:12:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:25,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-10-14 17:12:25,979 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-10-14 17:12:25,979 INFO L175 Difference]: Start difference. First operand has 1023 places, 1055 transitions, 2120 flow. Second operand 3 states and 3213 transitions. [2024-10-14 17:12:25,979 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1024 places, 1054 transitions, 2158 flow [2024-10-14 17:12:25,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1022 places, 1054 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:25,991 INFO L231 Difference]: Finished difference. Result has 1022 places, 1054 transitions, 2118 flow [2024-10-14 17:12:25,992 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2114, PETRI_DIFFERENCE_MINUEND_PLACES=1020, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1054, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1052, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2118, PETRI_PLACES=1022, PETRI_TRANSITIONS=1054} [2024-10-14 17:12:25,992 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -14 predicate places. [2024-10-14 17:12:25,992 INFO L471 AbstractCegarLoop]: Abstraction has has 1022 places, 1054 transitions, 2118 flow [2024-10-14 17:12:25,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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:25,994 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:25,994 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] [2024-10-14 17:12:25,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:12:25,995 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:25,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:25,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1245634287, now seen corresponding path program 1 times [2024-10-14 17:12:25,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:25,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265193310] [2024-10-14 17:12:25,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:25,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:26,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:26,032 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,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:26,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265193310] [2024-10-14 17:12:26,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265193310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:26,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:26,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:26,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316545932] [2024-10-14 17:12:26,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:26,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:26,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:26,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:26,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:26,074 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1106 [2024-10-14 17:12:26,077 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1022 places, 1054 transitions, 2118 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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,078 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:26,078 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1106 [2024-10-14 17:12:26,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:26,524 INFO L124 PetriNetUnfolderBase]: 74/1603 cut-off events. [2024-10-14 17:12:26,524 INFO L125 PetriNetUnfolderBase]: For 8/14 co-relation queries the response was YES. [2024-10-14 17:12:26,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1658 conditions, 1603 events. 74/1603 cut-off events. For 8/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 7775 event pairs, 12 based on Foata normal form. 0/1291 useless extension candidates. Maximal degree in co-relation 1561. Up to 40 conditions per place. [2024-10-14 17:12:26,597 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/1053 dead transitions. [2024-10-14 17:12:26,597 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1023 places, 1053 transitions, 2150 flow [2024-10-14 17:12:26,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:26,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2024-10-14 17:12:26,601 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9701627486437613 [2024-10-14 17:12:26,601 INFO L175 Difference]: Start difference. First operand has 1022 places, 1054 transitions, 2118 flow. Second operand 3 states and 3219 transitions. [2024-10-14 17:12:26,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1023 places, 1053 transitions, 2150 flow [2024-10-14 17:12:26,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1021 places, 1053 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:26,614 INFO L231 Difference]: Finished difference. Result has 1021 places, 1053 transitions, 2116 flow [2024-10-14 17:12:26,616 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2112, PETRI_DIFFERENCE_MINUEND_PLACES=1019, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1053, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1051, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=1021, PETRI_TRANSITIONS=1053} [2024-10-14 17:12:26,616 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -15 predicate places. [2024-10-14 17:12:26,617 INFO L471 AbstractCegarLoop]: Abstraction has has 1021 places, 1053 transitions, 2116 flow [2024-10-14 17:12:26,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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,619 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:26,619 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] [2024-10-14 17:12:26,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:12:26,620 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:26,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:26,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1361204315, now seen corresponding path program 1 times [2024-10-14 17:12:26,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:26,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144603288] [2024-10-14 17:12:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:26,655 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,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:26,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144603288] [2024-10-14 17:12:26,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144603288] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:26,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:26,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:26,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032674001] [2024-10-14 17:12:26,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:26,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:26,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:26,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:26,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:26,686 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1106 [2024-10-14 17:12:26,689 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 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,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:26,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1106 [2024-10-14 17:12:26,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:27,332 INFO L124 PetriNetUnfolderBase]: 108/2442 cut-off events. [2024-10-14 17:12:27,332 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-10-14 17:12:27,420 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2491 conditions, 2442 events. 108/2442 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 13592 event pairs, 10 based on Foata normal form. 0/1955 useless extension candidates. Maximal degree in co-relation 2386. Up to 35 conditions per place. [2024-10-14 17:12:27,457 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/1052 dead transitions. [2024-10-14 17:12:27,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1022 places, 1052 transitions, 2146 flow [2024-10-14 17:12:27,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:27,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:27,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2024-10-14 17:12:27,461 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9707655213984328 [2024-10-14 17:12:27,461 INFO L175 Difference]: Start difference. First operand has 1021 places, 1053 transitions, 2116 flow. Second operand 3 states and 3221 transitions. [2024-10-14 17:12:27,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1022 places, 1052 transitions, 2146 flow [2024-10-14 17:12:27,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1020 places, 1052 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:27,473 INFO L231 Difference]: Finished difference. Result has 1020 places, 1052 transitions, 2114 flow [2024-10-14 17:12:27,474 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=1018, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1052, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1050, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2114, PETRI_PLACES=1020, PETRI_TRANSITIONS=1052} [2024-10-14 17:12:27,475 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -16 predicate places. [2024-10-14 17:12:27,475 INFO L471 AbstractCegarLoop]: Abstraction has has 1020 places, 1052 transitions, 2114 flow [2024-10-14 17:12:27,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 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,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:27,477 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] [2024-10-14 17:12:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:12:27,478 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:27,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:27,478 INFO L85 PathProgramCache]: Analyzing trace with hash 484561979, now seen corresponding path program 1 times [2024-10-14 17:12:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033932592] [2024-10-14 17:12:27,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:27,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:27,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:27,527 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:27,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:27,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033932592] [2024-10-14 17:12:27,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033932592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:27,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:27,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:27,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3716977] [2024-10-14 17:12:27,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:27,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:27,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:27,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:27,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:27,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1106 [2024-10-14 17:12:27,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 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,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:27,594 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1106 [2024-10-14 17:12:27,594 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:28,691 INFO L124 PetriNetUnfolderBase]: 206/4387 cut-off events. [2024-10-14 17:12:28,691 INFO L125 PetriNetUnfolderBase]: For 13/111 co-relation queries the response was YES. [2024-10-14 17:12:28,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4478 conditions, 4387 events. 206/4387 cut-off events. For 13/111 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 32370 event pairs, 24 based on Foata normal form. 0/3476 useless extension candidates. Maximal degree in co-relation 4365. Up to 70 conditions per place. [2024-10-14 17:12:28,942 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 21 selfloop transitions, 2 changer transitions 0/1051 dead transitions. [2024-10-14 17:12:28,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1021 places, 1051 transitions, 2158 flow [2024-10-14 17:12:28,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:28,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2024-10-14 17:12:28,946 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9665461121157324 [2024-10-14 17:12:28,946 INFO L175 Difference]: Start difference. First operand has 1020 places, 1052 transitions, 2114 flow. Second operand 3 states and 3207 transitions. [2024-10-14 17:12:28,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1021 places, 1051 transitions, 2158 flow [2024-10-14 17:12:28,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1019 places, 1051 transitions, 2154 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:28,956 INFO L231 Difference]: Finished difference. Result has 1019 places, 1051 transitions, 2112 flow [2024-10-14 17:12:28,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2108, PETRI_DIFFERENCE_MINUEND_PLACES=1017, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1051, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1049, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2112, PETRI_PLACES=1019, PETRI_TRANSITIONS=1051} [2024-10-14 17:12:28,958 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -17 predicate places. [2024-10-14 17:12:28,958 INFO L471 AbstractCegarLoop]: Abstraction has has 1019 places, 1051 transitions, 2112 flow [2024-10-14 17:12:28,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 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:28,959 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:28,959 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] [2024-10-14 17:12:28,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:12:28,959 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:28,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:28,960 INFO L85 PathProgramCache]: Analyzing trace with hash -966062997, now seen corresponding path program 1 times [2024-10-14 17:12:28,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:28,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245630991] [2024-10-14 17:12:28,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:28,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:28,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:28,999 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:28,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:29,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245630991] [2024-10-14 17:12:29,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245630991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:29,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:29,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:29,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458574757] [2024-10-14 17:12:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:29,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:29,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:29,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:29,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:29,051 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1064 out of 1106 [2024-10-14 17:12:29,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:29,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1064 of 1106 [2024-10-14 17:12:29,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:29,472 INFO L124 PetriNetUnfolderBase]: 78/1568 cut-off events. [2024-10-14 17:12:29,473 INFO L125 PetriNetUnfolderBase]: For 18/20 co-relation queries the response was YES. [2024-10-14 17:12:29,515 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1630 conditions, 1568 events. 78/1568 cut-off events. For 18/20 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 7422 event pairs, 16 based on Foata normal form. 0/1272 useless extension candidates. Maximal degree in co-relation 1509. Up to 53 conditions per place. [2024-10-14 17:12:29,534 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 18 selfloop transitions, 2 changer transitions 0/1050 dead transitions. [2024-10-14 17:12:29,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1020 places, 1050 transitions, 2150 flow [2024-10-14 17:12:29,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:29,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-10-14 17:12:29,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-10-14 17:12:29,540 INFO L175 Difference]: Start difference. First operand has 1019 places, 1051 transitions, 2112 flow. Second operand 3 states and 3213 transitions. [2024-10-14 17:12:29,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1020 places, 1050 transitions, 2150 flow [2024-10-14 17:12:29,545 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1018 places, 1050 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:29,554 INFO L231 Difference]: Finished difference. Result has 1018 places, 1050 transitions, 2110 flow [2024-10-14 17:12:29,556 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2106, PETRI_DIFFERENCE_MINUEND_PLACES=1016, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1050, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1048, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2110, PETRI_PLACES=1018, PETRI_TRANSITIONS=1050} [2024-10-14 17:12:29,557 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -18 predicate places. [2024-10-14 17:12:29,557 INFO L471 AbstractCegarLoop]: Abstraction has has 1018 places, 1050 transitions, 2110 flow [2024-10-14 17:12:29,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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,558 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:29,558 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:12:29,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 17:12:29,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:29,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:29,560 INFO L85 PathProgramCache]: Analyzing trace with hash -622267050, now seen corresponding path program 1 times [2024-10-14 17:12:29,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:29,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683307638] [2024-10-14 17:12:29,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:29,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:29,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:29,601 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,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:29,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683307638] [2024-10-14 17:12:29,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683307638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:29,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389335320] [2024-10-14 17:12:29,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:29,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:29,635 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1067 out of 1106 [2024-10-14 17:12:29,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1018 places, 1050 transitions, 2110 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:29,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1067 of 1106 [2024-10-14 17:12:29,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:29,991 INFO L124 PetriNetUnfolderBase]: 74/1599 cut-off events. [2024-10-14 17:12:29,991 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2024-10-14 17:12:30,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 1599 events. 74/1599 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 7287 event pairs, 12 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1519. Up to 40 conditions per place. [2024-10-14 17:12:30,056 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/1049 dead transitions. [2024-10-14 17:12:30,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1019 places, 1049 transitions, 2142 flow [2024-10-14 17:12:30,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:30,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:30,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3219 transitions. [2024-10-14 17:12:30,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9701627486437613 [2024-10-14 17:12:30,060 INFO L175 Difference]: Start difference. First operand has 1018 places, 1050 transitions, 2110 flow. Second operand 3 states and 3219 transitions. [2024-10-14 17:12:30,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1019 places, 1049 transitions, 2142 flow [2024-10-14 17:12:30,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1017 places, 1049 transitions, 2138 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:30,074 INFO L231 Difference]: Finished difference. Result has 1017 places, 1049 transitions, 2108 flow [2024-10-14 17:12:30,076 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2104, PETRI_DIFFERENCE_MINUEND_PLACES=1015, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1049, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1047, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2108, PETRI_PLACES=1017, PETRI_TRANSITIONS=1049} [2024-10-14 17:12:30,076 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -19 predicate places. [2024-10-14 17:12:30,077 INFO L471 AbstractCegarLoop]: Abstraction has has 1017 places, 1049 transitions, 2108 flow [2024-10-14 17:12:30,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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:30,078 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:30,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] [2024-10-14 17:12:30,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 17:12:30,078 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:30,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:30,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1667660237, now seen corresponding path program 1 times [2024-10-14 17:12:30,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:30,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337118592] [2024-10-14 17:12:30,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:30,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:30,109 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:30,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:30,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337118592] [2024-10-14 17:12:30,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337118592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:30,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:30,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:30,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927447742] [2024-10-14 17:12:30,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:30,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:30,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:30,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:30,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:30,143 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1068 out of 1106 [2024-10-14 17:12:30,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 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:30,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:30,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1068 of 1106 [2024-10-14 17:12:30,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:30,456 INFO L124 PetriNetUnfolderBase]: 48/1068 cut-off events. [2024-10-14 17:12:30,457 INFO L125 PetriNetUnfolderBase]: For 6/8 co-relation queries the response was YES. [2024-10-14 17:12:30,491 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1112 conditions, 1068 events. 48/1068 cut-off events. For 6/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 4354 event pairs, 10 based on Foata normal form. 0/884 useless extension candidates. Maximal degree in co-relation 975. Up to 35 conditions per place. [2024-10-14 17:12:30,508 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/1048 dead transitions. [2024-10-14 17:12:30,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1048 transitions, 2138 flow [2024-10-14 17:12:30,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:30,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:30,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3221 transitions. [2024-10-14 17:12:30,513 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9707655213984328 [2024-10-14 17:12:30,513 INFO L175 Difference]: Start difference. First operand has 1017 places, 1049 transitions, 2108 flow. Second operand 3 states and 3221 transitions. [2024-10-14 17:12:30,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1048 transitions, 2138 flow [2024-10-14 17:12:30,519 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1048 transitions, 2134 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:30,528 INFO L231 Difference]: Finished difference. Result has 1016 places, 1048 transitions, 2106 flow [2024-10-14 17:12:30,530 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=1014, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1048, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1046, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2106, PETRI_PLACES=1016, PETRI_TRANSITIONS=1048} [2024-10-14 17:12:30,531 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -20 predicate places. [2024-10-14 17:12:30,531 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1048 transitions, 2106 flow [2024-10-14 17:12:30,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1069.3333333333333) internal successors, (3208), 3 states have internal predecessors, (3208), 0 states have call successors, (0), 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:30,532 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:30,532 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:30,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 17:12:30,532 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:30,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:30,533 INFO L85 PathProgramCache]: Analyzing trace with hash 1330654382, now seen corresponding path program 1 times [2024-10-14 17:12:30,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:30,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666460239] [2024-10-14 17:12:30,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:30,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:30,565 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:30,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:30,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666460239] [2024-10-14 17:12:30,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666460239] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:30,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:30,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:30,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843290436] [2024-10-14 17:12:30,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:30,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:30,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:30,617 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1061 out of 1106 [2024-10-14 17:12:30,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 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:30,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:30,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1061 of 1106 [2024-10-14 17:12:30,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:31,062 INFO L124 PetriNetUnfolderBase]: 86/1597 cut-off events. [2024-10-14 17:12:31,062 INFO L125 PetriNetUnfolderBase]: For 26/28 co-relation queries the response was YES. [2024-10-14 17:12:31,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1676 conditions, 1597 events. 86/1597 cut-off events. For 26/28 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8317 event pairs, 24 based on Foata normal form. 0/1292 useless extension candidates. Maximal degree in co-relation 1531. Up to 70 conditions per place. [2024-10-14 17:12:31,117 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 21 selfloop transitions, 2 changer transitions 0/1047 dead transitions. [2024-10-14 17:12:31,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1047 transitions, 2150 flow [2024-10-14 17:12:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3207 transitions. [2024-10-14 17:12:31,121 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9665461121157324 [2024-10-14 17:12:31,121 INFO L175 Difference]: Start difference. First operand has 1016 places, 1048 transitions, 2106 flow. Second operand 3 states and 3207 transitions. [2024-10-14 17:12:31,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1047 transitions, 2150 flow [2024-10-14 17:12:31,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1015 places, 1047 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:31,135 INFO L231 Difference]: Finished difference. Result has 1015 places, 1047 transitions, 2104 flow [2024-10-14 17:12:31,136 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=1013, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1047, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1045, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2104, PETRI_PLACES=1015, PETRI_TRANSITIONS=1047} [2024-10-14 17:12:31,137 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -21 predicate places. [2024-10-14 17:12:31,137 INFO L471 AbstractCegarLoop]: Abstraction has has 1015 places, 1047 transitions, 2104 flow [2024-10-14 17:12:31,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.3333333333333) internal successors, (3187), 3 states have internal predecessors, (3187), 0 states have call successors, (0), 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,138 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:31,138 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:31,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 17:12:31,139 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:31,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:31,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1334523779, now seen corresponding path program 1 times [2024-10-14 17:12:31,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:31,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959855132] [2024-10-14 17:12:31,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:31,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:31,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:31,187 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,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:31,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959855132] [2024-10-14 17:12:31,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959855132] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:31,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:31,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:31,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983051834] [2024-10-14 17:12:31,188 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:31,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:31,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:31,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:31,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:31,209 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1070 out of 1106 [2024-10-14 17:12:31,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1015 places, 1047 transitions, 2104 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 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,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:31,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1070 of 1106 [2024-10-14 17:12:31,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:31,907 INFO L124 PetriNetUnfolderBase]: 122/2607 cut-off events. [2024-10-14 17:12:31,907 INFO L125 PetriNetUnfolderBase]: For 6/15 co-relation queries the response was YES. [2024-10-14 17:12:31,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 2607 events. 122/2607 cut-off events. For 6/15 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 14372 event pairs, 15 based on Foata normal form. 0/2089 useless extension candidates. Maximal degree in co-relation 2510. Up to 43 conditions per place. [2024-10-14 17:12:32,000 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 12 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2024-10-14 17:12:32,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1016 places, 1046 transitions, 2130 flow [2024-10-14 17:12:32,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:32,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:32,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3225 transitions. [2024-10-14 17:12:32,004 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9719710669077758 [2024-10-14 17:12:32,004 INFO L175 Difference]: Start difference. First operand has 1015 places, 1047 transitions, 2104 flow. Second operand 3 states and 3225 transitions. [2024-10-14 17:12:32,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1016 places, 1046 transitions, 2130 flow [2024-10-14 17:12:32,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1014 places, 1046 transitions, 2126 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:32,014 INFO L231 Difference]: Finished difference. Result has 1014 places, 1046 transitions, 2102 flow [2024-10-14 17:12:32,015 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2098, PETRI_DIFFERENCE_MINUEND_PLACES=1012, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1046, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1044, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2102, PETRI_PLACES=1014, PETRI_TRANSITIONS=1046} [2024-10-14 17:12:32,015 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -22 predicate places. [2024-10-14 17:12:32,015 INFO L471 AbstractCegarLoop]: Abstraction has has 1014 places, 1046 transitions, 2102 flow [2024-10-14 17:12:32,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 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:32,016 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:32,016 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:32,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 17:12:32,017 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:32,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:32,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1394466980, now seen corresponding path program 1 times [2024-10-14 17:12:32,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:32,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811951454] [2024-10-14 17:12:32,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:32,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:32,573 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:32,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:32,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811951454] [2024-10-14 17:12:32,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811951454] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:32,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:32,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:12:32,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379725732] [2024-10-14 17:12:32,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:32,574 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 17:12:32,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:32,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 17:12:32,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-10-14 17:12:32,690 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1054 out of 1106 [2024-10-14 17:12:32,694 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1014 places, 1046 transitions, 2102 flow. Second operand has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 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:32,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:32,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1054 of 1106 [2024-10-14 17:12:32,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:35,478 INFO L124 PetriNetUnfolderBase]: 894/12786 cut-off events. [2024-10-14 17:12:35,478 INFO L125 PetriNetUnfolderBase]: For 59/69 co-relation queries the response was YES. [2024-10-14 17:12:35,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13406 conditions, 12786 events. 894/12786 cut-off events. For 59/69 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 132265 event pairs, 264 based on Foata normal form. 0/10058 useless extension candidates. Maximal degree in co-relation 13194. Up to 580 conditions per place. [2024-10-14 17:12:35,818 INFO L140 encePairwiseOnDemand]: 1100/1106 looper letters, 26 selfloop transitions, 5 changer transitions 0/1045 dead transitions. [2024-10-14 17:12:35,818 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1018 places, 1045 transitions, 2162 flow [2024-10-14 17:12:35,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:12:35,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:12:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6356 transitions. [2024-10-14 17:12:35,827 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9578059071729957 [2024-10-14 17:12:35,827 INFO L175 Difference]: Start difference. First operand has 1014 places, 1046 transitions, 2102 flow. Second operand 6 states and 6356 transitions. [2024-10-14 17:12:35,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1018 places, 1045 transitions, 2162 flow [2024-10-14 17:12:35,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1016 places, 1045 transitions, 2158 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:35,839 INFO L231 Difference]: Finished difference. Result has 1016 places, 1045 transitions, 2106 flow [2024-10-14 17:12:35,840 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2096, PETRI_DIFFERENCE_MINUEND_PLACES=1011, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1045, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2106, PETRI_PLACES=1016, PETRI_TRANSITIONS=1045} [2024-10-14 17:12:35,840 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -20 predicate places. [2024-10-14 17:12:35,841 INFO L471 AbstractCegarLoop]: Abstraction has has 1016 places, 1045 transitions, 2106 flow [2024-10-14 17:12:35,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1055.5) internal successors, (6333), 6 states have internal predecessors, (6333), 0 states have call successors, (0), 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,843 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:35,843 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] [2024-10-14 17:12:35,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 17:12:35,843 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:35,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:35,844 INFO L85 PathProgramCache]: Analyzing trace with hash -722575298, now seen corresponding path program 1 times [2024-10-14 17:12:35,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:35,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554139013] [2024-10-14 17:12:35,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:35,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:35,887 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:35,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:35,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554139013] [2024-10-14 17:12:35,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554139013] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:35,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:35,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:35,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372135735] [2024-10-14 17:12:35,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:35,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:35,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:35,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:35,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:35,920 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1106 [2024-10-14 17:12:35,923 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1016 places, 1045 transitions, 2106 flow. Second operand has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 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,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:35,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1106 [2024-10-14 17:12:35,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:36,267 INFO L124 PetriNetUnfolderBase]: 80/1600 cut-off events. [2024-10-14 17:12:36,267 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:12:36,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1681 conditions, 1600 events. 80/1600 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 8241 event pairs, 14 based on Foata normal form. 0/1301 useless extension candidates. Maximal degree in co-relation 1663. Up to 43 conditions per place. [2024-10-14 17:12:36,327 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 16 selfloop transitions, 2 changer transitions 0/1046 dead transitions. [2024-10-14 17:12:36,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1017 places, 1046 transitions, 2146 flow [2024-10-14 17:12:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:36,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:36,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2024-10-14 17:12:36,332 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9722724532851115 [2024-10-14 17:12:36,332 INFO L175 Difference]: Start difference. First operand has 1016 places, 1045 transitions, 2106 flow. Second operand 3 states and 3226 transitions. [2024-10-14 17:12:36,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1017 places, 1046 transitions, 2146 flow [2024-10-14 17:12:36,336 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1012 places, 1046 transitions, 2136 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-10-14 17:12:36,342 INFO L231 Difference]: Finished difference. Result has 1012 places, 1044 transitions, 2098 flow [2024-10-14 17:12:36,343 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=1010, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1044, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1042, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2098, PETRI_PLACES=1012, PETRI_TRANSITIONS=1044} [2024-10-14 17:12:36,343 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -24 predicate places. [2024-10-14 17:12:36,343 INFO L471 AbstractCegarLoop]: Abstraction has has 1012 places, 1044 transitions, 2098 flow [2024-10-14 17:12:36,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1070.6666666666667) internal successors, (3212), 3 states have internal predecessors, (3212), 0 states have call successors, (0), 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,344 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:36,344 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] [2024-10-14 17:12:36,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 17:12:36,344 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:36,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:36,345 INFO L85 PathProgramCache]: Analyzing trace with hash -667680966, now seen corresponding path program 1 times [2024-10-14 17:12:36,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:36,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285927305] [2024-10-14 17:12:36,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:36,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:36,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:36,390 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:36,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:36,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285927305] [2024-10-14 17:12:36,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285927305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:36,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:36,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:36,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138320009] [2024-10-14 17:12:36,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:36,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:36,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:36,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:36,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:36,442 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:12:36,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1012 places, 1044 transitions, 2098 flow. Second operand has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 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,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:36,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:12:36,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:36,908 INFO L124 PetriNetUnfolderBase]: 116/2150 cut-off events. [2024-10-14 17:12:36,909 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:12:36,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2270 conditions, 2150 events. 116/2150 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 13227 event pairs, 26 based on Foata normal form. 0/1736 useless extension candidates. Maximal degree in co-relation 2058. Up to 73 conditions per place. [2024-10-14 17:12:36,990 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 2 changer transitions 0/1045 dead transitions. [2024-10-14 17:12:36,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1013 places, 1045 transitions, 2150 flow [2024-10-14 17:12:36,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:36,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2024-10-14 17:12:36,995 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9686558167570826 [2024-10-14 17:12:36,995 INFO L175 Difference]: Start difference. First operand has 1012 places, 1044 transitions, 2098 flow. Second operand 3 states and 3214 transitions. [2024-10-14 17:12:36,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1013 places, 1045 transitions, 2150 flow [2024-10-14 17:12:37,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1011 places, 1045 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:37,011 INFO L231 Difference]: Finished difference. Result has 1011 places, 1043 transitions, 2096 flow [2024-10-14 17:12:37,012 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2092, PETRI_DIFFERENCE_MINUEND_PLACES=1009, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1043, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1041, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=1011, PETRI_TRANSITIONS=1043} [2024-10-14 17:12:37,013 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -25 predicate places. [2024-10-14 17:12:37,013 INFO L471 AbstractCegarLoop]: Abstraction has has 1011 places, 1043 transitions, 2096 flow [2024-10-14 17:12:37,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1064.6666666666667) internal successors, (3194), 3 states have internal predecessors, (3194), 0 states have call successors, (0), 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:37,014 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:37,014 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] [2024-10-14 17:12:37,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 17:12:37,015 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:37,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1092004558, now seen corresponding path program 1 times [2024-10-14 17:12:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:37,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233716266] [2024-10-14 17:12:37,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:37,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:37,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:37,055 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:37,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:37,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233716266] [2024-10-14 17:12:37,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233716266] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:37,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:37,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:37,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733955265] [2024-10-14 17:12:37,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:37,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:37,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:37,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:37,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:37,085 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1106 [2024-10-14 17:12:37,088 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1011 places, 1043 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 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:37,088 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:37,088 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1106 [2024-10-14 17:12:37,088 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:37,595 INFO L124 PetriNetUnfolderBase]: 92/1872 cut-off events. [2024-10-14 17:12:37,595 INFO L125 PetriNetUnfolderBase]: For 11/37 co-relation queries the response was YES. [2024-10-14 17:12:37,637 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1941 conditions, 1872 events. 92/1872 cut-off events. For 11/37 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 10196 event pairs, 4 based on Foata normal form. 0/1511 useless extension candidates. Maximal degree in co-relation 1724. Up to 43 conditions per place. [2024-10-14 17:12:37,655 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 16 selfloop transitions, 2 changer transitions 0/1044 dead transitions. [2024-10-14 17:12:37,655 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1012 places, 1044 transitions, 2136 flow [2024-10-14 17:12:37,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:37,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2024-10-14 17:12:37,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9722724532851115 [2024-10-14 17:12:37,658 INFO L175 Difference]: Start difference. First operand has 1011 places, 1043 transitions, 2096 flow. Second operand 3 states and 3226 transitions. [2024-10-14 17:12:37,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1012 places, 1044 transitions, 2136 flow [2024-10-14 17:12:37,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1010 places, 1044 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:37,667 INFO L231 Difference]: Finished difference. Result has 1010 places, 1042 transitions, 2094 flow [2024-10-14 17:12:37,668 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=1008, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1042, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1040, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2094, PETRI_PLACES=1010, PETRI_TRANSITIONS=1042} [2024-10-14 17:12:37,668 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -26 predicate places. [2024-10-14 17:12:37,669 INFO L471 AbstractCegarLoop]: Abstraction has has 1010 places, 1042 transitions, 2094 flow [2024-10-14 17:12:37,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.0) internal successors, (3213), 3 states have internal predecessors, (3213), 0 states have call successors, (0), 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:37,670 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:37,670 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] [2024-10-14 17:12:37,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 17:12:37,670 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:37,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:37,671 INFO L85 PathProgramCache]: Analyzing trace with hash -887636733, now seen corresponding path program 1 times [2024-10-14 17:12:37,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:37,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991733571] [2024-10-14 17:12:37,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:37,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:37,711 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:37,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:37,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991733571] [2024-10-14 17:12:37,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991733571] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:37,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:37,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:37,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196280434] [2024-10-14 17:12:37,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:37,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:37,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:37,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:37,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:37,748 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1106 [2024-10-14 17:12:37,750 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1010 places, 1042 transitions, 2094 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 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:37,750 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:37,750 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1106 [2024-10-14 17:12:37,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:39,465 INFO L124 PetriNetUnfolderBase]: 441/6237 cut-off events. [2024-10-14 17:12:39,465 INFO L125 PetriNetUnfolderBase]: For 30/30 co-relation queries the response was YES. [2024-10-14 17:12:39,726 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6608 conditions, 6237 events. 441/6237 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 51521 event pairs, 110 based on Foata normal form. 0/4991 useless extension candidates. Maximal degree in co-relation 6094. Up to 339 conditions per place. [2024-10-14 17:12:39,828 INFO L140 encePairwiseOnDemand]: 1094/1106 looper letters, 29 selfloop transitions, 2 changer transitions 0/1036 dead transitions. [2024-10-14 17:12:39,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1002 places, 1036 transitions, 2146 flow [2024-10-14 17:12:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:39,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2024-10-14 17:12:39,831 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608197709463532 [2024-10-14 17:12:39,831 INFO L175 Difference]: Start difference. First operand has 1010 places, 1042 transitions, 2094 flow. Second operand 3 states and 3188 transitions. [2024-10-14 17:12:39,831 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1002 places, 1036 transitions, 2146 flow [2024-10-14 17:12:39,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1000 places, 1036 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:39,842 INFO L231 Difference]: Finished difference. Result has 1001 places, 1034 transitions, 2084 flow [2024-10-14 17:12:39,843 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2070, PETRI_DIFFERENCE_MINUEND_PLACES=998, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1032, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1030, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2084, PETRI_PLACES=1001, PETRI_TRANSITIONS=1034} [2024-10-14 17:12:39,844 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -35 predicate places. [2024-10-14 17:12:39,844 INFO L471 AbstractCegarLoop]: Abstraction has has 1001 places, 1034 transitions, 2084 flow [2024-10-14 17:12:39,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 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:39,844 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:39,844 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:39,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 17:12:39,845 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:39,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:39,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1679671333, now seen corresponding path program 1 times [2024-10-14 17:12:39,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:39,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85403156] [2024-10-14 17:12:39,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:39,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:39,891 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:39,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:39,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85403156] [2024-10-14 17:12:39,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85403156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:39,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:39,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:39,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671434699] [2024-10-14 17:12:39,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:39,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:39,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:39,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:39,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:39,926 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1106 [2024-10-14 17:12:39,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1001 places, 1034 transitions, 2084 flow. Second operand has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 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:39,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:39,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1106 [2024-10-14 17:12:39,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:42,411 INFO L124 PetriNetUnfolderBase]: 859/10615 cut-off events. [2024-10-14 17:12:42,411 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-10-14 17:12:42,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11421 conditions, 10615 events. 859/10615 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 101472 event pairs, 190 based on Foata normal form. 0/8539 useless extension candidates. Maximal degree in co-relation 10945. Up to 660 conditions per place. [2024-10-14 17:12:42,728 INFO L140 encePairwiseOnDemand]: 1094/1106 looper letters, 29 selfloop transitions, 2 changer transitions 0/1028 dead transitions. [2024-10-14 17:12:42,729 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 993 places, 1028 transitions, 2136 flow [2024-10-14 17:12:42,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:42,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:42,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2024-10-14 17:12:42,731 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608197709463532 [2024-10-14 17:12:42,731 INFO L175 Difference]: Start difference. First operand has 1001 places, 1034 transitions, 2084 flow. Second operand 3 states and 3188 transitions. [2024-10-14 17:12:42,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 993 places, 1028 transitions, 2136 flow [2024-10-14 17:12:42,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 993 places, 1028 transitions, 2136 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:42,743 INFO L231 Difference]: Finished difference. Result has 994 places, 1026 transitions, 2078 flow [2024-10-14 17:12:42,745 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=991, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1026} [2024-10-14 17:12:42,745 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2024-10-14 17:12:42,745 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1026 transitions, 2078 flow [2024-10-14 17:12:42,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.3333333333333) internal successors, (3151), 3 states have internal predecessors, (3151), 0 states have call successors, (0), 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:42,746 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:42,747 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] [2024-10-14 17:12:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 17:12:42,747 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:42,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:42,747 INFO L85 PathProgramCache]: Analyzing trace with hash 287660671, now seen corresponding path program 1 times [2024-10-14 17:12:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938626584] [2024-10-14 17:12:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:42,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:42,786 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:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938626584] [2024-10-14 17:12:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938626584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:42,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:42,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099617598] [2024-10-14 17:12:42,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:42,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:42,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:42,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:42,838 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:12:42,840 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1026 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 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:42,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:42,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:12:42,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:43,579 INFO L124 PetriNetUnfolderBase]: 167/2867 cut-off events. [2024-10-14 17:12:43,579 INFO L125 PetriNetUnfolderBase]: For 17/44 co-relation queries the response was YES. [2024-10-14 17:12:43,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3036 conditions, 2867 events. 167/2867 cut-off events. For 17/44 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 20490 event pairs, 26 based on Foata normal form. 0/2338 useless extension candidates. Maximal degree in co-relation 2301. Up to 106 conditions per place. [2024-10-14 17:12:43,701 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 2 changer transitions 0/1027 dead transitions. [2024-10-14 17:12:43,701 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 995 places, 1027 transitions, 2130 flow [2024-10-14 17:12:43,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:43,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:43,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2024-10-14 17:12:43,703 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9686558167570826 [2024-10-14 17:12:43,704 INFO L175 Difference]: Start difference. First operand has 994 places, 1026 transitions, 2078 flow. Second operand 3 states and 3214 transitions. [2024-10-14 17:12:43,704 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 995 places, 1027 transitions, 2130 flow [2024-10-14 17:12:43,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 995 places, 1027 transitions, 2130 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:43,716 INFO L231 Difference]: Finished difference. Result has 995 places, 1025 transitions, 2080 flow [2024-10-14 17:12:43,717 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2076, PETRI_DIFFERENCE_MINUEND_PLACES=993, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1025, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1023, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2080, PETRI_PLACES=995, PETRI_TRANSITIONS=1025} [2024-10-14 17:12:43,717 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -41 predicate places. [2024-10-14 17:12:43,718 INFO L471 AbstractCegarLoop]: Abstraction has has 995 places, 1025 transitions, 2080 flow [2024-10-14 17:12:43,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 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:43,719 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:43,719 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] [2024-10-14 17:12:43,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 17:12:43,719 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:43,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:43,720 INFO L85 PathProgramCache]: Analyzing trace with hash -2112964481, now seen corresponding path program 1 times [2024-10-14 17:12:43,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:43,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142898756] [2024-10-14 17:12:43,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:43,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:43,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:43,781 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:43,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:43,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142898756] [2024-10-14 17:12:43,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142898756] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:43,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:43,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196815055] [2024-10-14 17:12:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:43,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:43,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:43,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:43,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:43,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1069 out of 1106 [2024-10-14 17:12:43,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 995 places, 1025 transitions, 2080 flow. Second operand has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 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:43,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:43,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1069 of 1106 [2024-10-14 17:12:43,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:44,305 INFO L124 PetriNetUnfolderBase]: 106/2076 cut-off events. [2024-10-14 17:12:44,305 INFO L125 PetriNetUnfolderBase]: For 21/44 co-relation queries the response was YES. [2024-10-14 17:12:44,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2157 conditions, 2076 events. 106/2076 cut-off events. For 21/44 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11731 event pairs, 4 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 1930. Up to 48 conditions per place. [2024-10-14 17:12:44,390 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 16 selfloop transitions, 2 changer transitions 0/1026 dead transitions. [2024-10-14 17:12:44,390 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 996 places, 1026 transitions, 2120 flow [2024-10-14 17:12:44,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:44,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3226 transitions. [2024-10-14 17:12:44,392 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9722724532851115 [2024-10-14 17:12:44,393 INFO L175 Difference]: Start difference. First operand has 995 places, 1025 transitions, 2080 flow. Second operand 3 states and 3226 transitions. [2024-10-14 17:12:44,393 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 996 places, 1026 transitions, 2120 flow [2024-10-14 17:12:44,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 994 places, 1026 transitions, 2116 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:44,403 INFO L231 Difference]: Finished difference. Result has 994 places, 1024 transitions, 2078 flow [2024-10-14 17:12:44,404 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2074, PETRI_DIFFERENCE_MINUEND_PLACES=992, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1024, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1022, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2078, PETRI_PLACES=994, PETRI_TRANSITIONS=1024} [2024-10-14 17:12:44,405 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -42 predicate places. [2024-10-14 17:12:44,405 INFO L471 AbstractCegarLoop]: Abstraction has has 994 places, 1024 transitions, 2078 flow [2024-10-14 17:12:44,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1071.3333333333333) internal successors, (3214), 3 states have internal predecessors, (3214), 0 states have call successors, (0), 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,405 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:44,406 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:44,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 17:12:44,406 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:44,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:44,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1572802719, now seen corresponding path program 1 times [2024-10-14 17:12:44,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:44,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452003175] [2024-10-14 17:12:44,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:44,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:44,458 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:44,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:44,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452003175] [2024-10-14 17:12:44,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452003175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:44,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:44,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:44,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464790267] [2024-10-14 17:12:44,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:44,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:44,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:44,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:44,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:44,496 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1106 [2024-10-14 17:12:44,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 994 places, 1024 transitions, 2078 flow. Second operand has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 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,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:44,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1106 [2024-10-14 17:12:44,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:45,475 INFO L124 PetriNetUnfolderBase]: 192/3769 cut-off events. [2024-10-14 17:12:45,475 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2024-10-14 17:12:45,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3912 conditions, 3769 events. 192/3769 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 25693 event pairs, 8 based on Foata normal form. 0/3078 useless extension candidates. Maximal degree in co-relation 3434. Up to 42 conditions per place. [2024-10-14 17:12:45,582 INFO L140 encePairwiseOnDemand]: 1092/1106 looper letters, 18 selfloop transitions, 9 changer transitions 0/1025 dead transitions. [2024-10-14 17:12:45,582 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 991 places, 1025 transitions, 2136 flow [2024-10-14 17:12:45,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2024-10-14 17:12:45,584 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9680530440024111 [2024-10-14 17:12:45,584 INFO L175 Difference]: Start difference. First operand has 994 places, 1024 transitions, 2078 flow. Second operand 3 states and 3212 transitions. [2024-10-14 17:12:45,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 991 places, 1025 transitions, 2136 flow [2024-10-14 17:12:45,587 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 989 places, 1025 transitions, 2132 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:45,595 INFO L231 Difference]: Finished difference. Result has 990 places, 1023 transitions, 2107 flow [2024-10-14 17:12:45,596 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2064, PETRI_DIFFERENCE_MINUEND_PLACES=987, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1019, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1010, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2107, PETRI_PLACES=990, PETRI_TRANSITIONS=1023} [2024-10-14 17:12:45,597 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -46 predicate places. [2024-10-14 17:12:45,597 INFO L471 AbstractCegarLoop]: Abstraction has has 990 places, 1023 transitions, 2107 flow [2024-10-14 17:12:45,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.3333333333333) internal successors, (3184), 3 states have internal predecessors, (3184), 0 states have call successors, (0), 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,598 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:45,598 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] [2024-10-14 17:12:45,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 17:12:45,598 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:45,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:45,599 INFO L85 PathProgramCache]: Analyzing trace with hash -397593643, now seen corresponding path program 1 times [2024-10-14 17:12:45,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:45,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125934197] [2024-10-14 17:12:45,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:45,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:45,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:45,638 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:45,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:45,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125934197] [2024-10-14 17:12:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125934197] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785896240] [2024-10-14 17:12:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:45,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:45,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:45,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:45,674 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1049 out of 1106 [2024-10-14 17:12:45,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 990 places, 1023 transitions, 2107 flow. Second operand has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 0 states have call successors, (0), 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,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:45,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1049 of 1106 [2024-10-14 17:12:45,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:49,962 INFO L124 PetriNetUnfolderBase]: 1569/19951 cut-off events. [2024-10-14 17:12:49,963 INFO L125 PetriNetUnfolderBase]: For 147/153 co-relation queries the response was YES. [2024-10-14 17:12:50,204 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21197 conditions, 19951 events. 1569/19951 cut-off events. For 147/153 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 223259 event pairs, 488 based on Foata normal form. 0/16094 useless extension candidates. Maximal degree in co-relation 16212. Up to 1183 conditions per place. [2024-10-14 17:12:50,323 INFO L140 encePairwiseOnDemand]: 1094/1106 looper letters, 29 selfloop transitions, 2 changer transitions 0/1017 dead transitions. [2024-10-14 17:12:50,323 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 982 places, 1017 transitions, 2159 flow [2024-10-14 17:12:50,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:50,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3188 transitions. [2024-10-14 17:12:50,326 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9608197709463532 [2024-10-14 17:12:50,326 INFO L175 Difference]: Start difference. First operand has 990 places, 1023 transitions, 2107 flow. Second operand 3 states and 3188 transitions. [2024-10-14 17:12:50,326 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 982 places, 1017 transitions, 2159 flow [2024-10-14 17:12:50,331 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 981 places, 1017 transitions, 2150 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:50,339 INFO L231 Difference]: Finished difference. Result has 982 places, 1015 transitions, 2092 flow [2024-10-14 17:12:50,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=979, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=982, PETRI_TRANSITIONS=1015} [2024-10-14 17:12:50,341 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -54 predicate places. [2024-10-14 17:12:50,341 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1015 transitions, 2092 flow [2024-10-14 17:12:50,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1050.6666666666667) internal successors, (3152), 3 states have internal predecessors, (3152), 0 states have call successors, (0), 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,342 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:50,342 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] [2024-10-14 17:12:50,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 17:12:50,343 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:50,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:50,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1594694388, now seen corresponding path program 1 times [2024-10-14 17:12:50,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:50,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812776949] [2024-10-14 17:12:50,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:50,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:50,394 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:50,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:50,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812776949] [2024-10-14 17:12:50,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812776949] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:50,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:50,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:50,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431887022] [2024-10-14 17:12:50,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:50,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:50,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:50,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:50,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:50,441 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1106 [2024-10-14 17:12:50,443 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1015 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 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,444 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:50,444 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1106 [2024-10-14 17:12:50,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:51,511 INFO L124 PetriNetUnfolderBase]: 262/5102 cut-off events. [2024-10-14 17:12:51,511 INFO L125 PetriNetUnfolderBase]: For 36/52 co-relation queries the response was YES. [2024-10-14 17:12:51,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5302 conditions, 5102 events. 262/5102 cut-off events. For 36/52 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 44398 event pairs, 20 based on Foata normal form. 1/4212 useless extension candidates. Maximal degree in co-relation 4576. Up to 68 conditions per place. [2024-10-14 17:12:51,697 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 3 changer transitions 0/1016 dead transitions. [2024-10-14 17:12:51,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 983 places, 1016 transitions, 2146 flow [2024-10-14 17:12:51,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:51,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:51,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2024-10-14 17:12:51,700 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9704641350210971 [2024-10-14 17:12:51,700 INFO L175 Difference]: Start difference. First operand has 982 places, 1015 transitions, 2092 flow. Second operand 3 states and 3220 transitions. [2024-10-14 17:12:51,700 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 983 places, 1016 transitions, 2146 flow [2024-10-14 17:12:51,707 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 983 places, 1016 transitions, 2146 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:12:51,717 INFO L231 Difference]: Finished difference. Result has 983 places, 1014 transitions, 2096 flow [2024-10-14 17:12:51,718 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2090, PETRI_DIFFERENCE_MINUEND_PLACES=981, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1014, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2096, PETRI_PLACES=983, PETRI_TRANSITIONS=1014} [2024-10-14 17:12:51,719 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -53 predicate places. [2024-10-14 17:12:51,719 INFO L471 AbstractCegarLoop]: Abstraction has has 983 places, 1014 transitions, 2096 flow [2024-10-14 17:12:51,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1067.6666666666667) internal successors, (3203), 3 states have internal predecessors, (3203), 0 states have call successors, (0), 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,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:51,720 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] [2024-10-14 17:12:51,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 17:12:51,720 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting thread3Err1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:51,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:51,721 INFO L85 PathProgramCache]: Analyzing trace with hash 402177859, now seen corresponding path program 1 times [2024-10-14 17:12:51,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:51,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303784075] [2024-10-14 17:12:51,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:51,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:51,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:51,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:51,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:51,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303784075] [2024-10-14 17:12:51,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303784075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:51,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:51,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:51,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792935606] [2024-10-14 17:12:51,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:51,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:51,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:51,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:51,776 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:51,830 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:12:51,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 983 places, 1014 transitions, 2096 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:51,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:12:51,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:52,818 INFO L124 PetriNetUnfolderBase]: 181/3054 cut-off events. [2024-10-14 17:12:52,819 INFO L125 PetriNetUnfolderBase]: For 46/58 co-relation queries the response was YES. [2024-10-14 17:12:52,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3261 conditions, 3054 events. 181/3054 cut-off events. For 46/58 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 22278 event pairs, 37 based on Foata normal form. 1/2533 useless extension candidates. Maximal degree in co-relation 2512. Up to 139 conditions per place. [2024-10-14 17:12:52,937 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 2 changer transitions 0/1015 dead transitions. [2024-10-14 17:12:52,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 984 places, 1015 transitions, 2148 flow [2024-10-14 17:12:52,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:52,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:52,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3214 transitions. [2024-10-14 17:12:52,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9686558167570826 [2024-10-14 17:12:52,942 INFO L175 Difference]: Start difference. First operand has 983 places, 1014 transitions, 2096 flow. Second operand 3 states and 3214 transitions. [2024-10-14 17:12:52,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 984 places, 1015 transitions, 2148 flow [2024-10-14 17:12:52,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 982 places, 1015 transitions, 2142 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:52,959 INFO L231 Difference]: Finished difference. Result has 982 places, 1013 transitions, 2092 flow [2024-10-14 17:12:52,960 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2088, PETRI_DIFFERENCE_MINUEND_PLACES=980, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1013, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1011, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2092, PETRI_PLACES=982, PETRI_TRANSITIONS=1013} [2024-10-14 17:12:52,961 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -54 predicate places. [2024-10-14 17:12:52,961 INFO L471 AbstractCegarLoop]: Abstraction has has 982 places, 1013 transitions, 2092 flow [2024-10-14 17:12:52,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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:52,962 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:52,962 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] [2024-10-14 17:12:52,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 17:12:52,963 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:52,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:52,963 INFO L85 PathProgramCache]: Analyzing trace with hash 810340390, now seen corresponding path program 1 times [2024-10-14 17:12:52,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:52,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728137435] [2024-10-14 17:12:52,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:52,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:52,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:53,032 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:53,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:53,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728137435] [2024-10-14 17:12:53,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728137435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:53,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:53,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:53,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108871260] [2024-10-14 17:12:53,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:53,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:53,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:53,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:53,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:53,071 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1106 [2024-10-14 17:12:53,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 982 places, 1013 transitions, 2092 flow. Second operand has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 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,074 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:53,074 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1106 [2024-10-14 17:12:53,074 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:54,617 INFO L124 PetriNetUnfolderBase]: 298/5501 cut-off events. [2024-10-14 17:12:54,617 INFO L125 PetriNetUnfolderBase]: For 14/28 co-relation queries the response was YES. [2024-10-14 17:12:54,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5749 conditions, 5501 events. 298/5501 cut-off events. For 14/28 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 44825 event pairs, 15 based on Foata normal form. 0/4550 useless extension candidates. Maximal degree in co-relation 5383. Up to 66 conditions per place. [2024-10-14 17:12:54,791 INFO L140 encePairwiseOnDemand]: 1092/1106 looper letters, 18 selfloop transitions, 9 changer transitions 0/1014 dead transitions. [2024-10-14 17:12:54,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1014 transitions, 2150 flow [2024-10-14 17:12:54,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:54,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:54,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3212 transitions. [2024-10-14 17:12:54,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9680530440024111 [2024-10-14 17:12:54,793 INFO L175 Difference]: Start difference. First operand has 982 places, 1013 transitions, 2092 flow. Second operand 3 states and 3212 transitions. [2024-10-14 17:12:54,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1014 transitions, 2150 flow [2024-10-14 17:12:54,798 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 977 places, 1014 transitions, 2146 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:54,804 INFO L231 Difference]: Finished difference. Result has 978 places, 1012 transitions, 2121 flow [2024-10-14 17:12:54,805 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2078, PETRI_DIFFERENCE_MINUEND_PLACES=975, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1008, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=999, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2121, PETRI_PLACES=978, PETRI_TRANSITIONS=1012} [2024-10-14 17:12:54,806 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2024-10-14 17:12:54,806 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1012 transitions, 2121 flow [2024-10-14 17:12:54,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1061.6666666666667) internal successors, (3185), 3 states have internal predecessors, (3185), 0 states have call successors, (0), 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,807 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:54,807 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:54,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 17:12:54,807 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:54,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:54,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1187461988, now seen corresponding path program 1 times [2024-10-14 17:12:54,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:54,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540392459] [2024-10-14 17:12:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:54,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:54,862 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:54,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:54,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540392459] [2024-10-14 17:12:54,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540392459] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:54,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:54,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:54,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329611205] [2024-10-14 17:12:54,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:54,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:54,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:54,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:54,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:54,910 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1106 [2024-10-14 17:12:54,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1012 transitions, 2121 flow. Second operand has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 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,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:54,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1106 [2024-10-14 17:12:54,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:56,005 INFO L124 PetriNetUnfolderBase]: 285/5369 cut-off events. [2024-10-14 17:12:56,006 INFO L125 PetriNetUnfolderBase]: For 113/166 co-relation queries the response was YES. [2024-10-14 17:12:56,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5672 conditions, 5369 events. 285/5369 cut-off events. For 113/166 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 47643 event pairs, 30 based on Foata normal form. 0/4449 useless extension candidates. Maximal degree in co-relation 5079. Up to 104 conditions per place. [2024-10-14 17:12:56,148 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 22 selfloop transitions, 3 changer transitions 0/1013 dead transitions. [2024-10-14 17:12:56,148 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 979 places, 1013 transitions, 2175 flow [2024-10-14 17:12:56,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:56,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:56,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3220 transitions. [2024-10-14 17:12:56,151 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9704641350210971 [2024-10-14 17:12:56,151 INFO L175 Difference]: Start difference. First operand has 978 places, 1012 transitions, 2121 flow. Second operand 3 states and 3220 transitions. [2024-10-14 17:12:56,151 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 979 places, 1013 transitions, 2175 flow [2024-10-14 17:12:56,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 978 places, 1013 transitions, 2166 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:56,164 INFO L231 Difference]: Finished difference. Result has 978 places, 1011 transitions, 2116 flow [2024-10-14 17:12:56,165 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2110, PETRI_DIFFERENCE_MINUEND_PLACES=976, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1011, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1008, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2116, PETRI_PLACES=978, PETRI_TRANSITIONS=1011} [2024-10-14 17:12:56,166 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -58 predicate places. [2024-10-14 17:12:56,166 INFO L471 AbstractCegarLoop]: Abstraction has has 978 places, 1011 transitions, 2116 flow [2024-10-14 17:12:56,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.0) internal successors, (3204), 3 states have internal predecessors, (3204), 0 states have call successors, (0), 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,167 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:56,167 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] [2024-10-14 17:12:56,167 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 17:12:56,167 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting thread3Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:56,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:56,168 INFO L85 PathProgramCache]: Analyzing trace with hash -2146120854, now seen corresponding path program 1 times [2024-10-14 17:12:56,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:56,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313583955] [2024-10-14 17:12:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:56,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:56,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:56,208 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:56,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:56,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313583955] [2024-10-14 17:12:56,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313583955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:56,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:56,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:56,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595234081] [2024-10-14 17:12:56,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:56,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:56,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:56,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:56,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:56,249 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1060 out of 1106 [2024-10-14 17:12:56,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 978 places, 1011 transitions, 2116 flow. Second operand has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 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,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:56,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1060 of 1106 [2024-10-14 17:12:56,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:57,016 INFO L124 PetriNetUnfolderBase]: 174/3094 cut-off events. [2024-10-14 17:12:57,017 INFO L125 PetriNetUnfolderBase]: For 43/50 co-relation queries the response was YES. [2024-10-14 17:12:57,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3348 conditions, 3094 events. 174/3094 cut-off events. For 43/50 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 22109 event pairs, 12 based on Foata normal form. 3/2619 useless extension candidates. Maximal degree in co-relation 2572. Up to 90 conditions per place. [2024-10-14 17:12:57,124 INFO L140 encePairwiseOnDemand]: 1092/1106 looper letters, 16 selfloop transitions, 8 changer transitions 12/1012 dead transitions. [2024-10-14 17:12:57,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 975 places, 1012 transitions, 2172 flow [2024-10-14 17:12:57,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:57,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:57,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3211 transitions. [2024-10-14 17:12:57,127 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9677516576250753 [2024-10-14 17:12:57,127 INFO L175 Difference]: Start difference. First operand has 978 places, 1011 transitions, 2116 flow. Second operand 3 states and 3211 transitions. [2024-10-14 17:12:57,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 975 places, 1012 transitions, 2172 flow [2024-10-14 17:12:57,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 973 places, 1012 transitions, 2166 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:12:57,141 INFO L231 Difference]: Finished difference. Result has 974 places, 998 transitions, 2111 flow [2024-10-14 17:12:57,143 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2100, PETRI_DIFFERENCE_MINUEND_PLACES=971, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1006, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=998, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2111, PETRI_PLACES=974, PETRI_TRANSITIONS=998} [2024-10-14 17:12:57,143 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -62 predicate places. [2024-10-14 17:12:57,143 INFO L471 AbstractCegarLoop]: Abstraction has has 974 places, 998 transitions, 2111 flow [2024-10-14 17:12:57,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1062.0) internal successors, (3186), 3 states have internal predecessors, (3186), 0 states have call successors, (0), 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,144 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:57,144 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] [2024-10-14 17:12:57,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 17:12:57,145 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:57,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:57,145 INFO L85 PathProgramCache]: Analyzing trace with hash 2042329193, now seen corresponding path program 1 times [2024-10-14 17:12:57,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:57,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882928518] [2024-10-14 17:12:57,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:57,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:57,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:12:57,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:57,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882928518] [2024-10-14 17:12:57,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882928518] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:57,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:57,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:12:57,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069781253] [2024-10-14 17:12:57,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:57,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:57,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:57,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:57,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:57,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1106 [2024-10-14 17:12:57,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 974 places, 998 transitions, 2111 flow. Second operand has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 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,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:57,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1106 [2024-10-14 17:12:57,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:12:58,389 INFO L124 PetriNetUnfolderBase]: 215/4625 cut-off events. [2024-10-14 17:12:58,389 INFO L125 PetriNetUnfolderBase]: For 40/50 co-relation queries the response was YES. [2024-10-14 17:12:58,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4954 conditions, 4625 events. 215/4625 cut-off events. For 40/50 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 38946 event pairs, 4 based on Foata normal form. 1/3901 useless extension candidates. Maximal degree in co-relation 4558. Up to 73 conditions per place. [2024-10-14 17:12:58,581 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 16 selfloop transitions, 2 changer transitions 0/1003 dead transitions. [2024-10-14 17:12:58,581 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 965 places, 1003 transitions, 2161 flow [2024-10-14 17:12:58,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:12:58,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:12:58,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3235 transitions. [2024-10-14 17:12:58,583 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9749849306811332 [2024-10-14 17:12:58,583 INFO L175 Difference]: Start difference. First operand has 974 places, 998 transitions, 2111 flow. Second operand 3 states and 3235 transitions. [2024-10-14 17:12:58,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 965 places, 1003 transitions, 2161 flow [2024-10-14 17:12:58,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 964 places, 1003 transitions, 2153 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:12:58,598 INFO L231 Difference]: Finished difference. Result has 966 places, 999 transitions, 2117 flow [2024-10-14 17:12:58,599 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2103, PETRI_DIFFERENCE_MINUEND_PLACES=962, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=998, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=996, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2117, PETRI_PLACES=966, PETRI_TRANSITIONS=999} [2024-10-14 17:12:58,601 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -70 predicate places. [2024-10-14 17:12:58,601 INFO L471 AbstractCegarLoop]: Abstraction has has 966 places, 999 transitions, 2117 flow [2024-10-14 17:12:58,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.3333333333333) internal successors, (3223), 3 states have internal predecessors, (3223), 0 states have call successors, (0), 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:58,602 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:12:58,602 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] [2024-10-14 17:12:58,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 17:12:58,602 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:12:58,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:12:58,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1304560711, now seen corresponding path program 1 times [2024-10-14 17:12:58,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:12:58,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904660512] [2024-10-14 17:12:58,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:12:58,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:12:58,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:12:58,648 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:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:12:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904660512] [2024-10-14 17:12:58,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904660512] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:12:58,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:12:58,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:12:58,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281663434] [2024-10-14 17:12:58,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:12:58,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:12:58,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:12:58,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:12:58,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:12:58,699 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1106 [2024-10-14 17:12:58,700 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 966 places, 999 transitions, 2117 flow. Second operand has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 0 states have call successors, (0), 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:58,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:12:58,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1106 [2024-10-14 17:12:58,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:01,100 INFO L124 PetriNetUnfolderBase]: 488/9044 cut-off events. [2024-10-14 17:13:01,100 INFO L125 PetriNetUnfolderBase]: For 6/42 co-relation queries the response was YES. [2024-10-14 17:13:01,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9831 conditions, 9044 events. 488/9044 cut-off events. For 6/42 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 83191 event pairs, 14 based on Foata normal form. 2/7653 useless extension candidates. Maximal degree in co-relation 8206. Up to 166 conditions per place. [2024-10-14 17:13:01,279 INFO L140 encePairwiseOnDemand]: 1089/1106 looper letters, 23 selfloop transitions, 9 changer transitions 0/997 dead transitions. [2024-10-14 17:13:01,279 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 960 places, 997 transitions, 2179 flow [2024-10-14 17:13:01,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:01,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2024-10-14 17:13:01,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623267028330319 [2024-10-14 17:13:01,282 INFO L175 Difference]: Start difference. First operand has 966 places, 999 transitions, 2117 flow. Second operand 3 states and 3193 transitions. [2024-10-14 17:13:01,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 960 places, 997 transitions, 2179 flow [2024-10-14 17:13:01,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2177 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:01,295 INFO L231 Difference]: Finished difference. Result has 961 places, 995 transitions, 2151 flow [2024-10-14 17:13:01,296 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2099, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=991, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2151, PETRI_PLACES=961, PETRI_TRANSITIONS=995} [2024-10-14 17:13:01,296 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2024-10-14 17:13:01,297 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 995 transitions, 2151 flow [2024-10-14 17:13:01,297 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1052.6666666666667) internal successors, (3158), 3 states have internal predecessors, (3158), 0 states have call successors, (0), 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:01,297 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:01,298 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:13:01,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 17:13:01,298 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting thread3Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:01,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:01,298 INFO L85 PathProgramCache]: Analyzing trace with hash -229767859, now seen corresponding path program 1 times [2024-10-14 17:13:01,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:01,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670170084] [2024-10-14 17:13:01,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:01,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:01,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:01,338 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:13:01,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:01,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670170084] [2024-10-14 17:13:01,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670170084] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:01,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:01,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:01,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453015227] [2024-10-14 17:13:01,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:01,339 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:01,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:01,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:01,385 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1066 out of 1106 [2024-10-14 17:13:01,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 995 transitions, 2151 flow. Second operand has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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:01,387 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:01,387 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1066 of 1106 [2024-10-14 17:13:01,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:02,433 INFO L124 PetriNetUnfolderBase]: 259/4215 cut-off events. [2024-10-14 17:13:02,433 INFO L125 PetriNetUnfolderBase]: For 202/224 co-relation queries the response was YES. [2024-10-14 17:13:02,575 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4739 conditions, 4215 events. 259/4215 cut-off events. For 202/224 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 33593 event pairs, 60 based on Foata normal form. 1/3547 useless extension candidates. Maximal degree in co-relation 3938. Up to 212 conditions per place. [2024-10-14 17:13:02,616 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 20 selfloop transitions, 3 changer transitions 0/996 dead transitions. [2024-10-14 17:13:02,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 962 places, 996 transitions, 2201 flow [2024-10-14 17:13:02,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:02,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:02,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3218 transitions. [2024-10-14 17:13:02,620 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9698613622664256 [2024-10-14 17:13:02,620 INFO L175 Difference]: Start difference. First operand has 961 places, 995 transitions, 2151 flow. Second operand 3 states and 3218 transitions. [2024-10-14 17:13:02,620 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 962 places, 996 transitions, 2201 flow [2024-10-14 17:13:02,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 960 places, 996 transitions, 2183 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:02,634 INFO L231 Difference]: Finished difference. Result has 960 places, 994 transitions, 2137 flow [2024-10-14 17:13:02,635 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2131, PETRI_DIFFERENCE_MINUEND_PLACES=958, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=994, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2137, PETRI_PLACES=960, PETRI_TRANSITIONS=994} [2024-10-14 17:13:02,635 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -76 predicate places. [2024-10-14 17:13:02,636 INFO L471 AbstractCegarLoop]: Abstraction has has 960 places, 994 transitions, 2137 flow [2024-10-14 17:13:02,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1068.3333333333333) internal successors, (3205), 3 states have internal predecessors, (3205), 0 states have call successors, (0), 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:02,636 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:02,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 17:13:02,637 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting thread1Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:02,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:02,637 INFO L85 PathProgramCache]: Analyzing trace with hash 495168664, now seen corresponding path program 1 times [2024-10-14 17:13:02,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:02,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181311637] [2024-10-14 17:13:02,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:02,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:02,683 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:13:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:02,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181311637] [2024-10-14 17:13:02,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181311637] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:02,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:02,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:02,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92975666] [2024-10-14 17:13:02,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:02,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:02,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:02,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:02,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:02,737 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:13:02,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 960 places, 994 transitions, 2137 flow. Second operand has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 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:02,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:02,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:13:02,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:04,430 INFO L124 PetriNetUnfolderBase]: 367/7045 cut-off events. [2024-10-14 17:13:04,430 INFO L125 PetriNetUnfolderBase]: For 97/135 co-relation queries the response was YES. [2024-10-14 17:13:04,620 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7758 conditions, 7045 events. 367/7045 cut-off events. For 97/135 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 67997 event pairs, 48 based on Foata normal form. 2/5984 useless extension candidates. Maximal degree in co-relation 6189. Up to 147 conditions per place. [2024-10-14 17:13:04,675 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 24 selfloop transitions, 3 changer transitions 0/995 dead transitions. [2024-10-14 17:13:04,675 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 995 transitions, 2195 flow [2024-10-14 17:13:04,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:04,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:04,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-10-14 17:13:04,677 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-10-14 17:13:04,677 INFO L175 Difference]: Start difference. First operand has 960 places, 994 transitions, 2137 flow. Second operand 3 states and 3213 transitions. [2024-10-14 17:13:04,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 995 transitions, 2195 flow [2024-10-14 17:13:04,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 995 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:04,689 INFO L231 Difference]: Finished difference. Result has 959 places, 993 transitions, 2135 flow [2024-10-14 17:13:04,689 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=990, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2135, PETRI_PLACES=959, PETRI_TRANSITIONS=993} [2024-10-14 17:13:04,690 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -77 predicate places. [2024-10-14 17:13:04,690 INFO L471 AbstractCegarLoop]: Abstraction has has 959 places, 993 transitions, 2135 flow [2024-10-14 17:13:04,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.0) internal successors, (3195), 3 states have internal predecessors, (3195), 0 states have call successors, (0), 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:04,690 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:04,690 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:04,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 17:13:04,691 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:04,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:04,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1009766766, now seen corresponding path program 1 times [2024-10-14 17:13:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233441975] [2024-10-14 17:13:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:04,733 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:13:04,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233441975] [2024-10-14 17:13:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233441975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:04,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:04,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:04,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280424786] [2024-10-14 17:13:04,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:04,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:04,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:04,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:04,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:04,777 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1106 [2024-10-14 17:13:04,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 959 places, 993 transitions, 2135 flow. Second operand has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 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:04,779 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:04,779 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1106 [2024-10-14 17:13:04,779 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:06,719 INFO L124 PetriNetUnfolderBase]: 267/5679 cut-off events. [2024-10-14 17:13:06,719 INFO L125 PetriNetUnfolderBase]: For 14/70 co-relation queries the response was YES. [2024-10-14 17:13:07,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6074 conditions, 5679 events. 267/5679 cut-off events. For 14/70 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 50446 event pairs, 10 based on Foata normal form. 0/4793 useless extension candidates. Maximal degree in co-relation 4921. Up to 89 conditions per place. [2024-10-14 17:13:07,083 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 15 selfloop transitions, 2 changer transitions 0/997 dead transitions. [2024-10-14 17:13:07,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 961 places, 997 transitions, 2180 flow [2024-10-14 17:13:07,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:07,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3234 transitions. [2024-10-14 17:13:07,084 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9746835443037974 [2024-10-14 17:13:07,085 INFO L175 Difference]: Start difference. First operand has 959 places, 993 transitions, 2135 flow. Second operand 3 states and 3234 transitions. [2024-10-14 17:13:07,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 961 places, 997 transitions, 2180 flow [2024-10-14 17:13:07,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 959 places, 997 transitions, 2174 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:07,095 INFO L231 Difference]: Finished difference. Result has 961 places, 994 transitions, 2143 flow [2024-10-14 17:13:07,096 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2129, PETRI_DIFFERENCE_MINUEND_PLACES=957, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=993, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=991, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2143, PETRI_PLACES=961, PETRI_TRANSITIONS=994} [2024-10-14 17:13:07,096 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -75 predicate places. [2024-10-14 17:13:07,097 INFO L471 AbstractCegarLoop]: Abstraction has has 961 places, 994 transitions, 2143 flow [2024-10-14 17:13:07,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1074.6666666666667) internal successors, (3224), 3 states have internal predecessors, (3224), 0 states have call successors, (0), 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:07,097 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:07,098 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:07,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 17:13:07,098 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:07,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:07,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1149522604, now seen corresponding path program 1 times [2024-10-14 17:13:07,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:07,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660251359] [2024-10-14 17:13:07,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:07,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:07,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:07,142 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:13:07,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:07,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660251359] [2024-10-14 17:13:07,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660251359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:07,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:07,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:07,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407324215] [2024-10-14 17:13:07,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:07,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:07,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:07,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:07,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:07,189 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1106 [2024-10-14 17:13:07,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 961 places, 994 transitions, 2143 flow. Second operand has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 0 states have call successors, (0), 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:07,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:07,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1106 [2024-10-14 17:13:07,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:10,819 INFO L124 PetriNetUnfolderBase]: 631/10693 cut-off events. [2024-10-14 17:13:10,819 INFO L125 PetriNetUnfolderBase]: For 84/224 co-relation queries the response was YES. [2024-10-14 17:13:11,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11792 conditions, 10693 events. 631/10693 cut-off events. For 84/224 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 110720 event pairs, 67 based on Foata normal form. 0/9062 useless extension candidates. Maximal degree in co-relation 9698. Up to 336 conditions per place. [2024-10-14 17:13:11,406 INFO L140 encePairwiseOnDemand]: 1089/1106 looper letters, 23 selfloop transitions, 9 changer transitions 0/992 dead transitions. [2024-10-14 17:13:11,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 955 places, 992 transitions, 2205 flow [2024-10-14 17:13:11,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:11,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:11,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2024-10-14 17:13:11,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623267028330319 [2024-10-14 17:13:11,408 INFO L175 Difference]: Start difference. First operand has 961 places, 994 transitions, 2143 flow. Second operand 3 states and 3193 transitions. [2024-10-14 17:13:11,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 955 places, 992 transitions, 2205 flow [2024-10-14 17:13:11,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 954 places, 992 transitions, 2203 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:11,421 INFO L231 Difference]: Finished difference. Result has 956 places, 990 transitions, 2177 flow [2024-10-14 17:13:11,421 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2125, PETRI_DIFFERENCE_MINUEND_PLACES=952, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=977, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2177, PETRI_PLACES=956, PETRI_TRANSITIONS=990} [2024-10-14 17:13:11,422 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -80 predicate places. [2024-10-14 17:13:11,422 INFO L471 AbstractCegarLoop]: Abstraction has has 956 places, 990 transitions, 2177 flow [2024-10-14 17:13:11,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.0) internal successors, (3159), 3 states have internal predecessors, (3159), 0 states have call successors, (0), 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:11,422 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:11,423 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:11,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-14 17:13:11,423 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting thread2Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:11,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:11,423 INFO L85 PathProgramCache]: Analyzing trace with hash -16045080, now seen corresponding path program 1 times [2024-10-14 17:13:11,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:11,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892694584] [2024-10-14 17:13:11,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:11,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:11,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:11,471 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:13:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [892694584] [2024-10-14 17:13:11,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [892694584] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:11,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:11,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86081450] [2024-10-14 17:13:11,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:11,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:11,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:11,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:11,531 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:13:11,533 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 956 places, 990 transitions, 2177 flow. Second operand has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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:11,533 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:11,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:13:11,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:14,367 INFO L124 PetriNetUnfolderBase]: 484/8694 cut-off events. [2024-10-14 17:13:14,367 INFO L125 PetriNetUnfolderBase]: For 386/624 co-relation queries the response was YES. [2024-10-14 17:13:14,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9790 conditions, 8694 events. 484/8694 cut-off events. For 386/624 co-relation queries the response was YES. Maximal size of possible extension queue 129. Compared 92475 event pairs, 95 based on Foata normal form. 0/7387 useless extension candidates. Maximal degree in co-relation 7926. Up to 284 conditions per place. [2024-10-14 17:13:14,983 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 24 selfloop transitions, 3 changer transitions 0/991 dead transitions. [2024-10-14 17:13:14,983 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 957 places, 991 transitions, 2235 flow [2024-10-14 17:13:14,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-10-14 17:13:14,985 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-10-14 17:13:14,985 INFO L175 Difference]: Start difference. First operand has 956 places, 990 transitions, 2177 flow. Second operand 3 states and 3213 transitions. [2024-10-14 17:13:14,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 957 places, 991 transitions, 2235 flow [2024-10-14 17:13:14,990 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 955 places, 991 transitions, 2217 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:14,995 INFO L231 Difference]: Finished difference. Result has 955 places, 989 transitions, 2163 flow [2024-10-14 17:13:14,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2157, PETRI_DIFFERENCE_MINUEND_PLACES=953, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=989, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=986, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=955, PETRI_TRANSITIONS=989} [2024-10-14 17:13:14,996 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -81 predicate places. [2024-10-14 17:13:14,996 INFO L471 AbstractCegarLoop]: Abstraction has has 955 places, 989 transitions, 2163 flow [2024-10-14 17:13:14,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.3333333333333) internal successors, (3196), 3 states have internal predecessors, (3196), 0 states have call successors, (0), 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:14,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:14,997 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-14 17:13:14,997 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:14,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:14,998 INFO L85 PathProgramCache]: Analyzing trace with hash -31077981, now seen corresponding path program 1 times [2024-10-14 17:13:14,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:14,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267232163] [2024-10-14 17:13:14,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:14,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:15,090 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:13:15,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:15,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267232163] [2024-10-14 17:13:15,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267232163] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:15,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:15,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:15,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293707739] [2024-10-14 17:13:15,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:15,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:15,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:15,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:15,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:15,119 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1106 [2024-10-14 17:13:15,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 955 places, 989 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 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:15,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:15,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1106 [2024-10-14 17:13:15,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:16,988 INFO L124 PetriNetUnfolderBase]: 263/5241 cut-off events. [2024-10-14 17:13:16,988 INFO L125 PetriNetUnfolderBase]: For 12/84 co-relation queries the response was YES. [2024-10-14 17:13:17,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5874 conditions, 5241 events. 263/5241 cut-off events. For 12/84 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 48294 event pairs, 6 based on Foata normal form. 2/4548 useless extension candidates. Maximal degree in co-relation 4566. Up to 106 conditions per place. [2024-10-14 17:13:17,327 INFO L140 encePairwiseOnDemand]: 1099/1106 looper letters, 15 selfloop transitions, 3 changer transitions 0/987 dead transitions. [2024-10-14 17:13:17,327 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 987 transitions, 2197 flow [2024-10-14 17:13:17,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:17,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3217 transitions. [2024-10-14 17:13:17,329 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9695599758890898 [2024-10-14 17:13:17,329 INFO L175 Difference]: Start difference. First operand has 955 places, 989 transitions, 2163 flow. Second operand 3 states and 3217 transitions. [2024-10-14 17:13:17,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 987 transitions, 2197 flow [2024-10-14 17:13:17,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 987 transitions, 2191 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:17,339 INFO L231 Difference]: Finished difference. Result has 951 places, 985 transitions, 2155 flow [2024-10-14 17:13:17,339 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=982, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2155, PETRI_PLACES=951, PETRI_TRANSITIONS=985} [2024-10-14 17:13:17,340 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -85 predicate places. [2024-10-14 17:13:17,340 INFO L471 AbstractCegarLoop]: Abstraction has has 951 places, 985 transitions, 2155 flow [2024-10-14 17:13:17,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1066.6666666666667) internal successors, (3200), 3 states have internal predecessors, (3200), 0 states have call successors, (0), 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:17,340 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:17,340 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:17,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-10-14 17:13:17,341 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:17,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:17,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1475772814, now seen corresponding path program 1 times [2024-10-14 17:13:17,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:17,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856888514] [2024-10-14 17:13:17,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:17,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:17,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:17,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:13:17,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:17,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856888514] [2024-10-14 17:13:17,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856888514] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:17,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:17,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:13:17,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142338173] [2024-10-14 17:13:17,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:17,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:17,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:17,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:17,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:17,440 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1072 out of 1106 [2024-10-14 17:13:17,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 951 places, 985 transitions, 2155 flow. Second operand has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 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:17,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:17,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1072 of 1106 [2024-10-14 17:13:17,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:20,225 INFO L124 PetriNetUnfolderBase]: 386/8361 cut-off events. [2024-10-14 17:13:20,226 INFO L125 PetriNetUnfolderBase]: For 34/66 co-relation queries the response was YES. [2024-10-14 17:13:20,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 8361 events. 386/8361 cut-off events. For 34/66 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 76279 event pairs, 24 based on Foata normal form. 2/7038 useless extension candidates. Maximal degree in co-relation 7682. Up to 175 conditions per place. [2024-10-14 17:13:20,764 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 14 selfloop transitions, 2 changer transitions 0/988 dead transitions. [2024-10-14 17:13:20,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 953 places, 988 transitions, 2195 flow [2024-10-14 17:13:20,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:20,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3233 transitions. [2024-10-14 17:13:20,766 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9743821579264618 [2024-10-14 17:13:20,766 INFO L175 Difference]: Start difference. First operand has 951 places, 985 transitions, 2155 flow. Second operand 3 states and 3233 transitions. [2024-10-14 17:13:20,766 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 953 places, 988 transitions, 2195 flow [2024-10-14 17:13:20,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 951 places, 988 transitions, 2189 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:20,775 INFO L231 Difference]: Finished difference. Result has 953 places, 986 transitions, 2163 flow [2024-10-14 17:13:20,776 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2149, PETRI_DIFFERENCE_MINUEND_PLACES=949, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=985, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=983, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2163, PETRI_PLACES=953, PETRI_TRANSITIONS=986} [2024-10-14 17:13:20,776 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -83 predicate places. [2024-10-14 17:13:20,776 INFO L471 AbstractCegarLoop]: Abstraction has has 953 places, 986 transitions, 2163 flow [2024-10-14 17:13:20,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1075.0) internal successors, (3225), 3 states have internal predecessors, (3225), 0 states have call successors, (0), 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,777 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:20,777 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:20,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-10-14 17:13:20,777 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting thread3Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:20,778 INFO L85 PathProgramCache]: Analyzing trace with hash 547811664, now seen corresponding path program 1 times [2024-10-14 17:13:20,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:20,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884405828] [2024-10-14 17:13:20,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:20,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:20,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:20,821 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:13:20,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:20,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884405828] [2024-10-14 17:13:20,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884405828] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:20,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:20,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:20,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720786510] [2024-10-14 17:13:20,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:20,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:20,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:20,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:20,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:20,866 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1051 out of 1106 [2024-10-14 17:13:20,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 953 places, 986 transitions, 2163 flow. Second operand has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 0 states have call successors, (0), 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,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:20,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1051 of 1106 [2024-10-14 17:13:20,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:24,590 INFO L124 PetriNetUnfolderBase]: 702/10384 cut-off events. [2024-10-14 17:13:24,590 INFO L125 PetriNetUnfolderBase]: For 326/386 co-relation queries the response was YES. [2024-10-14 17:13:24,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11899 conditions, 10384 events. 702/10384 cut-off events. For 326/386 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 116425 event pairs, 54 based on Foata normal form. 2/8868 useless extension candidates. Maximal degree in co-relation 10283. Up to 682 conditions per place. [2024-10-14 17:13:25,084 INFO L140 encePairwiseOnDemand]: 1089/1106 looper letters, 23 selfloop transitions, 9 changer transitions 0/984 dead transitions. [2024-10-14 17:13:25,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 947 places, 984 transitions, 2225 flow [2024-10-14 17:13:25,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:25,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3193 transitions. [2024-10-14 17:13:25,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9623267028330319 [2024-10-14 17:13:25,086 INFO L175 Difference]: Start difference. First operand has 953 places, 986 transitions, 2163 flow. Second operand 3 states and 3193 transitions. [2024-10-14 17:13:25,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 947 places, 984 transitions, 2225 flow [2024-10-14 17:13:25,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 946 places, 984 transitions, 2223 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:13:25,098 INFO L231 Difference]: Finished difference. Result has 948 places, 982 transitions, 2197 flow [2024-10-14 17:13:25,098 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2145, PETRI_DIFFERENCE_MINUEND_PLACES=944, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=978, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=969, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2197, PETRI_PLACES=948, PETRI_TRANSITIONS=982} [2024-10-14 17:13:25,098 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -88 predicate places. [2024-10-14 17:13:25,099 INFO L471 AbstractCegarLoop]: Abstraction has has 948 places, 982 transitions, 2197 flow [2024-10-14 17:13:25,099 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1053.3333333333333) internal successors, (3160), 3 states have internal predecessors, (3160), 0 states have call successors, (0), 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,099 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:25,099 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:25,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-10-14 17:13:25,099 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting thread3Err9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:25,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:25,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1489214759, now seen corresponding path program 1 times [2024-10-14 17:13:25,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:25,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523524683] [2024-10-14 17:13:25,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:25,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:25,148 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:13:25,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:25,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523524683] [2024-10-14 17:13:25,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523524683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:25,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:25,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:25,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123252467] [2024-10-14 17:13:25,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:25,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:25,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:25,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:25,211 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1063 out of 1106 [2024-10-14 17:13:25,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 948 places, 982 transitions, 2197 flow. Second operand has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 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,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:25,213 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1063 of 1106 [2024-10-14 17:13:25,213 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:13:29,105 INFO L124 PetriNetUnfolderBase]: 630/10286 cut-off events. [2024-10-14 17:13:29,106 INFO L125 PetriNetUnfolderBase]: For 904/972 co-relation queries the response was YES. [2024-10-14 17:13:29,442 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12120 conditions, 10286 events. 630/10286 cut-off events. For 904/972 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 112723 event pairs, 190 based on Foata normal form. 2/8814 useless extension candidates. Maximal degree in co-relation 10447. Up to 585 conditions per place. [2024-10-14 17:13:29,530 INFO L140 encePairwiseOnDemand]: 1103/1106 looper letters, 24 selfloop transitions, 3 changer transitions 0/983 dead transitions. [2024-10-14 17:13:29,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 949 places, 983 transitions, 2255 flow [2024-10-14 17:13:29,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:13:29,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:13:29,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 3213 transitions. [2024-10-14 17:13:29,533 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9683544303797469 [2024-10-14 17:13:29,533 INFO L175 Difference]: Start difference. First operand has 948 places, 982 transitions, 2197 flow. Second operand 3 states and 3213 transitions. [2024-10-14 17:13:29,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 949 places, 983 transitions, 2255 flow [2024-10-14 17:13:29,538 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 947 places, 983 transitions, 2237 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:13:29,543 INFO L231 Difference]: Finished difference. Result has 947 places, 981 transitions, 2183 flow [2024-10-14 17:13:29,544 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=1106, PETRI_DIFFERENCE_MINUEND_FLOW=2177, PETRI_DIFFERENCE_MINUEND_PLACES=945, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=981, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=978, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2183, PETRI_PLACES=947, PETRI_TRANSITIONS=981} [2024-10-14 17:13:29,544 INFO L277 CegarLoopForPetriNet]: 1036 programPoint places, -89 predicate places. [2024-10-14 17:13:29,544 INFO L471 AbstractCegarLoop]: Abstraction has has 947 places, 981 transitions, 2183 flow [2024-10-14 17:13:29,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1065.6666666666667) internal successors, (3197), 3 states have internal predecessors, (3197), 0 states have call successors, (0), 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:29,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:13:29,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:13:29,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-10-14 17:13:29,545 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting thread2Err36ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 277 more)] === [2024-10-14 17:13:29,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:13:29,546 INFO L85 PathProgramCache]: Analyzing trace with hash 1028921939, now seen corresponding path program 1 times [2024-10-14 17:13:29,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:13:29,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858107804] [2024-10-14 17:13:29,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:13:29,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:13:29,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:13:29,604 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:13:29,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:13:29,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858107804] [2024-10-14 17:13:29,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1858107804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:13:29,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:13:29,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:13:29,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394205991] [2024-10-14 17:13:29,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:13:29,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:13:29,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:13:29,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:13:29,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:13:29,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 1065 out of 1106 [2024-10-14 17:13:29,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 947 places, 981 transitions, 2183 flow. Second operand has 3 states, 3 states have (on average 1067.0) internal successors, (3201), 3 states have internal predecessors, (3201), 0 states have call successors, (0), 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:29,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:13:29,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1065 of 1106 [2024-10-14 17:13:29,633 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand